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.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:31:20,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:31:20,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:31:20,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:31:20,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:31:20,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:31:20,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:31:20,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:31:20,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:31:20,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:31:20,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:31:20,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:31:20,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:31:20,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:31:20,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:31:20,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:31:20,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:31:20,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:31:20,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:31:20,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:31:20,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:31:20,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:31:20,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:31:20,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:31:20,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:31:20,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:31:20,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:31:20,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:31:20,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:31:20,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:31:20,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:31:20,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:31:20,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:31:20,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:31:20,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:31:20,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:31:20,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:31:20,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:31:20,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:31:20,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:31:20,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:31:20,730 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:31:20,757 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:31:20,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:31:20,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:31:20,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:31:20,760 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:31:20,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:31:20,760 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:31:20,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:31:20,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:31:20,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:31:20,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:31:20,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:31:20,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:31:20,763 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:31:20,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:31:20,763 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:31:20,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:31:20,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:31:20,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:31:20,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:31:20,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:31:20,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:31:20,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:31:20,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:31:20,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:31:20,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:31:20,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:31:20,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:31:20,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:31:20,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:31:20,808 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:31:20,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:31:20,813 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:31:20,813 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:31:20,815 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.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 13:31:20,887 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7249621/0f87ae3922d047a7916eb0a5f5cd3a89/FLAGaab35cb89 [2019-09-08 13:31:21,543 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:31:21,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 13:31:21,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7249621/0f87ae3922d047a7916eb0a5f5cd3a89/FLAGaab35cb89 [2019-09-08 13:31:21,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7249621/0f87ae3922d047a7916eb0a5f5cd3a89 [2019-09-08 13:31:21,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:31:21,759 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:31:21,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:31:21,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:31:21,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:31:21,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:31:21" (1/1) ... [2019-09-08 13:31:21,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df20252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:21, skipping insertion in model container [2019-09-08 13:31:21,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:31:21" (1/1) ... [2019-09-08 13:31:21,774 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:31:21,878 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:31:22,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:31:22,676 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:31:22,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:31:22,949 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:31:22,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:22 WrapperNode [2019-09-08 13:31:22,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:31:22,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:31:22,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:31:22,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:31:22,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:22" (1/1) ... [2019-09-08 13:31:22,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:22" (1/1) ... [2019-09-08 13:31:22,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:22" (1/1) ... [2019-09-08 13:31:22,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:22" (1/1) ... [2019-09-08 13:31:23,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:22" (1/1) ... [2019-09-08 13:31:23,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:22" (1/1) ... [2019-09-08 13:31:23,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:22" (1/1) ... [2019-09-08 13:31:23,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:31:23,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:31:23,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:31:23,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:31:23,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:22" (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:31:23,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:31:23,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:31:23,242 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:31:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:31:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:31:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:31:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:31:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:31:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:31:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:31:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:31:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:31:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:31:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:31:23,248 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:31:23,248 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:31:23,251 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:31:23,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:31:23,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:31:23,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:31:25,824 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:31:25,824 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:31:25,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:31:25 BoogieIcfgContainer [2019-09-08 13:31:25,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:31:25,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:31:25,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:31:25,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:31:25,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:31:21" (1/3) ... [2019-09-08 13:31:25,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4822cc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:31:25, skipping insertion in model container [2019-09-08 13:31:25,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:31:22" (2/3) ... [2019-09-08 13:31:25,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4822cc4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:31:25, skipping insertion in model container [2019-09-08 13:31:25,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:31:25" (3/3) ... [2019-09-08 13:31:25,835 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 13:31:25,845 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:31:25,855 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:31:25,872 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:31:25,924 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:31:25,925 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:31:25,925 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:31:25,925 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:31:25,925 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:31:25,926 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:31:25,926 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:31:25,926 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:31:25,926 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:31:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2019-09-08 13:31:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 13:31:26,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:26,011 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] [2019-09-08 13:31:26,013 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:26,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:26,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1832108402, now seen corresponding path program 1 times [2019-09-08 13:31:26,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:26,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:26,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:26,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:26,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:26,885 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:26,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:26,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:26,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:26,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:26,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:26,912 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2019-09-08 13:31:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:27,184 INFO L93 Difference]: Finished difference Result 1207 states and 2146 transitions. [2019-09-08 13:31:27,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:27,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-08 13:31:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:27,212 INFO L225 Difference]: With dead ends: 1207 [2019-09-08 13:31:27,212 INFO L226 Difference]: Without dead ends: 976 [2019-09-08 13:31:27,218 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:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-09-08 13:31:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 974. [2019-09-08 13:31:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-08 13:31:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1686 transitions. [2019-09-08 13:31:27,351 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1686 transitions. Word has length 217 [2019-09-08 13:31:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:27,352 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1686 transitions. [2019-09-08 13:31:27,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1686 transitions. [2019-09-08 13:31:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 13:31:27,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:27,359 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] [2019-09-08 13:31:27,360 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:27,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:27,360 INFO L82 PathProgramCache]: Analyzing trace with hash 475136375, now seen corresponding path program 1 times [2019-09-08 13:31:27,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:27,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:27,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:27,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:27,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:27,724 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:27,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:27,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:27,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:27,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:27,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:27,731 INFO L87 Difference]: Start difference. First operand 974 states and 1686 transitions. Second operand 3 states. [2019-09-08 13:31:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:27,806 INFO L93 Difference]: Finished difference Result 1794 states and 3070 transitions. [2019-09-08 13:31:27,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:27,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-09-08 13:31:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:27,820 INFO L225 Difference]: With dead ends: 1794 [2019-09-08 13:31:27,820 INFO L226 Difference]: Without dead ends: 1372 [2019-09-08 13:31:27,828 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:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-09-08 13:31:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1370. [2019-09-08 13:31:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2019-09-08 13:31:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2353 transitions. [2019-09-08 13:31:27,907 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2353 transitions. Word has length 221 [2019-09-08 13:31:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:27,909 INFO L475 AbstractCegarLoop]: Abstraction has 1370 states and 2353 transitions. [2019-09-08 13:31:27,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2353 transitions. [2019-09-08 13:31:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 13:31:27,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:27,916 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] [2019-09-08 13:31:27,916 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:27,917 INFO L82 PathProgramCache]: Analyzing trace with hash 172719100, now seen corresponding path program 1 times [2019-09-08 13:31:27,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:27,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:27,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:27,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:27,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:28,377 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:28,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:28,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:28,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:28,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:28,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:28,381 INFO L87 Difference]: Start difference. First operand 1370 states and 2353 transitions. Second operand 3 states. [2019-09-08 13:31:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:28,510 INFO L93 Difference]: Finished difference Result 2958 states and 5027 transitions. [2019-09-08 13:31:28,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:28,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-09-08 13:31:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:28,534 INFO L225 Difference]: With dead ends: 2958 [2019-09-08 13:31:28,535 INFO L226 Difference]: Without dead ends: 2140 [2019-09-08 13:31:28,548 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:28,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-09-08 13:31:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2138. [2019-09-08 13:31:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-09-08 13:31:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3641 transitions. [2019-09-08 13:31:28,653 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3641 transitions. Word has length 225 [2019-09-08 13:31:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:28,654 INFO L475 AbstractCegarLoop]: Abstraction has 2138 states and 3641 transitions. [2019-09-08 13:31:28,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3641 transitions. [2019-09-08 13:31:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 13:31:28,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:28,662 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] [2019-09-08 13:31:28,662 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:28,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:28,663 INFO L82 PathProgramCache]: Analyzing trace with hash 300878849, now seen corresponding path program 1 times [2019-09-08 13:31:28,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:28,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:28,950 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:28,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:28,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:28,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:28,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:28,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:28,952 INFO L87 Difference]: Start difference. First operand 2138 states and 3641 transitions. Second operand 3 states. [2019-09-08 13:31:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:29,085 INFO L93 Difference]: Finished difference Result 5214 states and 8803 transitions. [2019-09-08 13:31:29,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:29,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-09-08 13:31:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:29,105 INFO L225 Difference]: With dead ends: 5214 [2019-09-08 13:31:29,105 INFO L226 Difference]: Without dead ends: 3628 [2019-09-08 13:31:29,110 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:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2019-09-08 13:31:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3626. [2019-09-08 13:31:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3626 states. [2019-09-08 13:31:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 6125 transitions. [2019-09-08 13:31:29,294 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 6125 transitions. Word has length 229 [2019-09-08 13:31:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:29,294 INFO L475 AbstractCegarLoop]: Abstraction has 3626 states and 6125 transitions. [2019-09-08 13:31:29,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 6125 transitions. [2019-09-08 13:31:29,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 13:31:29,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:29,302 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] [2019-09-08 13:31:29,302 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:29,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:29,303 INFO L82 PathProgramCache]: Analyzing trace with hash 7408774, now seen corresponding path program 1 times [2019-09-08 13:31:29,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:29,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:29,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:29,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:29,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:29,513 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:29,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:29,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:29,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:29,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:29,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:29,516 INFO L87 Difference]: Start difference. First operand 3626 states and 6125 transitions. Second operand 3 states. [2019-09-08 13:31:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:29,757 INFO L93 Difference]: Finished difference Result 9582 states and 16079 transitions. [2019-09-08 13:31:29,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:29,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-08 13:31:29,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:29,800 INFO L225 Difference]: With dead ends: 9582 [2019-09-08 13:31:29,800 INFO L226 Difference]: Without dead ends: 6508 [2019-09-08 13:31:29,814 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:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2019-09-08 13:31:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6506. [2019-09-08 13:31:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6506 states. [2019-09-08 13:31:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 10909 transitions. [2019-09-08 13:31:30,066 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 10909 transitions. Word has length 233 [2019-09-08 13:31:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:30,067 INFO L475 AbstractCegarLoop]: Abstraction has 6506 states and 10909 transitions. [2019-09-08 13:31:30,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 10909 transitions. [2019-09-08 13:31:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 13:31:30,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:30,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,076 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:30,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:30,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1561634677, now seen corresponding path program 1 times [2019-09-08 13:31:30,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:30,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:30,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:30,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:30,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:30,628 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:30,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:30,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:31:30,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:31:30,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:31:30,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:31:30,630 INFO L87 Difference]: Start difference. First operand 6506 states and 10909 transitions. Second operand 7 states. [2019-09-08 13:31:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:32,573 INFO L93 Difference]: Finished difference Result 39713 states and 66613 transitions. [2019-09-08 13:31:32,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 13:31:32,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 237 [2019-09-08 13:31:32,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:32,717 INFO L225 Difference]: With dead ends: 39713 [2019-09-08 13:31:32,718 INFO L226 Difference]: Without dead ends: 33759 [2019-09-08 13:31:32,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-09-08 13:31:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33759 states. [2019-09-08 13:31:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33759 to 12303. [2019-09-08 13:31:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-09-08 13:31:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 20548 transitions. [2019-09-08 13:31:34,305 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 20548 transitions. Word has length 237 [2019-09-08 13:31:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:34,307 INFO L475 AbstractCegarLoop]: Abstraction has 12303 states and 20548 transitions. [2019-09-08 13:31:34,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:31:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 20548 transitions. [2019-09-08 13:31:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 13:31:34,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:34,318 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] [2019-09-08 13:31:34,319 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:34,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:34,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1236760728, now seen corresponding path program 1 times [2019-09-08 13:31:34,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:34,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:34,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:34,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:34,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:34,548 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:34,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:34,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:31:34,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:31:34,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:31:34,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:31:34,551 INFO L87 Difference]: Start difference. First operand 12303 states and 20548 transitions. Second operand 4 states. [2019-09-08 13:31:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:35,529 INFO L93 Difference]: Finished difference Result 32984 states and 55182 transitions. [2019-09-08 13:31:35,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:31:35,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-08 13:31:35,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:35,597 INFO L225 Difference]: With dead ends: 32984 [2019-09-08 13:31:35,597 INFO L226 Difference]: Without dead ends: 21233 [2019-09-08 13:31:35,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:31:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21233 states. [2019-09-08 13:31:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21233 to 18279. [2019-09-08 13:31:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18279 states. [2019-09-08 13:31:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18279 states to 18279 states and 30544 transitions. [2019-09-08 13:31:36,771 INFO L78 Accepts]: Start accepts. Automaton has 18279 states and 30544 transitions. Word has length 238 [2019-09-08 13:31:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:36,772 INFO L475 AbstractCegarLoop]: Abstraction has 18279 states and 30544 transitions. [2019-09-08 13:31:36,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:31:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 18279 states and 30544 transitions. [2019-09-08 13:31:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:31:36,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:36,786 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] [2019-09-08 13:31:36,786 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:36,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:36,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1598097195, now seen corresponding path program 1 times [2019-09-08 13:31:36,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:36,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:36,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:36,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:36,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:36,961 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:36,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:36,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:36,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:36,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:36,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:36,963 INFO L87 Difference]: Start difference. First operand 18279 states and 30544 transitions. Second operand 3 states. [2019-09-08 13:31:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:38,281 INFO L93 Difference]: Finished difference Result 40226 states and 67370 transitions. [2019-09-08 13:31:38,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:38,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:31:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:38,359 INFO L225 Difference]: With dead ends: 40226 [2019-09-08 13:31:38,359 INFO L226 Difference]: Without dead ends: 28072 [2019-09-08 13:31:38,395 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:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28072 states. [2019-09-08 13:31:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28072 to 28070. [2019-09-08 13:31:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28070 states. [2019-09-08 13:31:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28070 states to 28070 states and 46877 transitions. [2019-09-08 13:31:39,489 INFO L78 Accepts]: Start accepts. Automaton has 28070 states and 46877 transitions. Word has length 239 [2019-09-08 13:31:39,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:39,489 INFO L475 AbstractCegarLoop]: Abstraction has 28070 states and 46877 transitions. [2019-09-08 13:31:39,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 28070 states and 46877 transitions. [2019-09-08 13:31:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:31:39,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:39,496 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] [2019-09-08 13:31:39,496 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:39,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1621339669, now seen corresponding path program 1 times [2019-09-08 13:31:39,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:39,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:39,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:39,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:39,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:39,664 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:39,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:39,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:39,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:39,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:39,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:39,666 INFO L87 Difference]: Start difference. First operand 28070 states and 46877 transitions. Second operand 3 states. [2019-09-08 13:31:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:40,894 INFO L93 Difference]: Finished difference Result 53990 states and 90204 transitions. [2019-09-08 13:31:40,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:40,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:31:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:40,971 INFO L225 Difference]: With dead ends: 53990 [2019-09-08 13:31:40,972 INFO L226 Difference]: Without dead ends: 39524 [2019-09-08 13:31:41,010 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,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39524 states. [2019-09-08 13:31:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39524 to 39522. [2019-09-08 13:31:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39522 states. [2019-09-08 13:31:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39522 states to 39522 states and 65881 transitions. [2019-09-08 13:31:43,420 INFO L78 Accepts]: Start accepts. Automaton has 39522 states and 65881 transitions. Word has length 239 [2019-09-08 13:31:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:43,420 INFO L475 AbstractCegarLoop]: Abstraction has 39522 states and 65881 transitions. [2019-09-08 13:31:43,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 39522 states and 65881 transitions. [2019-09-08 13:31:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:31:43,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:43,425 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] [2019-09-08 13:31:43,426 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:43,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:43,426 INFO L82 PathProgramCache]: Analyzing trace with hash -839265151, now seen corresponding path program 1 times [2019-09-08 13:31:43,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:43,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:43,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:43,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:43,607 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:43,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:43,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:43,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:43,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:43,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:43,609 INFO L87 Difference]: Start difference. First operand 39522 states and 65881 transitions. Second operand 3 states. [2019-09-08 13:31:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:45,328 INFO L93 Difference]: Finished difference Result 75826 states and 126488 transitions. [2019-09-08 13:31:45,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:45,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:31:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:45,423 INFO L225 Difference]: With dead ends: 75826 [2019-09-08 13:31:45,423 INFO L226 Difference]: Without dead ends: 55408 [2019-09-08 13:31:45,470 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:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55408 states. [2019-09-08 13:31:47,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55408 to 55406. [2019-09-08 13:31:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55406 states. [2019-09-08 13:31:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55406 states to 55406 states and 92185 transitions. [2019-09-08 13:31:47,469 INFO L78 Accepts]: Start accepts. Automaton has 55406 states and 92185 transitions. Word has length 239 [2019-09-08 13:31:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:47,470 INFO L475 AbstractCegarLoop]: Abstraction has 55406 states and 92185 transitions. [2019-09-08 13:31:47,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 55406 states and 92185 transitions. [2019-09-08 13:31:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:31:47,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:47,475 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] [2019-09-08 13:31:47,476 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1472495767, now seen corresponding path program 1 times [2019-09-08 13:31:47,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:47,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:47,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:47,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:47,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:48,947 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,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:48,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:48,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:48,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:48,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:48,949 INFO L87 Difference]: Start difference. First operand 55406 states and 92185 transitions. Second operand 3 states. [2019-09-08 13:31:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:51,195 INFO L93 Difference]: Finished difference Result 106006 states and 176532 transitions. [2019-09-08 13:31:51,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:51,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:31:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:51,296 INFO L225 Difference]: With dead ends: 106006 [2019-09-08 13:31:51,296 INFO L226 Difference]: Without dead ends: 77300 [2019-09-08 13:31:51,339 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,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77300 states. [2019-09-08 13:31:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77300 to 77298. [2019-09-08 13:31:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77298 states. [2019-09-08 13:31:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77298 states to 77298 states and 128349 transitions. [2019-09-08 13:31:53,892 INFO L78 Accepts]: Start accepts. Automaton has 77298 states and 128349 transitions. Word has length 239 [2019-09-08 13:31:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:53,892 INFO L475 AbstractCegarLoop]: Abstraction has 77298 states and 128349 transitions. [2019-09-08 13:31:53,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:31:53,892 INFO L276 IsEmpty]: Start isEmpty. Operand 77298 states and 128349 transitions. [2019-09-08 13:31:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:31:53,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:53,894 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] [2019-09-08 13:31:53,894 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:53,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:53,895 INFO L82 PathProgramCache]: Analyzing trace with hash 141121069, now seen corresponding path program 1 times [2019-09-08 13:31:53,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:53,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:53,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:54,114 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:54,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:54,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:54,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:54,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:54,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:54,116 INFO L87 Difference]: Start difference. First operand 77298 states and 128349 transitions. Second operand 3 states. [2019-09-08 13:31:58,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:31:58,669 INFO L93 Difference]: Finished difference Result 147422 states and 245036 transitions. [2019-09-08 13:31:58,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:31:58,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 13:31:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:31:58,826 INFO L225 Difference]: With dead ends: 147422 [2019-09-08 13:31:58,826 INFO L226 Difference]: Without dead ends: 107244 [2019-09-08 13:31:58,886 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:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107244 states. [2019-09-08 13:32:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107244 to 107242. [2019-09-08 13:32:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107242 states. [2019-09-08 13:32:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107242 states to 107242 states and 177668 transitions. [2019-09-08 13:32:02,585 INFO L78 Accepts]: Start accepts. Automaton has 107242 states and 177668 transitions. Word has length 239 [2019-09-08 13:32:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:02,586 INFO L475 AbstractCegarLoop]: Abstraction has 107242 states and 177668 transitions. [2019-09-08 13:32:02,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:32:02,586 INFO L276 IsEmpty]: Start isEmpty. Operand 107242 states and 177668 transitions. [2019-09-08 13:32:02,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 13:32:02,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:02,588 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] [2019-09-08 13:32:02,588 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:02,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:02,588 INFO L82 PathProgramCache]: Analyzing trace with hash 248955122, now seen corresponding path program 1 times [2019-09-08 13:32:02,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:02,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:02,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:02,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:02,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:02,778 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:02,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:02,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:32:02,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:32:02,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:32:02,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:32:02,780 INFO L87 Difference]: Start difference. First operand 107242 states and 177668 transitions. Second operand 4 states. [2019-09-08 13:32:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:11,436 INFO L93 Difference]: Finished difference Result 317228 states and 526154 transitions. [2019-09-08 13:32:11,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:32:11,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-08 13:32:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:11,768 INFO L225 Difference]: With dead ends: 317228 [2019-09-08 13:32:11,768 INFO L226 Difference]: Without dead ends: 210652 [2019-09-08 13:32:11,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:32:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210652 states. [2019-09-08 13:32:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210652 to 176201. [2019-09-08 13:32:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176201 states. [2019-09-08 13:32:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176201 states to 176201 states and 291287 transitions. [2019-09-08 13:32:21,494 INFO L78 Accepts]: Start accepts. Automaton has 176201 states and 291287 transitions. Word has length 239 [2019-09-08 13:32:21,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:21,495 INFO L475 AbstractCegarLoop]: Abstraction has 176201 states and 291287 transitions. [2019-09-08 13:32:21,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:32:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 176201 states and 291287 transitions. [2019-09-08 13:32:21,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 13:32:21,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:21,497 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] [2019-09-08 13:32:21,497 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:21,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:21,498 INFO L82 PathProgramCache]: Analyzing trace with hash -933935761, now seen corresponding path program 1 times [2019-09-08 13:32:21,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:21,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:21,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:21,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:21,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:21,774 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:21,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:21,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:32:21,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:32:21,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:32:21,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:32:21,776 INFO L87 Difference]: Start difference. First operand 176201 states and 291287 transitions. Second operand 4 states. [2019-09-08 13:32:37,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:37,773 INFO L93 Difference]: Finished difference Result 522932 states and 865508 transitions. [2019-09-08 13:32:37,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:32:37,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-08 13:32:37,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:38,333 INFO L225 Difference]: With dead ends: 522932 [2019-09-08 13:32:38,333 INFO L226 Difference]: Without dead ends: 347397 [2019-09-08 13:32:38,491 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:32:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347397 states. [2019-09-08 13:32:55,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347397 to 289052. [2019-09-08 13:32:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289052 states. [2019-09-08 13:32:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289052 states to 289052 states and 476834 transitions. [2019-09-08 13:32:55,949 INFO L78 Accepts]: Start accepts. Automaton has 289052 states and 476834 transitions. Word has length 240 [2019-09-08 13:32:55,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:32:55,949 INFO L475 AbstractCegarLoop]: Abstraction has 289052 states and 476834 transitions. [2019-09-08 13:32:55,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:32:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 289052 states and 476834 transitions. [2019-09-08 13:32:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 13:32:55,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:32:55,952 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] [2019-09-08 13:32:55,952 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:32:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:32:55,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1055710553, now seen corresponding path program 1 times [2019-09-08 13:32:55,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:32:55,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:32:55,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:55,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:32:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:32:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:32:56,158 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:56,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:32:56,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:32:56,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:32:56,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:32:56,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:32:56,160 INFO L87 Difference]: Start difference. First operand 289052 states and 476834 transitions. Second operand 4 states. [2019-09-08 13:33:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:33:29,525 INFO L93 Difference]: Finished difference Result 849884 states and 1403882 transitions. [2019-09-08 13:33:29,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:33:29,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-09-08 13:33:29,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:33:30,569 INFO L225 Difference]: With dead ends: 849884 [2019-09-08 13:33:30,569 INFO L226 Difference]: Without dead ends: 561498 [2019-09-08 13:33:30,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:33:31,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561498 states. [2019-09-08 13:33:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561498 to 472375. [2019-09-08 13:33:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472375 states. [2019-09-08 13:34:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472375 states to 472375 states and 777625 transitions. [2019-09-08 13:34:00,481 INFO L78 Accepts]: Start accepts. Automaton has 472375 states and 777625 transitions. Word has length 241 [2019-09-08 13:34:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:34:00,482 INFO L475 AbstractCegarLoop]: Abstraction has 472375 states and 777625 transitions. [2019-09-08 13:34:00,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:34:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 472375 states and 777625 transitions. [2019-09-08 13:34:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 13:34:00,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:34:00,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] [2019-09-08 13:34:00,485 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:34:00,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:34:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1685205130, now seen corresponding path program 1 times [2019-09-08 13:34:00,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:34:00,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:34:00,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:00,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:34:00,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:34:01,870 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:34:01,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:34:01,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:34:01,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:34:01,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:34:01,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:34:01,872 INFO L87 Difference]: Start difference. First operand 472375 states and 777625 transitions. Second operand 8 states. [2019-09-08 13:36:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:36:30,065 INFO L93 Difference]: Finished difference Result 2612960 states and 4310785 transitions. [2019-09-08 13:36:30,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 13:36:30,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-09-08 13:36:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:36:33,978 INFO L225 Difference]: With dead ends: 2612960 [2019-09-08 13:36:33,978 INFO L226 Difference]: Without dead ends: 2141251 [2019-09-08 13:36:34,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2019-09-08 13:36:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141251 states. [2019-09-08 13:38:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141251 to 1298082. [2019-09-08 13:38:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298082 states.