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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:23:58,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:23:58,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:23:58,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:23:58,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:23:58,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:23:58,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:23:58,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:23:58,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:23:58,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:23:58,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:23:58,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:23:58,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:23:58,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:23:58,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:23:58,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:23:58,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:23:58,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:23:58,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:23:58,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:23:58,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:23:58,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:23:58,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:23:58,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:23:58,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:23:58,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:23:58,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:23:58,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:23:58,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:23:58,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:23:58,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:23:58,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:23:58,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:23:58,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:23:58,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:23:58,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:23:58,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:23:58,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:23:58,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:23:58,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:23:58,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:23:58,809 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:23:58,824 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:23:58,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:23:58,824 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:23:58,825 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:23:58,825 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:23:58,825 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:23:58,826 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:23:58,826 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:23:58,826 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:23:58,826 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:23:58,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:23:58,827 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:23:58,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:23:58,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:23:58,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:23:58,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:23:58,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:23:58,828 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:23:58,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:23:58,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:23:58,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:23:58,829 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:23:58,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:23:58,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:23:58,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:23:58,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:23:58,830 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:23:58,830 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:23:58,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:23:58,831 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:23:58,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:23:58,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:23:58,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:23:58,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:23:58,876 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:23:58,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:23:58,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c62e203/1459000fa5b44e60abc85c1841220630/FLAGf715d3096 [2019-09-10 06:23:59,525 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:23:59,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:23:59,544 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c62e203/1459000fa5b44e60abc85c1841220630/FLAGf715d3096 [2019-09-10 06:23:59,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74c62e203/1459000fa5b44e60abc85c1841220630 [2019-09-10 06:23:59,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:23:59,834 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:23:59,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:23:59,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:23:59,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:23:59,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:23:59" (1/1) ... [2019-09-10 06:23:59,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3188c452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:59, skipping insertion in model container [2019-09-10 06:23:59,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:23:59" (1/1) ... [2019-09-10 06:23:59,850 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:23:59,918 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:24:00,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:24:00,385 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:24:00,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:24:00,566 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:24:00,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:00 WrapperNode [2019-09-10 06:24:00,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:24:00,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:24:00,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:24:00,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:24:00,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:00" (1/1) ... [2019-09-10 06:24:00,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:00" (1/1) ... [2019-09-10 06:24:00,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:00" (1/1) ... [2019-09-10 06:24:00,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:00" (1/1) ... [2019-09-10 06:24:00,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:00" (1/1) ... [2019-09-10 06:24:00,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:00" (1/1) ... [2019-09-10 06:24:00,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:00" (1/1) ... [2019-09-10 06:24:00,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:24:00,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:24:00,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:24:00,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:24:00,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:00" (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-10 06:24:00,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:24:00,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:24:00,727 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:24:00,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:24:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:24:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:24:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:24:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:24:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:24:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:24:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:24:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:24:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:24:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:24:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:24:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:24:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:24:00,729 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:24:00,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:24:00,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:24:02,060 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:24:02,060 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:24:02,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:24:02 BoogieIcfgContainer [2019-09-10 06:24:02,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:24:02,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:24:02,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:24:02,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:24:02,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:23:59" (1/3) ... [2019-09-10 06:24:02,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea35c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:24:02, skipping insertion in model container [2019-09-10 06:24:02,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:00" (2/3) ... [2019-09-10 06:24:02,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea35c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:24:02, skipping insertion in model container [2019-09-10 06:24:02,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:24:02" (3/3) ... [2019-09-10 06:24:02,073 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:24:02,084 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:24:02,094 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:24:02,112 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:24:02,149 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:24:02,149 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:24:02,150 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:24:02,150 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:24:02,150 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:24:02,150 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:24:02,150 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:24:02,151 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:24:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2019-09-10 06:24:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:24:02,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:02,247 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] [2019-09-10 06:24:02,249 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:02,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:02,256 INFO L82 PathProgramCache]: Analyzing trace with hash 175889663, now seen corresponding path program 1 times [2019-09-10 06:24:02,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:02,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:02,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:02,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:02,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:02,913 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-10 06:24:02,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:02,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:02,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:02,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:02,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:02,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:02,942 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2019-09-10 06:24:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:03,101 INFO L93 Difference]: Finished difference Result 458 states and 789 transitions. [2019-09-10 06:24:03,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:03,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 06:24:03,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:03,122 INFO L225 Difference]: With dead ends: 458 [2019-09-10 06:24:03,122 INFO L226 Difference]: Without dead ends: 450 [2019-09-10 06:24:03,124 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-10 06:24:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-10 06:24:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2019-09-10 06:24:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-09-10 06:24:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 738 transitions. [2019-09-10 06:24:03,203 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 738 transitions. Word has length 114 [2019-09-10 06:24:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:03,204 INFO L475 AbstractCegarLoop]: Abstraction has 447 states and 738 transitions. [2019-09-10 06:24:03,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 738 transitions. [2019-09-10 06:24:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:24:03,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:03,207 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] [2019-09-10 06:24:03,208 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:03,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1851484959, now seen corresponding path program 1 times [2019-09-10 06:24:03,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:03,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:03,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:03,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:03,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:03,473 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-10 06:24:03,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:03,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:03,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:03,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:03,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:03,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:03,478 INFO L87 Difference]: Start difference. First operand 447 states and 738 transitions. Second operand 3 states. [2019-09-10 06:24:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:03,529 INFO L93 Difference]: Finished difference Result 683 states and 1125 transitions. [2019-09-10 06:24:03,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:03,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 06:24:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:03,535 INFO L225 Difference]: With dead ends: 683 [2019-09-10 06:24:03,535 INFO L226 Difference]: Without dead ends: 683 [2019-09-10 06:24:03,536 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-10 06:24:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-10 06:24:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 679. [2019-09-10 06:24:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-10 06:24:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1122 transitions. [2019-09-10 06:24:03,568 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1122 transitions. Word has length 117 [2019-09-10 06:24:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:03,568 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 1122 transitions. [2019-09-10 06:24:03,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1122 transitions. [2019-09-10 06:24:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 06:24:03,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:03,571 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] [2019-09-10 06:24:03,571 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:03,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:03,572 INFO L82 PathProgramCache]: Analyzing trace with hash 278942115, now seen corresponding path program 1 times [2019-09-10 06:24:03,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:03,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:03,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:03,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:03,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:03,767 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-10 06:24:03,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:03,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:03,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:03,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:03,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:03,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:03,771 INFO L87 Difference]: Start difference. First operand 679 states and 1122 transitions. Second operand 3 states. [2019-09-10 06:24:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:03,821 INFO L93 Difference]: Finished difference Result 1129 states and 1855 transitions. [2019-09-10 06:24:03,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:03,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 06:24:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:03,831 INFO L225 Difference]: With dead ends: 1129 [2019-09-10 06:24:03,831 INFO L226 Difference]: Without dead ends: 1129 [2019-09-10 06:24:03,832 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-10 06:24:03,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-10 06:24:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1123. [2019-09-10 06:24:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-09-10 06:24:03,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1850 transitions. [2019-09-10 06:24:03,866 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1850 transitions. Word has length 120 [2019-09-10 06:24:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:03,867 INFO L475 AbstractCegarLoop]: Abstraction has 1123 states and 1850 transitions. [2019-09-10 06:24:03,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:03,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1850 transitions. [2019-09-10 06:24:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 06:24:03,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:03,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:03,870 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:03,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:03,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1985226691, now seen corresponding path program 1 times [2019-09-10 06:24:03,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:03,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:03,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:03,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:03,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:03,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:03,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:03,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:03,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:03,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:03,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:03,990 INFO L87 Difference]: Start difference. First operand 1123 states and 1850 transitions. Second operand 3 states. [2019-09-10 06:24:04,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:04,038 INFO L93 Difference]: Finished difference Result 1981 states and 3235 transitions. [2019-09-10 06:24:04,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:04,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-10 06:24:04,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:04,050 INFO L225 Difference]: With dead ends: 1981 [2019-09-10 06:24:04,051 INFO L226 Difference]: Without dead ends: 1981 [2019-09-10 06:24:04,051 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-10 06:24:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-09-10 06:24:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1971. [2019-09-10 06:24:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2019-09-10 06:24:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 3226 transitions. [2019-09-10 06:24:04,137 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 3226 transitions. Word has length 123 [2019-09-10 06:24:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:04,138 INFO L475 AbstractCegarLoop]: Abstraction has 1971 states and 3226 transitions. [2019-09-10 06:24:04,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 3226 transitions. [2019-09-10 06:24:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 06:24:04,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:04,142 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:04,142 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:04,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:04,142 INFO L82 PathProgramCache]: Analyzing trace with hash 664168007, now seen corresponding path program 1 times [2019-09-10 06:24:04,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:04,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:04,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:04,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:04,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:04,324 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-10 06:24:04,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:04,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:24:04,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:04,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:24:04,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:24:04,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:24:04,327 INFO L87 Difference]: Start difference. First operand 1971 states and 3226 transitions. Second operand 6 states. [2019-09-10 06:24:04,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:04,809 INFO L93 Difference]: Finished difference Result 8449 states and 13925 transitions. [2019-09-10 06:24:04,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:24:04,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-10 06:24:04,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:04,856 INFO L225 Difference]: With dead ends: 8449 [2019-09-10 06:24:04,856 INFO L226 Difference]: Without dead ends: 8449 [2019-09-10 06:24:04,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:24:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8449 states. [2019-09-10 06:24:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8449 to 3629. [2019-09-10 06:24:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2019-09-10 06:24:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 5941 transitions. [2019-09-10 06:24:05,011 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 5941 transitions. Word has length 126 [2019-09-10 06:24:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:05,012 INFO L475 AbstractCegarLoop]: Abstraction has 3629 states and 5941 transitions. [2019-09-10 06:24:05,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:24:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 5941 transitions. [2019-09-10 06:24:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 06:24:05,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:05,015 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] [2019-09-10 06:24:05,016 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash -951796549, now seen corresponding path program 1 times [2019-09-10 06:24:05,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:05,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:05,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:05,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:05,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:05,246 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-10 06:24:05,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:05,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:24:05,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:05,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:24:05,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:24:05,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:24:05,249 INFO L87 Difference]: Start difference. First operand 3629 states and 5941 transitions. Second operand 4 states. [2019-09-10 06:24:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:05,394 INFO L93 Difference]: Finished difference Result 7275 states and 11987 transitions. [2019-09-10 06:24:05,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:24:05,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-10 06:24:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:05,429 INFO L225 Difference]: With dead ends: 7275 [2019-09-10 06:24:05,430 INFO L226 Difference]: Without dead ends: 7275 [2019-09-10 06:24:05,431 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-10 06:24:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7275 states. [2019-09-10 06:24:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 5384. [2019-09-10 06:24:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2019-09-10 06:24:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 8835 transitions. [2019-09-10 06:24:05,581 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 8835 transitions. Word has length 127 [2019-09-10 06:24:05,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:05,581 INFO L475 AbstractCegarLoop]: Abstraction has 5384 states and 8835 transitions. [2019-09-10 06:24:05,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 8835 transitions. [2019-09-10 06:24:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 06:24:05,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:05,591 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:05,592 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:05,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:05,600 INFO L82 PathProgramCache]: Analyzing trace with hash 497467790, now seen corresponding path program 1 times [2019-09-10 06:24:05,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:05,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:05,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:05,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:05,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:05,739 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-10 06:24:05,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:05,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:24:05,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:05,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:24:05,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:24:05,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:24:05,742 INFO L87 Difference]: Start difference. First operand 5384 states and 8835 transitions. Second operand 4 states. [2019-09-10 06:24:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:05,944 INFO L93 Difference]: Finished difference Result 10590 states and 17419 transitions. [2019-09-10 06:24:05,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:24:05,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-10 06:24:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:05,993 INFO L225 Difference]: With dead ends: 10590 [2019-09-10 06:24:05,993 INFO L226 Difference]: Without dead ends: 10590 [2019-09-10 06:24:05,994 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-10 06:24:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10590 states. [2019-09-10 06:24:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10590 to 7963. [2019-09-10 06:24:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7963 states. [2019-09-10 06:24:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 13060 transitions. [2019-09-10 06:24:06,339 INFO L78 Accepts]: Start accepts. Automaton has 7963 states and 13060 transitions. Word has length 128 [2019-09-10 06:24:06,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:06,340 INFO L475 AbstractCegarLoop]: Abstraction has 7963 states and 13060 transitions. [2019-09-10 06:24:06,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 7963 states and 13060 transitions. [2019-09-10 06:24:06,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:24:06,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:06,346 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] [2019-09-10 06:24:06,346 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:06,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:06,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1437707567, now seen corresponding path program 1 times [2019-09-10 06:24:06,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:06,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:06,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:06,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:06,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:06,478 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-10 06:24:06,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:06,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:06,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:06,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:06,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:06,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:06,480 INFO L87 Difference]: Start difference. First operand 7963 states and 13060 transitions. Second operand 3 states. [2019-09-10 06:24:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:06,591 INFO L93 Difference]: Finished difference Result 12121 states and 19845 transitions. [2019-09-10 06:24:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:06,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:24:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:06,629 INFO L225 Difference]: With dead ends: 12121 [2019-09-10 06:24:06,629 INFO L226 Difference]: Without dead ends: 12121 [2019-09-10 06:24:06,630 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-10 06:24:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12121 states. [2019-09-10 06:24:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12121 to 12119. [2019-09-10 06:24:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12119 states. [2019-09-10 06:24:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12119 states to 12119 states and 19844 transitions. [2019-09-10 06:24:06,852 INFO L78 Accepts]: Start accepts. Automaton has 12119 states and 19844 transitions. Word has length 129 [2019-09-10 06:24:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:06,852 INFO L475 AbstractCegarLoop]: Abstraction has 12119 states and 19844 transitions. [2019-09-10 06:24:06,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 12119 states and 19844 transitions. [2019-09-10 06:24:06,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:24:06,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:06,855 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] [2019-09-10 06:24:06,856 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:06,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:06,856 INFO L82 PathProgramCache]: Analyzing trace with hash -686882823, now seen corresponding path program 1 times [2019-09-10 06:24:06,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:06,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:06,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:06,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:06,951 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-10 06:24:06,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:06,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:07,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:07,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:07,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:07,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:07,022 INFO L87 Difference]: Start difference. First operand 12119 states and 19844 transitions. Second operand 3 states. [2019-09-10 06:24:07,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:07,137 INFO L93 Difference]: Finished difference Result 17029 states and 27841 transitions. [2019-09-10 06:24:07,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:07,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:24:07,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:07,179 INFO L225 Difference]: With dead ends: 17029 [2019-09-10 06:24:07,179 INFO L226 Difference]: Without dead ends: 17029 [2019-09-10 06:24:07,180 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-10 06:24:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17029 states. [2019-09-10 06:24:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17029 to 17027. [2019-09-10 06:24:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17027 states. [2019-09-10 06:24:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17027 states to 17027 states and 27840 transitions. [2019-09-10 06:24:07,454 INFO L78 Accepts]: Start accepts. Automaton has 17027 states and 27840 transitions. Word has length 129 [2019-09-10 06:24:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:07,455 INFO L475 AbstractCegarLoop]: Abstraction has 17027 states and 27840 transitions. [2019-09-10 06:24:07,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 17027 states and 27840 transitions. [2019-09-10 06:24:07,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:24:07,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:07,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:07,458 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:07,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:07,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1815419934, now seen corresponding path program 1 times [2019-09-10 06:24:07,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:07,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:07,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:07,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:07,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:07,575 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-10 06:24:07,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:07,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:24:07,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:07,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:24:07,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:24:07,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:24:07,577 INFO L87 Difference]: Start difference. First operand 17027 states and 27840 transitions. Second operand 4 states. [2019-09-10 06:24:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:07,846 INFO L93 Difference]: Finished difference Result 37659 states and 61652 transitions. [2019-09-10 06:24:07,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:24:07,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 06:24:07,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:07,964 INFO L225 Difference]: With dead ends: 37659 [2019-09-10 06:24:07,964 INFO L226 Difference]: Without dead ends: 37659 [2019-09-10 06:24:07,965 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-10 06:24:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37659 states. [2019-09-10 06:24:08,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37659 to 27287. [2019-09-10 06:24:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27287 states. [2019-09-10 06:24:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27287 states to 27287 states and 44556 transitions. [2019-09-10 06:24:08,695 INFO L78 Accepts]: Start accepts. Automaton has 27287 states and 44556 transitions. Word has length 129 [2019-09-10 06:24:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:08,696 INFO L475 AbstractCegarLoop]: Abstraction has 27287 states and 44556 transitions. [2019-09-10 06:24:08,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 27287 states and 44556 transitions. [2019-09-10 06:24:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:24:08,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:08,700 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] [2019-09-10 06:24:08,700 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:08,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:08,701 INFO L82 PathProgramCache]: Analyzing trace with hash -332561375, now seen corresponding path program 1 times [2019-09-10 06:24:08,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:08,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:08,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:08,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:08,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:08,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:08,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:08,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:08,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:08,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:08,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:08,808 INFO L87 Difference]: Start difference. First operand 27287 states and 44556 transitions. Second operand 3 states. [2019-09-10 06:24:08,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:08,970 INFO L93 Difference]: Finished difference Result 38191 states and 62255 transitions. [2019-09-10 06:24:08,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:08,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:24:08,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:09,065 INFO L225 Difference]: With dead ends: 38191 [2019-09-10 06:24:09,065 INFO L226 Difference]: Without dead ends: 38191 [2019-09-10 06:24:09,066 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-10 06:24:09,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38191 states. [2019-09-10 06:24:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38191 to 38189. [2019-09-10 06:24:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38189 states. [2019-09-10 06:24:10,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38189 states to 38189 states and 62254 transitions. [2019-09-10 06:24:10,316 INFO L78 Accepts]: Start accepts. Automaton has 38189 states and 62254 transitions. Word has length 129 [2019-09-10 06:24:10,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:10,316 INFO L475 AbstractCegarLoop]: Abstraction has 38189 states and 62254 transitions. [2019-09-10 06:24:10,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 38189 states and 62254 transitions. [2019-09-10 06:24:10,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:24:10,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:10,319 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] [2019-09-10 06:24:10,319 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:10,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:10,320 INFO L82 PathProgramCache]: Analyzing trace with hash -390628183, now seen corresponding path program 1 times [2019-09-10 06:24:10,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:10,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:10,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:10,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:10,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:10,402 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-10 06:24:10,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:10,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:10,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:10,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:10,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:10,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:10,403 INFO L87 Difference]: Start difference. First operand 38189 states and 62254 transitions. Second operand 3 states. [2019-09-10 06:24:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:10,581 INFO L93 Difference]: Finished difference Result 56815 states and 92723 transitions. [2019-09-10 06:24:10,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:10,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-09-10 06:24:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:10,715 INFO L225 Difference]: With dead ends: 56815 [2019-09-10 06:24:10,715 INFO L226 Difference]: Without dead ends: 56815 [2019-09-10 06:24:10,716 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-10 06:24:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56815 states. [2019-09-10 06:24:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56815 to 56813. [2019-09-10 06:24:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56813 states. [2019-09-10 06:24:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56813 states to 56813 states and 92722 transitions. [2019-09-10 06:24:11,683 INFO L78 Accepts]: Start accepts. Automaton has 56813 states and 92722 transitions. Word has length 129 [2019-09-10 06:24:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:11,683 INFO L475 AbstractCegarLoop]: Abstraction has 56813 states and 92722 transitions. [2019-09-10 06:24:11,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 56813 states and 92722 transitions. [2019-09-10 06:24:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 06:24:11,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:11,685 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] [2019-09-10 06:24:11,685 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:11,686 INFO L82 PathProgramCache]: Analyzing trace with hash -495937323, now seen corresponding path program 1 times [2019-09-10 06:24:11,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:11,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:11,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:11,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:11,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:11,790 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-10 06:24:11,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:11,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:24:11,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:11,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:24:11,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:24:11,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:24:11,792 INFO L87 Difference]: Start difference. First operand 56813 states and 92722 transitions. Second operand 4 states. [2019-09-10 06:24:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:13,171 INFO L93 Difference]: Finished difference Result 125501 states and 204991 transitions. [2019-09-10 06:24:13,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:24:13,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-10 06:24:13,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:13,518 INFO L225 Difference]: With dead ends: 125501 [2019-09-10 06:24:13,518 INFO L226 Difference]: Without dead ends: 125501 [2019-09-10 06:24:13,519 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-10 06:24:13,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125501 states. [2019-09-10 06:24:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125501 to 90932. [2019-09-10 06:24:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90932 states. [2019-09-10 06:24:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90932 states to 90932 states and 148075 transitions. [2019-09-10 06:24:15,270 INFO L78 Accepts]: Start accepts. Automaton has 90932 states and 148075 transitions. Word has length 130 [2019-09-10 06:24:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:15,270 INFO L475 AbstractCegarLoop]: Abstraction has 90932 states and 148075 transitions. [2019-09-10 06:24:15,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 90932 states and 148075 transitions. [2019-09-10 06:24:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 06:24:15,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:15,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:15,272 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:15,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:15,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1344026747, now seen corresponding path program 1 times [2019-09-10 06:24:15,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:15,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:15,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:15,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:15,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:15,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:15,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:24:15,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:15,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:24:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:24:15,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:24:15,519 INFO L87 Difference]: Start difference. First operand 90932 states and 148075 transitions. Second operand 6 states. [2019-09-10 06:24:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:17,253 INFO L93 Difference]: Finished difference Result 90934 states and 147451 transitions. [2019-09-10 06:24:17,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:24:17,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 06:24:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:17,417 INFO L225 Difference]: With dead ends: 90934 [2019-09-10 06:24:17,417 INFO L226 Difference]: Without dead ends: 90934 [2019-09-10 06:24:17,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:24:17,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90934 states. [2019-09-10 06:24:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90934 to 90932. [2019-09-10 06:24:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90932 states. [2019-09-10 06:24:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90932 states to 90932 states and 147450 transitions. [2019-09-10 06:24:19,039 INFO L78 Accepts]: Start accepts. Automaton has 90932 states and 147450 transitions. Word has length 132 [2019-09-10 06:24:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:19,039 INFO L475 AbstractCegarLoop]: Abstraction has 90932 states and 147450 transitions. [2019-09-10 06:24:19,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:24:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 90932 states and 147450 transitions. [2019-09-10 06:24:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 06:24:19,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:19,042 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] [2019-09-10 06:24:19,042 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:19,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:19,043 INFO L82 PathProgramCache]: Analyzing trace with hash 29972819, now seen corresponding path program 1 times [2019-09-10 06:24:19,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:19,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:19,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:19,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:19,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:19,308 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-10 06:24:19,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:19,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:24:19,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:19,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:24:19,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:24:19,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:24:19,310 INFO L87 Difference]: Start difference. First operand 90932 states and 147450 transitions. Second operand 6 states. [2019-09-10 06:24:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:20,070 INFO L93 Difference]: Finished difference Result 205462 states and 332581 transitions. [2019-09-10 06:24:20,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:24:20,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-09-10 06:24:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:20,415 INFO L225 Difference]: With dead ends: 205462 [2019-09-10 06:24:20,415 INFO L226 Difference]: Without dead ends: 205462 [2019-09-10 06:24:20,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:24:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205462 states. [2019-09-10 06:24:24,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205462 to 205458. [2019-09-10 06:24:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205458 states. [2019-09-10 06:24:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205458 states to 205458 states and 332579 transitions. [2019-09-10 06:24:24,970 INFO L78 Accepts]: Start accepts. Automaton has 205458 states and 332579 transitions. Word has length 135 [2019-09-10 06:24:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:24,971 INFO L475 AbstractCegarLoop]: Abstraction has 205458 states and 332579 transitions. [2019-09-10 06:24:24,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:24:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 205458 states and 332579 transitions. [2019-09-10 06:24:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 06:24:24,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:24,972 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] [2019-09-10 06:24:24,973 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:24,973 INFO L82 PathProgramCache]: Analyzing trace with hash 927248290, now seen corresponding path program 1 times [2019-09-10 06:24:24,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:24,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:24,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:24,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:25,115 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-10 06:24:25,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:25,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:24:25,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:25,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:24:25,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:24:25,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:24:25,117 INFO L87 Difference]: Start difference. First operand 205458 states and 332579 transitions. Second operand 5 states. [2019-09-10 06:24:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:30,393 INFO L93 Difference]: Finished difference Result 394478 states and 634162 transitions. [2019-09-10 06:24:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:24:30,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-09-10 06:24:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:30,997 INFO L225 Difference]: With dead ends: 394478 [2019-09-10 06:24:30,997 INFO L226 Difference]: Without dead ends: 394478 [2019-09-10 06:24:30,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:24:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394478 states. [2019-09-10 06:24:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394478 to 210114. [2019-09-10 06:24:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210114 states. [2019-09-10 06:24:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210114 states to 210114 states and 337208 transitions. [2019-09-10 06:24:34,032 INFO L78 Accepts]: Start accepts. Automaton has 210114 states and 337208 transitions. Word has length 136 [2019-09-10 06:24:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:34,032 INFO L475 AbstractCegarLoop]: Abstraction has 210114 states and 337208 transitions. [2019-09-10 06:24:34,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:24:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 210114 states and 337208 transitions. [2019-09-10 06:24:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:24:34,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:34,040 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:24:34,041 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:34,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:34,041 INFO L82 PathProgramCache]: Analyzing trace with hash 179427060, now seen corresponding path program 1 times [2019-09-10 06:24:34,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:34,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:34,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:34,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:34,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:24:34,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:34,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:24:34,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:34,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:24:34,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:24:34,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:24:34,223 INFO L87 Difference]: Start difference. First operand 210114 states and 337208 transitions. Second operand 6 states. [2019-09-10 06:24:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:35,547 INFO L93 Difference]: Finished difference Result 373577 states and 599998 transitions. [2019-09-10 06:24:35,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:24:35,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:24:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:40,457 INFO L225 Difference]: With dead ends: 373577 [2019-09-10 06:24:40,457 INFO L226 Difference]: Without dead ends: 373577 [2019-09-10 06:24:40,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:24:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373577 states. [2019-09-10 06:24:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373577 to 291115. [2019-09-10 06:24:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291115 states. [2019-09-10 06:24:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291115 states to 291115 states and 466642 transitions. [2019-09-10 06:24:44,297 INFO L78 Accepts]: Start accepts. Automaton has 291115 states and 466642 transitions. Word has length 167 [2019-09-10 06:24:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:44,298 INFO L475 AbstractCegarLoop]: Abstraction has 291115 states and 466642 transitions. [2019-09-10 06:24:44,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:24:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 291115 states and 466642 transitions. [2019-09-10 06:24:44,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:24:44,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:44,306 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:24:44,306 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:44,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:44,307 INFO L82 PathProgramCache]: Analyzing trace with hash 930251804, now seen corresponding path program 1 times [2019-09-10 06:24:44,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:44,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:44,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:44,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:44,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:24:44,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:44,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:24:44,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:44,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:24:44,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:24:44,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:24:44,496 INFO L87 Difference]: Start difference. First operand 291115 states and 466642 transitions. Second operand 6 states. [2019-09-10 06:24:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:45,732 INFO L93 Difference]: Finished difference Result 413673 states and 664622 transitions. [2019-09-10 06:24:45,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:24:45,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:24:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:46,366 INFO L225 Difference]: With dead ends: 413673 [2019-09-10 06:24:46,366 INFO L226 Difference]: Without dead ends: 413673 [2019-09-10 06:24:46,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:24:46,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413673 states. [2019-09-10 06:24:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413673 to 368773. [2019-09-10 06:24:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368773 states. [2019-09-10 06:24:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368773 states to 368773 states and 591198 transitions. [2019-09-10 06:24:58,060 INFO L78 Accepts]: Start accepts. Automaton has 368773 states and 591198 transitions. Word has length 167 [2019-09-10 06:24:58,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:58,061 INFO L475 AbstractCegarLoop]: Abstraction has 368773 states and 591198 transitions. [2019-09-10 06:24:58,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:24:58,061 INFO L276 IsEmpty]: Start isEmpty. Operand 368773 states and 591198 transitions. [2019-09-10 06:24:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:24:58,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:58,068 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:24:58,068 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:58,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:58,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1284573252, now seen corresponding path program 1 times [2019-09-10 06:24:58,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:58,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:58,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 06:24:58,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:58,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:24:58,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:58,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:24:58,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:24:58,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:24:58,254 INFO L87 Difference]: Start difference. First operand 368773 states and 591198 transitions. Second operand 6 states. [2019-09-10 06:24:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:59,521 INFO L93 Difference]: Finished difference Result 438685 states and 704878 transitions. [2019-09-10 06:24:59,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:24:59,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:24:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:05,957 INFO L225 Difference]: With dead ends: 438685 [2019-09-10 06:25:05,957 INFO L226 Difference]: Without dead ends: 438685 [2019-09-10 06:25:05,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:25:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438685 states. [2019-09-10 06:25:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438685 to 414701. [2019-09-10 06:25:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414701 states. [2019-09-10 06:25:11,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414701 states to 414701 states and 665314 transitions. [2019-09-10 06:25:11,463 INFO L78 Accepts]: Start accepts. Automaton has 414701 states and 665314 transitions. Word has length 167 [2019-09-10 06:25:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:11,464 INFO L475 AbstractCegarLoop]: Abstraction has 414701 states and 665314 transitions. [2019-09-10 06:25:11,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:25:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 414701 states and 665314 transitions. [2019-09-10 06:25:11,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:25:11,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:11,471 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:25:11,471 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:11,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1226506444, now seen corresponding path program 1 times [2019-09-10 06:25:11,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:11,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:11,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:11,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:11,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:25:11,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:11,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:25:11,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:11,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:25:11,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:25:11,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:25:11,645 INFO L87 Difference]: Start difference. First operand 414701 states and 665314 transitions. Second operand 6 states. [2019-09-10 06:25:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:14,860 INFO L93 Difference]: Finished difference Result 564669 states and 909650 transitions. [2019-09-10 06:25:14,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:25:14,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:25:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:15,610 INFO L225 Difference]: With dead ends: 564669 [2019-09-10 06:25:15,610 INFO L226 Difference]: Without dead ends: 564669 [2019-09-10 06:25:15,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:25:15,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564669 states. [2019-09-10 06:25:27,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564669 to 508157. [2019-09-10 06:25:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508157 states. [2019-09-10 06:25:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508157 states to 508157 states and 816726 transitions. [2019-09-10 06:25:28,801 INFO L78 Accepts]: Start accepts. Automaton has 508157 states and 816726 transitions. Word has length 167 [2019-09-10 06:25:28,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:28,801 INFO L475 AbstractCegarLoop]: Abstraction has 508157 states and 816726 transitions. [2019-09-10 06:25:28,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:25:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 508157 states and 816726 transitions. [2019-09-10 06:25:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 06:25:28,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:28,807 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:25:28,808 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:28,808 INFO L82 PathProgramCache]: Analyzing trace with hash 498916304, now seen corresponding path program 1 times [2019-09-10 06:25:28,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:28,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:28,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:28,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:28,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:25:28,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:28,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:28,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:28,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:28,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:28,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:28,912 INFO L87 Difference]: Start difference. First operand 508157 states and 816726 transitions. Second operand 3 states. [2019-09-10 06:25:37,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:37,644 INFO L93 Difference]: Finished difference Result 870701 states and 1400142 transitions. [2019-09-10 06:25:37,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:37,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 06:25:37,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:39,918 INFO L225 Difference]: With dead ends: 870701 [2019-09-10 06:25:39,918 INFO L226 Difference]: Without dead ends: 870701 [2019-09-10 06:25:39,919 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-10 06:25:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870701 states. [2019-09-10 06:25:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870701 to 869234. [2019-09-10 06:25:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869234 states. [2019-09-10 06:26:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869234 states to 869234 states and 1398676 transitions. [2019-09-10 06:26:10,978 INFO L78 Accepts]: Start accepts. Automaton has 869234 states and 1398676 transitions. Word has length 168 [2019-09-10 06:26:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:10,979 INFO L475 AbstractCegarLoop]: Abstraction has 869234 states and 1398676 transitions. [2019-09-10 06:26:10,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 869234 states and 1398676 transitions. [2019-09-10 06:26:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 06:26:10,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:10,987 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:26:10,988 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:10,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash -699174186, now seen corresponding path program 1 times [2019-09-10 06:26:10,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:10,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:10,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:10,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:10,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:26:11,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:26:11,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:26:11,227 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2019-09-10 06:26:11,230 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [216], [219], [222], [225], [228], [231], [234], [237], [240], [243], [246], [249], [253], [258], [282], [285], [287], [403], [406], [409], [412], [415], [418], [425], [433], [435], [438], [439], [441], [450], [453], [464], [467], [477], [499], [502], [539], [547], [555], [563], [585], [588], [625], [633], [641], [649], [671], [674], [711], [719], [727], [735], [745], [749], [753], [755], [757], [760], [797], [805], [813], [821], [1445], [1446], [1450], [1451], [1452] [2019-09-10 06:26:11,292 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:26:11,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:26:11,516 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:26:11,852 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:26:11,855 INFO L272 AbstractInterpreter]: Visited 146 different actions 259 times. Merged at 47 different actions 108 times. Never widened. Performed 1024 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1024 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 278 variables. [2019-09-10 06:26:11,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:11,859 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:26:12,488 INFO L227 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 89.09% of their original sizes. [2019-09-10 06:26:12,488 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:26:45,461 INFO L420 sIntCurrentIteration]: We unified 167 AI predicates to 167 [2019-09-10 06:26:45,462 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:26:45,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:26:45,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [100] imperfect sequences [10] total 108 [2019-09-10 06:26:45,462 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:45,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-09-10 06:26:45,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-09-10 06:26:45,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1611, Invalid=8289, Unknown=0, NotChecked=0, Total=9900 [2019-09-10 06:26:45,467 INFO L87 Difference]: Start difference. First operand 869234 states and 1398676 transitions. Second operand 100 states.