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.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:27:22,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:27:22,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:27:22,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:27:22,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:27:22,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:27:22,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:27:22,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:27:22,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:27:22,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:27:22,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:27:22,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:27:22,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:27:22,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:27:22,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:27:22,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:27:22,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:27:22,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:27:22,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:27:22,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:27:22,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:27:22,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:27:22,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:27:22,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:27:22,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:27:22,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:27:22,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:27:22,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:27:22,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:27:22,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:27:22,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:27:22,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:27:22,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:27:22,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:27:22,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:27:22,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:27:22,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:27:22,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:27:22,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:27:22,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:27:22,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:27:22,911 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:27:22,925 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:27:22,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:27:22,926 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:27:22,926 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:27:22,927 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:27:22,927 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:27:22,927 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:27:22,927 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:27:22,927 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:27:22,928 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:27:22,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:27:22,928 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:27:22,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:27:22,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:27:22,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:27:22,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:27:22,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:27:22,930 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:27:22,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:27:22,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:27:22,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:27:22,930 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:27:22,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:27:22,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:27:22,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:27:22,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:27:22,934 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:27:22,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:27:22,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:27:22,934 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:27:22,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:27:23,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:27:23,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:27:23,006 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:27:23,007 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:27:23,008 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.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-10 06:27:23,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45cdc7f4/a16554adaa1f43c692d68bb39fd0f0a1/FLAG765b4b2a1 [2019-09-10 06:27:23,783 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:27:23,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-10 06:27:23,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45cdc7f4/a16554adaa1f43c692d68bb39fd0f0a1/FLAG765b4b2a1 [2019-09-10 06:27:23,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45cdc7f4/a16554adaa1f43c692d68bb39fd0f0a1 [2019-09-10 06:27:23,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:27:23,926 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:27:23,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:27:23,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:27:23,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:27:23,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:27:23" (1/1) ... [2019-09-10 06:27:23,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209d9765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:23, skipping insertion in model container [2019-09-10 06:27:23,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:27:23" (1/1) ... [2019-09-10 06:27:23,944 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:27:24,087 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:27:25,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:27:25,263 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:27:25,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:27:25,805 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:27:25,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:25 WrapperNode [2019-09-10 06:27:25,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:27:25,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:27:25,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:27:25,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:27:25,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:25" (1/1) ... [2019-09-10 06:27:25,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:25" (1/1) ... [2019-09-10 06:27:25,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:25" (1/1) ... [2019-09-10 06:27:25,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:25" (1/1) ... [2019-09-10 06:27:25,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:25" (1/1) ... [2019-09-10 06:27:25,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:25" (1/1) ... [2019-09-10 06:27:25,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:25" (1/1) ... [2019-09-10 06:27:26,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:27:26,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:27:26,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:27:26,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:27:26,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:25" (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:27:26,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:27:26,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:27:26,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:27:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:27:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:27:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:27:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:27:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:27:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:27:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:27:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:27:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:27:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:27:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:27:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:27:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:27:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:27:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:27:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:27:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:27:29,127 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:27:29,127 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:27:29,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:27:29 BoogieIcfgContainer [2019-09-10 06:27:29,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:27:29,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:27:29,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:27:29,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:27:29,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:27:23" (1/3) ... [2019-09-10 06:27:29,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76559bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:27:29, skipping insertion in model container [2019-09-10 06:27:29,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:27:25" (2/3) ... [2019-09-10 06:27:29,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76559bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:27:29, skipping insertion in model container [2019-09-10 06:27:29,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:27:29" (3/3) ... [2019-09-10 06:27:29,137 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-10 06:27:29,146 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:27:29,156 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 06:27:29,173 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 06:27:29,202 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:27:29,202 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:27:29,202 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:27:29,202 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:27:29,202 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:27:29,202 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:27:29,203 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:27:29,203 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:27:29,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states. [2019-09-10 06:27:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 06:27:29,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:29,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:29,297 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:29,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:29,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1331426633, now seen corresponding path program 1 times [2019-09-10 06:27:29,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:29,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:29,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:29,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:29,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:29,963 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:27:29,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:29,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:27:29,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:29,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:27:29,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:27:29,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:27:29,993 INFO L87 Difference]: Start difference. First operand 1126 states. Second operand 4 states. [2019-09-10 06:27:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:30,296 INFO L93 Difference]: Finished difference Result 1130 states and 1948 transitions. [2019-09-10 06:27:30,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:27:30,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-10 06:27:30,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:30,332 INFO L225 Difference]: With dead ends: 1130 [2019-09-10 06:27:30,332 INFO L226 Difference]: Without dead ends: 1122 [2019-09-10 06:27:30,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:27:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2019-09-10 06:27:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2019-09-10 06:27:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2019-09-10 06:27:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1893 transitions. [2019-09-10 06:27:30,515 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1893 transitions. Word has length 154 [2019-09-10 06:27:30,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:30,516 INFO L475 AbstractCegarLoop]: Abstraction has 1122 states and 1893 transitions. [2019-09-10 06:27:30,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:27:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1893 transitions. [2019-09-10 06:27:30,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-10 06:27:30,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:30,523 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:30,523 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:30,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1101533262, now seen corresponding path program 1 times [2019-09-10 06:27:30,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:30,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:30,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:30,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:30,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:30,826 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:27:30,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:30,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:30,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:30,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:30,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:30,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:30,832 INFO L87 Difference]: Start difference. First operand 1122 states and 1893 transitions. Second operand 3 states. [2019-09-10 06:27:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:31,155 INFO L93 Difference]: Finished difference Result 1953 states and 3251 transitions. [2019-09-10 06:27:31,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:31,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-09-10 06:27:31,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:31,167 INFO L225 Difference]: With dead ends: 1953 [2019-09-10 06:27:31,168 INFO L226 Difference]: Without dead ends: 1953 [2019-09-10 06:27:31,169 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:27:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2019-09-10 06:27:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1943. [2019-09-10 06:27:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1943 states. [2019-09-10 06:27:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 3243 transitions. [2019-09-10 06:27:31,223 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 3243 transitions. Word has length 195 [2019-09-10 06:27:31,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:31,225 INFO L475 AbstractCegarLoop]: Abstraction has 1943 states and 3243 transitions. [2019-09-10 06:27:31,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 3243 transitions. [2019-09-10 06:27:31,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 06:27:31,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:31,239 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:31,240 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:31,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:31,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1272315647, now seen corresponding path program 1 times [2019-09-10 06:27:31,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:31,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:31,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:31,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:31,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:31,439 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:27:31,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:31,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:31,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:31,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:31,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:31,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:31,445 INFO L87 Difference]: Start difference. First operand 1943 states and 3243 transitions. Second operand 3 states. [2019-09-10 06:27:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:31,607 INFO L93 Difference]: Finished difference Result 2332 states and 3901 transitions. [2019-09-10 06:27:31,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:31,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-09-10 06:27:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:31,628 INFO L225 Difference]: With dead ends: 2332 [2019-09-10 06:27:31,628 INFO L226 Difference]: Without dead ends: 2332 [2019-09-10 06:27:31,628 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:27:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2019-09-10 06:27:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 2328. [2019-09-10 06:27:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2328 states. [2019-09-10 06:27:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 3899 transitions. [2019-09-10 06:27:31,687 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 3899 transitions. Word has length 200 [2019-09-10 06:27:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:31,687 INFO L475 AbstractCegarLoop]: Abstraction has 2328 states and 3899 transitions. [2019-09-10 06:27:31,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 3899 transitions. [2019-09-10 06:27:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 06:27:31,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:31,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:31,695 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:31,695 INFO L82 PathProgramCache]: Analyzing trace with hash 228391092, now seen corresponding path program 1 times [2019-09-10 06:27:31,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:31,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:31,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:31,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:31,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:31,850 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:27:31,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:31,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:31,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:31,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:31,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:31,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:31,852 INFO L87 Difference]: Start difference. First operand 2328 states and 3899 transitions. Second operand 3 states. [2019-09-10 06:27:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:32,027 INFO L93 Difference]: Finished difference Result 4262 states and 7083 transitions. [2019-09-10 06:27:32,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:32,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-10 06:27:32,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:32,051 INFO L225 Difference]: With dead ends: 4262 [2019-09-10 06:27:32,052 INFO L226 Difference]: Without dead ends: 4262 [2019-09-10 06:27:32,052 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:27:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2019-09-10 06:27:32,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 4241. [2019-09-10 06:27:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4241 states. [2019-09-10 06:27:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4241 states to 4241 states and 7064 transitions. [2019-09-10 06:27:32,152 INFO L78 Accepts]: Start accepts. Automaton has 4241 states and 7064 transitions. Word has length 203 [2019-09-10 06:27:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:32,154 INFO L475 AbstractCegarLoop]: Abstraction has 4241 states and 7064 transitions. [2019-09-10 06:27:32,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 4241 states and 7064 transitions. [2019-09-10 06:27:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 06:27:32,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:32,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:32,165 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:32,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:32,166 INFO L82 PathProgramCache]: Analyzing trace with hash 211508577, now seen corresponding path program 1 times [2019-09-10 06:27:32,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:32,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:32,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:32,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:32,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:32,338 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:27:32,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:32,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:32,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:32,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:32,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:32,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:32,342 INFO L87 Difference]: Start difference. First operand 4241 states and 7064 transitions. Second operand 3 states. [2019-09-10 06:27:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:32,483 INFO L93 Difference]: Finished difference Result 5400 states and 9008 transitions. [2019-09-10 06:27:32,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:32,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-10 06:27:32,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:32,512 INFO L225 Difference]: With dead ends: 5400 [2019-09-10 06:27:32,512 INFO L226 Difference]: Without dead ends: 5400 [2019-09-10 06:27:32,513 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:27:32,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5400 states. [2019-09-10 06:27:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5400 to 5396. [2019-09-10 06:27:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5396 states. [2019-09-10 06:27:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5396 states to 5396 states and 9006 transitions. [2019-09-10 06:27:32,711 INFO L78 Accepts]: Start accepts. Automaton has 5396 states and 9006 transitions. Word has length 208 [2019-09-10 06:27:32,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:32,711 INFO L475 AbstractCegarLoop]: Abstraction has 5396 states and 9006 transitions. [2019-09-10 06:27:32,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 5396 states and 9006 transitions. [2019-09-10 06:27:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-10 06:27:32,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:32,722 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:32,722 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:32,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:32,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1754448046, now seen corresponding path program 1 times [2019-09-10 06:27:32,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:32,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:32,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:32,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:32,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:32,883 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:27:32,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:32,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:32,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:32,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:32,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:32,885 INFO L87 Difference]: Start difference. First operand 5396 states and 9006 transitions. Second operand 3 states. [2019-09-10 06:27:33,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:33,054 INFO L93 Difference]: Finished difference Result 10092 states and 16662 transitions. [2019-09-10 06:27:33,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:33,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-09-10 06:27:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:33,118 INFO L225 Difference]: With dead ends: 10092 [2019-09-10 06:27:33,118 INFO L226 Difference]: Without dead ends: 10092 [2019-09-10 06:27:33,119 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:27:33,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10092 states. [2019-09-10 06:27:33,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10092 to 10039. [2019-09-10 06:27:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10039 states. [2019-09-10 06:27:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10039 states to 10039 states and 16611 transitions. [2019-09-10 06:27:33,316 INFO L78 Accepts]: Start accepts. Automaton has 10039 states and 16611 transitions. Word has length 211 [2019-09-10 06:27:33,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:33,318 INFO L475 AbstractCegarLoop]: Abstraction has 10039 states and 16611 transitions. [2019-09-10 06:27:33,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:33,323 INFO L276 IsEmpty]: Start isEmpty. Operand 10039 states and 16611 transitions. [2019-09-10 06:27:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-10 06:27:33,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:33,348 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:33,349 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:33,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:33,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1719339937, now seen corresponding path program 1 times [2019-09-10 06:27:33,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:33,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:33,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:33,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:33,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:33,556 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:27:33,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:33,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:33,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:33,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:33,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:33,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:33,559 INFO L87 Difference]: Start difference. First operand 10039 states and 16611 transitions. Second operand 3 states. [2019-09-10 06:27:33,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:33,676 INFO L93 Difference]: Finished difference Result 13024 states and 21571 transitions. [2019-09-10 06:27:33,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:33,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-10 06:27:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:33,707 INFO L225 Difference]: With dead ends: 13024 [2019-09-10 06:27:33,707 INFO L226 Difference]: Without dead ends: 13024 [2019-09-10 06:27:33,708 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:27:33,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13024 states. [2019-09-10 06:27:33,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13024 to 13020. [2019-09-10 06:27:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-09-10 06:27:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 21569 transitions. [2019-09-10 06:27:33,899 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 21569 transitions. Word has length 216 [2019-09-10 06:27:33,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:33,900 INFO L475 AbstractCegarLoop]: Abstraction has 13020 states and 21569 transitions. [2019-09-10 06:27:33,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 21569 transitions. [2019-09-10 06:27:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-10 06:27:33,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:33,920 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:33,920 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:33,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:33,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1836932892, now seen corresponding path program 1 times [2019-09-10 06:27:33,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:33,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:33,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:33,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:33,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:34,050 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:27:34,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:34,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:34,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:34,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:34,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:34,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:34,052 INFO L87 Difference]: Start difference. First operand 13020 states and 21569 transitions. Second operand 3 states. [2019-09-10 06:27:34,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:34,278 INFO L93 Difference]: Finished difference Result 24476 states and 39975 transitions. [2019-09-10 06:27:34,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:34,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-10 06:27:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:34,340 INFO L225 Difference]: With dead ends: 24476 [2019-09-10 06:27:34,340 INFO L226 Difference]: Without dead ends: 24476 [2019-09-10 06:27:34,341 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:27:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24476 states. [2019-09-10 06:27:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24476 to 24329. [2019-09-10 06:27:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24329 states. [2019-09-10 06:27:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24329 states to 24329 states and 39830 transitions. [2019-09-10 06:27:34,828 INFO L78 Accepts]: Start accepts. Automaton has 24329 states and 39830 transitions. Word has length 219 [2019-09-10 06:27:34,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:34,829 INFO L475 AbstractCegarLoop]: Abstraction has 24329 states and 39830 transitions. [2019-09-10 06:27:34,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 24329 states and 39830 transitions. [2019-09-10 06:27:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 06:27:34,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:34,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:34,866 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:34,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:34,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1650860369, now seen corresponding path program 1 times [2019-09-10 06:27:34,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:34,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:34,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:34,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:34,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:34,986 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:27:34,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:34,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:34,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:34,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:34,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:34,988 INFO L87 Difference]: Start difference. First operand 24329 states and 39830 transitions. Second operand 3 states. [2019-09-10 06:27:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:35,132 INFO L93 Difference]: Finished difference Result 31396 states and 51382 transitions. [2019-09-10 06:27:35,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:35,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-09-10 06:27:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:35,189 INFO L225 Difference]: With dead ends: 31396 [2019-09-10 06:27:35,189 INFO L226 Difference]: Without dead ends: 31396 [2019-09-10 06:27:35,190 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:27:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31396 states. [2019-09-10 06:27:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31396 to 31392. [2019-09-10 06:27:36,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31392 states. [2019-09-10 06:27:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31392 states to 31392 states and 51380 transitions. [2019-09-10 06:27:36,448 INFO L78 Accepts]: Start accepts. Automaton has 31392 states and 51380 transitions. Word has length 224 [2019-09-10 06:27:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:36,448 INFO L475 AbstractCegarLoop]: Abstraction has 31392 states and 51380 transitions. [2019-09-10 06:27:36,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:27:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 31392 states and 51380 transitions. [2019-09-10 06:27:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 06:27:36,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:36,506 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:36,506 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:36,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:36,507 INFO L82 PathProgramCache]: Analyzing trace with hash -558931230, now seen corresponding path program 1 times [2019-09-10 06:27:36,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:36,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:36,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:36,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:36,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:36,706 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:27:36,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:36,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:27:36,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:36,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:27:36,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:27:36,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:27:36,708 INFO L87 Difference]: Start difference. First operand 31392 states and 51380 transitions. Second operand 6 states. [2019-09-10 06:27:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:38,697 INFO L93 Difference]: Finished difference Result 167115 states and 274001 transitions. [2019-09-10 06:27:38,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:27:38,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 227 [2019-09-10 06:27:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:38,891 INFO L225 Difference]: With dead ends: 167115 [2019-09-10 06:27:38,892 INFO L226 Difference]: Without dead ends: 167115 [2019-09-10 06:27:38,892 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:27:39,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167115 states. [2019-09-10 06:27:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167115 to 61340. [2019-09-10 06:27:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61340 states. [2019-09-10 06:27:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61340 states to 61340 states and 99970 transitions. [2019-09-10 06:27:41,496 INFO L78 Accepts]: Start accepts. Automaton has 61340 states and 99970 transitions. Word has length 227 [2019-09-10 06:27:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:41,496 INFO L475 AbstractCegarLoop]: Abstraction has 61340 states and 99970 transitions. [2019-09-10 06:27:41,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:27:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 61340 states and 99970 transitions. [2019-09-10 06:27:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 06:27:41,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:41,610 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:41,611 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:41,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:41,611 INFO L82 PathProgramCache]: Analyzing trace with hash 2028868059, now seen corresponding path program 1 times [2019-09-10 06:27:41,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:41,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:41,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:41,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:41,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:42,034 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:27:42,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:42,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:27:42,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:42,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:27:42,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:27:42,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:27:42,036 INFO L87 Difference]: Start difference. First operand 61340 states and 99970 transitions. Second operand 4 states. [2019-09-10 06:27:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:43,013 INFO L93 Difference]: Finished difference Result 140162 states and 229587 transitions. [2019-09-10 06:27:43,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:43,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-10 06:27:43,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:43,156 INFO L225 Difference]: With dead ends: 140162 [2019-09-10 06:27:43,157 INFO L226 Difference]: Without dead ends: 140162 [2019-09-10 06:27:43,157 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:27:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140162 states. [2019-09-10 06:27:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140162 to 100932. [2019-09-10 06:27:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100932 states. [2019-09-10 06:27:45,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100932 states to 100932 states and 164593 transitions. [2019-09-10 06:27:45,797 INFO L78 Accepts]: Start accepts. Automaton has 100932 states and 164593 transitions. Word has length 229 [2019-09-10 06:27:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:45,798 INFO L475 AbstractCegarLoop]: Abstraction has 100932 states and 164593 transitions. [2019-09-10 06:27:45,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:27:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 100932 states and 164593 transitions. [2019-09-10 06:27:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 06:27:45,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:45,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:45,875 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:45,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:45,876 INFO L82 PathProgramCache]: Analyzing trace with hash 535274507, now seen corresponding path program 1 times [2019-09-10 06:27:45,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:45,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:45,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:45,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:45,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:46,032 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:27:46,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:46,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:27:46,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:46,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:27:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:27:46,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:27:46,035 INFO L87 Difference]: Start difference. First operand 100932 states and 164593 transitions. Second operand 4 states. [2019-09-10 06:27:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:46,826 INFO L93 Difference]: Finished difference Result 225913 states and 368326 transitions. [2019-09-10 06:27:46,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:46,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-09-10 06:27:46,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:49,546 INFO L225 Difference]: With dead ends: 225913 [2019-09-10 06:27:49,546 INFO L226 Difference]: Without dead ends: 225913 [2019-09-10 06:27:49,546 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:27:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225913 states. [2019-09-10 06:27:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225913 to 164028. [2019-09-10 06:27:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164028 states. [2019-09-10 06:27:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164028 states to 164028 states and 266622 transitions. [2019-09-10 06:27:51,220 INFO L78 Accepts]: Start accepts. Automaton has 164028 states and 266622 transitions. Word has length 230 [2019-09-10 06:27:51,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:51,220 INFO L475 AbstractCegarLoop]: Abstraction has 164028 states and 266622 transitions. [2019-09-10 06:27:51,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:27:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 164028 states and 266622 transitions. [2019-09-10 06:27:51,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 06:27:51,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:51,301 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:51,301 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:51,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:51,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1949352820, now seen corresponding path program 1 times [2019-09-10 06:27:51,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:51,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:51,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:51,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:51,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:51,456 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:27:51,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:51,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:27:51,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:51,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:27:51,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:27:51,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:27:51,458 INFO L87 Difference]: Start difference. First operand 164028 states and 266622 transitions. Second operand 4 states. [2019-09-10 06:27:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:55,604 INFO L93 Difference]: Finished difference Result 362857 states and 589718 transitions. [2019-09-10 06:27:55,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:55,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-10 06:27:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:56,044 INFO L225 Difference]: With dead ends: 362857 [2019-09-10 06:27:56,044 INFO L226 Difference]: Without dead ends: 362857 [2019-09-10 06:27:56,045 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:27:56,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362857 states. [2019-09-10 06:28:00,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362857 to 263994. [2019-09-10 06:28:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263994 states. [2019-09-10 06:28:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263994 states to 263994 states and 427712 transitions. [2019-09-10 06:28:04,695 INFO L78 Accepts]: Start accepts. Automaton has 263994 states and 427712 transitions. Word has length 231 [2019-09-10 06:28:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:04,696 INFO L475 AbstractCegarLoop]: Abstraction has 263994 states and 427712 transitions. [2019-09-10 06:28:04,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:28:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 263994 states and 427712 transitions. [2019-09-10 06:28:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-10 06:28:04,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:04,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:04,838 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:04,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:04,838 INFO L82 PathProgramCache]: Analyzing trace with hash -988021564, now seen corresponding path program 1 times [2019-09-10 06:28:04,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:04,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:04,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:04,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:04,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:04,973 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:28:04,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:04,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:28:04,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:04,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:28:04,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:28:04,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:28:04,975 INFO L87 Difference]: Start difference. First operand 263994 states and 427712 transitions. Second operand 4 states. [2019-09-10 06:28:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:06,474 INFO L93 Difference]: Finished difference Result 572150 states and 926827 transitions. [2019-09-10 06:28:06,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:28:06,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-09-10 06:28:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:08,801 INFO L225 Difference]: With dead ends: 572150 [2019-09-10 06:28:08,801 INFO L226 Difference]: Without dead ends: 572150 [2019-09-10 06:28:08,802 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:28:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572150 states. [2019-09-10 06:28:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572150 to 417860. [2019-09-10 06:28:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417860 states. [2019-09-10 06:28:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417860 states to 417860 states and 674748 transitions. [2019-09-10 06:28:20,736 INFO L78 Accepts]: Start accepts. Automaton has 417860 states and 674748 transitions. Word has length 232 [2019-09-10 06:28:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:20,736 INFO L475 AbstractCegarLoop]: Abstraction has 417860 states and 674748 transitions. [2019-09-10 06:28:20,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:28:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 417860 states and 674748 transitions. [2019-09-10 06:28:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-10 06:28:21,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:21,026 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:21,026 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:21,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:21,027 INFO L82 PathProgramCache]: Analyzing trace with hash 210512879, now seen corresponding path program 1 times [2019-09-10 06:28:21,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:21,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:21,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:21,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:21,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:21,318 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:28:21,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:21,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:28:21,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:21,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:28:21,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:28:21,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:28:21,320 INFO L87 Difference]: Start difference. First operand 417860 states and 674748 transitions. Second operand 6 states. [2019-09-10 06:28:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:28,967 INFO L93 Difference]: Finished difference Result 417864 states and 671543 transitions. [2019-09-10 06:28:28,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:28:28,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 234 [2019-09-10 06:28:28,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:29,541 INFO L225 Difference]: With dead ends: 417864 [2019-09-10 06:28:29,541 INFO L226 Difference]: Without dead ends: 417864 [2019-09-10 06:28:29,542 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:28:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417864 states. [2019-09-10 06:28:33,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417864 to 417860. [2019-09-10 06:28:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417860 states. [2019-09-10 06:28:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417860 states to 417860 states and 671541 transitions. [2019-09-10 06:28:35,700 INFO L78 Accepts]: Start accepts. Automaton has 417860 states and 671541 transitions. Word has length 234 [2019-09-10 06:28:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:28:35,700 INFO L475 AbstractCegarLoop]: Abstraction has 417860 states and 671541 transitions. [2019-09-10 06:28:35,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:28:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 417860 states and 671541 transitions. [2019-09-10 06:28:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 06:28:35,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:28:35,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:28:35,964 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:28:35,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:28:35,964 INFO L82 PathProgramCache]: Analyzing trace with hash 243373406, now seen corresponding path program 1 times [2019-09-10 06:28:35,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:28:35,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:35,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:28:35,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:28:35,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:28:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:28:36,249 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:28:36,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:28:36,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:28:36,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:28:36,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:28:36,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:28:36,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:28:36,253 INFO L87 Difference]: Start difference. First operand 417860 states and 671541 transitions. Second operand 6 states. [2019-09-10 06:28:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:40,348 INFO L93 Difference]: Finished difference Result 916740 states and 1479386 transitions. [2019-09-10 06:28:40,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:28:40,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-10 06:28:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:50,670 INFO L225 Difference]: With dead ends: 916740 [2019-09-10 06:28:50,670 INFO L226 Difference]: Without dead ends: 916740 [2019-09-10 06:28:50,671 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:28:51,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916740 states. [2019-09-10 06:29:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916740 to 656784. [2019-09-10 06:29:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656784 states. [2019-09-10 06:29:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656784 states to 656784 states and 1055898 transitions. [2019-09-10 06:29:02,407 INFO L78 Accepts]: Start accepts. Automaton has 656784 states and 1055898 transitions. Word has length 237 [2019-09-10 06:29:02,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:02,408 INFO L475 AbstractCegarLoop]: Abstraction has 656784 states and 1055898 transitions. [2019-09-10 06:29:02,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:29:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 656784 states and 1055898 transitions. [2019-09-10 06:29:02,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 06:29:02,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:02,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:02,849 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:02,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:02,849 INFO L82 PathProgramCache]: Analyzing trace with hash -111481562, now seen corresponding path program 1 times [2019-09-10 06:29:02,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:02,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:02,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:02,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:02,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:11,703 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:29:11,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:11,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:29:11,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:11,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:29:11,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:29:11,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:29:11,705 INFO L87 Difference]: Start difference. First operand 656784 states and 1055898 transitions. Second operand 6 states. [2019-09-10 06:29:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:29:16,161 INFO L93 Difference]: Finished difference Result 1051322 states and 1699157 transitions. [2019-09-10 06:29:16,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:29:16,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-10 06:29:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:29:17,624 INFO L225 Difference]: With dead ends: 1051322 [2019-09-10 06:29:17,625 INFO L226 Difference]: Without dead ends: 1051322 [2019-09-10 06:29:17,625 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:29:25,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051322 states. [2019-09-10 06:29:40,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051322 to 874530. [2019-09-10 06:29:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874530 states. [2019-09-10 06:29:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874530 states to 874530 states and 1408670 transitions. [2019-09-10 06:29:54,390 INFO L78 Accepts]: Start accepts. Automaton has 874530 states and 1408670 transitions. Word has length 237 [2019-09-10 06:29:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:29:54,390 INFO L475 AbstractCegarLoop]: Abstraction has 874530 states and 1408670 transitions. [2019-09-10 06:29:54,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:29:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 874530 states and 1408670 transitions. [2019-09-10 06:29:55,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 06:29:55,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:29:55,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:29:55,005 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:29:55,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:29:55,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1146880762, now seen corresponding path program 1 times [2019-09-10 06:29:55,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:29:55,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:55,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:29:55,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:29:55,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:29:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:29:57,689 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:29:57,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:29:57,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:29:57,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:29:57,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:29:57,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:29:57,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:29:57,691 INFO L87 Difference]: Start difference. First operand 874530 states and 1408670 transitions. Second operand 6 states. [2019-09-10 06:30:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:30:03,432 INFO L93 Difference]: Finished difference Result 1118464 states and 1807907 transitions. [2019-09-10 06:30:03,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:30:03,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-10 06:30:03,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:30:17,976 INFO L225 Difference]: With dead ends: 1118464 [2019-09-10 06:30:17,977 INFO L226 Difference]: Without dead ends: 1118464 [2019-09-10 06:30:17,977 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:30:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118464 states. [2019-09-10 06:30:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118464 to 1007804. [2019-09-10 06:30:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007804 states. [2019-09-10 06:30:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007804 states to 1007804 states and 1625151 transitions. [2019-09-10 06:30:51,212 INFO L78 Accepts]: Start accepts. Automaton has 1007804 states and 1625151 transitions. Word has length 237 [2019-09-10 06:30:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:30:51,213 INFO L475 AbstractCegarLoop]: Abstraction has 1007804 states and 1625151 transitions. [2019-09-10 06:30:51,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:30:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1007804 states and 1625151 transitions. [2019-09-10 06:30:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 06:30:51,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:30:51,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:30:51,837 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:30:51,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:30:51,838 INFO L82 PathProgramCache]: Analyzing trace with hash -502121874, now seen corresponding path program 1 times [2019-09-10 06:30:51,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:30:51,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:51,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:30:51,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:30:51,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:30:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:30:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:30:54,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:30:54,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:30:54,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:30:54,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:30:54,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:30:54,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:30:54,091 INFO L87 Difference]: Start difference. First operand 1007804 states and 1625151 transitions. Second operand 6 states. [2019-09-10 06:31:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:06,813 INFO L93 Difference]: Finished difference Result 1226526 states and 1983330 transitions. [2019-09-10 06:31:06,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:31:06,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-10 06:31:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:08,621 INFO L225 Difference]: With dead ends: 1226526 [2019-09-10 06:31:08,621 INFO L226 Difference]: Without dead ends: 1226526 [2019-09-10 06:31:08,622 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:31:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226526 states. [2019-09-10 06:31:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226526 to 1141106. [2019-09-10 06:31:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1141106 states. [2019-09-10 06:31:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141106 states to 1141106 states and 1841700 transitions. [2019-09-10 06:31:51,770 INFO L78 Accepts]: Start accepts. Automaton has 1141106 states and 1841700 transitions. Word has length 237 [2019-09-10 06:31:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:31:51,771 INFO L475 AbstractCegarLoop]: Abstraction has 1141106 states and 1841700 transitions. [2019-09-10 06:31:51,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:31:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1141106 states and 1841700 transitions. [2019-09-10 06:31:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 06:31:55,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:31:55,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:31:55,366 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:31:55,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:31:55,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1516282850, now seen corresponding path program 1 times [2019-09-10 06:31:55,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:31:55,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:55,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:31:55,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:31:55,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:31:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:31:55,581 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:31:55,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:31:55,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:31:55,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:31:55,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:31:55,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:31:55,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:31:55,583 INFO L87 Difference]: Start difference. First operand 1141106 states and 1841700 transitions. Second operand 3 states. [2019-09-10 06:31:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:31:59,002 INFO L93 Difference]: Finished difference Result 602049 states and 973033 transitions. [2019-09-10 06:31:59,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:31:59,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-09-10 06:31:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:31:59,927 INFO L225 Difference]: With dead ends: 602049 [2019-09-10 06:31:59,927 INFO L226 Difference]: Without dead ends: 602049 [2019-09-10 06:31:59,927 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:32:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602049 states. [2019-09-10 06:32:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602049 to 602047. [2019-09-10 06:32:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602047 states. [2019-09-10 06:32:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602047 states to 602047 states and 973032 transitions. [2019-09-10 06:32:24,111 INFO L78 Accepts]: Start accepts. Automaton has 602047 states and 973032 transitions. Word has length 238 [2019-09-10 06:32:24,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:32:24,112 INFO L475 AbstractCegarLoop]: Abstraction has 602047 states and 973032 transitions. [2019-09-10 06:32:24,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:32:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 602047 states and 973032 transitions. [2019-09-10 06:32:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 06:32:24,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:32:24,446 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:32:24,447 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:32:24,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:32:24,447 INFO L82 PathProgramCache]: Analyzing trace with hash -770156569, now seen corresponding path program 1 times [2019-09-10 06:32:24,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:32:24,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:24,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:32:24,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:32:24,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:32:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:32:24,594 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:32:24,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:32:24,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:32:24,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:32:24,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:32:24,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:32:24,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:32:24,596 INFO L87 Difference]: Start difference. First operand 602047 states and 973032 transitions. Second operand 3 states. [2019-09-10 06:32:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:32:34,881 INFO L93 Difference]: Finished difference Result 944504 states and 1516266 transitions. [2019-09-10 06:32:34,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:32:34,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-09-10 06:32:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:32:36,174 INFO L225 Difference]: With dead ends: 944504 [2019-09-10 06:32:36,174 INFO L226 Difference]: Without dead ends: 944504 [2019-09-10 06:32:36,175 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:32:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944504 states. [2019-09-10 06:33:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944504 to 941219. [2019-09-10 06:33:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941219 states. [2019-09-10 06:33:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941219 states to 941219 states and 1512983 transitions. [2019-09-10 06:33:07,961 INFO L78 Accepts]: Start accepts. Automaton has 941219 states and 1512983 transitions. Word has length 248 [2019-09-10 06:33:07,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:07,961 INFO L475 AbstractCegarLoop]: Abstraction has 941219 states and 1512983 transitions. [2019-09-10 06:33:07,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 941219 states and 1512983 transitions. [2019-09-10 06:33:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 06:33:08,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:08,507 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:08,507 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:08,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:08,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2109213978, now seen corresponding path program 1 times [2019-09-10 06:33:08,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:08,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:08,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:08,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:08,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:08,697 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:33:08,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:08,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:08,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:08,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:08,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:08,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:08,698 INFO L87 Difference]: Start difference. First operand 941219 states and 1512983 transitions. Second operand 3 states. [2019-09-10 06:33:10,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:10,815 INFO L93 Difference]: Finished difference Result 396293 states and 641697 transitions. [2019-09-10 06:33:10,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:10,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-09-10 06:33:10,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:11,208 INFO L225 Difference]: With dead ends: 396293 [2019-09-10 06:33:11,208 INFO L226 Difference]: Without dead ends: 396293 [2019-09-10 06:33:11,209 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:33:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396293 states. [2019-09-10 06:33:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396293 to 396291. [2019-09-10 06:33:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396291 states. [2019-09-10 06:33:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396291 states to 396291 states and 641696 transitions. [2019-09-10 06:33:24,294 INFO L78 Accepts]: Start accepts. Automaton has 396291 states and 641696 transitions. Word has length 248 [2019-09-10 06:33:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:24,294 INFO L475 AbstractCegarLoop]: Abstraction has 396291 states and 641696 transitions. [2019-09-10 06:33:24,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 396291 states and 641696 transitions. [2019-09-10 06:33:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 06:33:24,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:24,537 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:24,537 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:24,537 INFO L82 PathProgramCache]: Analyzing trace with hash -660205918, now seen corresponding path program 1 times [2019-09-10 06:33:24,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:24,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:24,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:24,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:24,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:25,826 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:33:25,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:25,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:25,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:25,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:25,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:25,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:25,828 INFO L87 Difference]: Start difference. First operand 396291 states and 641696 transitions. Second operand 3 states. [2019-09-10 06:33:27,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:27,503 INFO L93 Difference]: Finished difference Result 631662 states and 1009947 transitions. [2019-09-10 06:33:29,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:29,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-09-10 06:33:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:30,263 INFO L225 Difference]: With dead ends: 631662 [2019-09-10 06:33:30,263 INFO L226 Difference]: Without dead ends: 631662 [2019-09-10 06:33:30,263 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:33:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631662 states. [2019-09-10 06:33:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631662 to 629146. [2019-09-10 06:33:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629146 states. [2019-09-10 06:33:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629146 states to 629146 states and 1007433 transitions. [2019-09-10 06:33:48,056 INFO L78 Accepts]: Start accepts. Automaton has 629146 states and 1007433 transitions. Word has length 258 [2019-09-10 06:33:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:48,057 INFO L475 AbstractCegarLoop]: Abstraction has 629146 states and 1007433 transitions. [2019-09-10 06:33:48,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:48,057 INFO L276 IsEmpty]: Start isEmpty. Operand 629146 states and 1007433 transitions. [2019-09-10 06:33:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 06:33:48,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:48,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:48,391 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1414047899, now seen corresponding path program 1 times [2019-09-10 06:33:48,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:48,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:48,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:48,635 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:33:48,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:48,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:33:48,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:48,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:33:48,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:33:48,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:33:48,637 INFO L87 Difference]: Start difference. First operand 629146 states and 1007433 transitions. Second operand 4 states. [2019-09-10 06:34:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:01,309 INFO L93 Difference]: Finished difference Result 1139823 states and 1803611 transitions. [2019-09-10 06:34:01,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:34:01,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-09-10 06:34:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:03,101 INFO L225 Difference]: With dead ends: 1139823 [2019-09-10 06:34:03,102 INFO L226 Difference]: Without dead ends: 1139823 [2019-09-10 06:34:03,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:34:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139823 states. [2019-09-10 06:34:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139823 to 761980. [2019-09-10 06:34:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761980 states. [2019-09-10 06:34:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761980 states to 761980 states and 1213803 transitions. [2019-09-10 06:34:20,939 INFO L78 Accepts]: Start accepts. Automaton has 761980 states and 1213803 transitions. Word has length 258 [2019-09-10 06:34:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:20,940 INFO L475 AbstractCegarLoop]: Abstraction has 761980 states and 1213803 transitions. [2019-09-10 06:34:20,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:34:20,940 INFO L276 IsEmpty]: Start isEmpty. Operand 761980 states and 1213803 transitions. [2019-09-10 06:34:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 06:34:21,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:21,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:34:21,294 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:21,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:21,295 INFO L82 PathProgramCache]: Analyzing trace with hash 338562442, now seen corresponding path program 1 times [2019-09-10 06:34:21,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:21,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:21,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:21,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:21,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:21,474 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:34:21,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:21,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:34:21,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:21,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:34:21,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:34:21,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:34:21,476 INFO L87 Difference]: Start difference. First operand 761980 states and 1213803 transitions. Second operand 3 states. [2019-09-10 06:34:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:24,257 INFO L93 Difference]: Finished difference Result 316281 states and 504865 transitions. [2019-09-10 06:34:24,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:34:24,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-09-10 06:34:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:24,684 INFO L225 Difference]: With dead ends: 316281 [2019-09-10 06:34:24,684 INFO L226 Difference]: Without dead ends: 316281 [2019-09-10 06:34:24,685 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:34:24,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316281 states. [2019-09-10 06:34:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316281 to 316279. [2019-09-10 06:34:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316279 states. [2019-09-10 06:34:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316279 states to 316279 states and 504864 transitions. [2019-09-10 06:34:39,758 INFO L78 Accepts]: Start accepts. Automaton has 316279 states and 504864 transitions. Word has length 258 [2019-09-10 06:34:39,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:39,758 INFO L475 AbstractCegarLoop]: Abstraction has 316279 states and 504864 transitions. [2019-09-10 06:34:39,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:34:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 316279 states and 504864 transitions. [2019-09-10 06:34:39,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-10 06:34:39,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:39,882 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:34:39,882 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:39,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:39,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1876402970, now seen corresponding path program 1 times [2019-09-10 06:34:39,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:39,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:39,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:39,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:39,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:41,007 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:34:41,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:41,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:34:41,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:41,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:34:41,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:34:41,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:34:41,008 INFO L87 Difference]: Start difference. First operand 316279 states and 504864 transitions. Second operand 6 states. [2019-09-10 06:34:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:42,542 INFO L93 Difference]: Finished difference Result 535633 states and 854367 transitions. [2019-09-10 06:34:42,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:34:42,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 268 [2019-09-10 06:34:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:44,897 INFO L225 Difference]: With dead ends: 535633 [2019-09-10 06:34:44,897 INFO L226 Difference]: Without dead ends: 535633 [2019-09-10 06:34:44,898 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:34:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535633 states. [2019-09-10 06:34:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535633 to 535625. [2019-09-10 06:34:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535625 states. [2019-09-10 06:34:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535625 states to 535625 states and 854363 transitions. [2019-09-10 06:34:53,420 INFO L78 Accepts]: Start accepts. Automaton has 535625 states and 854363 transitions. Word has length 268 [2019-09-10 06:34:53,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:53,420 INFO L475 AbstractCegarLoop]: Abstraction has 535625 states and 854363 transitions. [2019-09-10 06:34:53,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:34:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 535625 states and 854363 transitions. [2019-09-10 06:34:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-10 06:34:53,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:53,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:34:53,677 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:53,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:53,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1402443418, now seen corresponding path program 1 times [2019-09-10 06:34:53,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:53,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:53,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:53,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:53,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:53,912 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:34:53,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:53,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:34:53,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:53,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:34:53,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:34:53,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:34:53,914 INFO L87 Difference]: Start difference. First operand 535625 states and 854363 transitions. Second operand 3 states. [2019-09-10 06:35:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:00,837 INFO L93 Difference]: Finished difference Result 222021 states and 354864 transitions. [2019-09-10 06:35:00,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:35:00,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-09-10 06:35:00,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:01,122 INFO L225 Difference]: With dead ends: 222021 [2019-09-10 06:35:01,123 INFO L226 Difference]: Without dead ends: 222021 [2019-09-10 06:35:01,123 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:35:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222021 states. [2019-09-10 06:35:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222021 to 222019. [2019-09-10 06:35:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222019 states. [2019-09-10 06:35:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222019 states to 222019 states and 354863 transitions. [2019-09-10 06:35:04,124 INFO L78 Accepts]: Start accepts. Automaton has 222019 states and 354863 transitions. Word has length 269 [2019-09-10 06:35:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:04,124 INFO L475 AbstractCegarLoop]: Abstraction has 222019 states and 354863 transitions. [2019-09-10 06:35:04,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:35:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 222019 states and 354863 transitions. [2019-09-10 06:35:04,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-10 06:35:04,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:04,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:04,223 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:04,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:04,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2067448297, now seen corresponding path program 1 times [2019-09-10 06:35:04,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:04,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:04,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:04,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:04,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:04,648 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:35:04,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:04,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:35:04,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:04,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:35:04,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:35:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:35:04,650 INFO L87 Difference]: Start difference. First operand 222019 states and 354863 transitions. Second operand 4 states. [2019-09-10 06:35:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:05,250 INFO L93 Difference]: Finished difference Result 214380 states and 342510 transitions. [2019-09-10 06:35:05,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:35:05,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2019-09-10 06:35:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:05,550 INFO L225 Difference]: With dead ends: 214380 [2019-09-10 06:35:05,550 INFO L226 Difference]: Without dead ends: 213846 [2019-09-10 06:35:05,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:35:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213846 states. [2019-09-10 06:35:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213846 to 213822. [2019-09-10 06:35:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213822 states. [2019-09-10 06:35:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213822 states to 213822 states and 341635 transitions. [2019-09-10 06:35:09,815 INFO L78 Accepts]: Start accepts. Automaton has 213822 states and 341635 transitions. Word has length 279 [2019-09-10 06:35:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:09,815 INFO L475 AbstractCegarLoop]: Abstraction has 213822 states and 341635 transitions. [2019-09-10 06:35:09,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:35:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 213822 states and 341635 transitions. [2019-09-10 06:35:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-10 06:35:09,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:09,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:09,895 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:09,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:09,896 INFO L82 PathProgramCache]: Analyzing trace with hash 156826949, now seen corresponding path program 1 times [2019-09-10 06:35:09,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:09,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:09,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:09,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:09,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:10,020 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:35:10,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:10,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:35:10,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:10,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:35:10,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:35:10,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:10,022 INFO L87 Difference]: Start difference. First operand 213822 states and 341635 transitions. Second operand 3 states. [2019-09-10 06:35:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:10,981 INFO L93 Difference]: Finished difference Result 248404 states and 384519 transitions. [2019-09-10 06:35:10,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:35:10,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-09-10 06:35:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:11,332 INFO L225 Difference]: With dead ends: 248404 [2019-09-10 06:35:11,332 INFO L226 Difference]: Without dead ends: 248360 [2019-09-10 06:35:11,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248360 states. [2019-09-10 06:35:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248360 to 244716. [2019-09-10 06:35:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244716 states. [2019-09-10 06:35:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244716 states to 244716 states and 380435 transitions. [2019-09-10 06:35:15,515 INFO L78 Accepts]: Start accepts. Automaton has 244716 states and 380435 transitions. Word has length 287 [2019-09-10 06:35:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:15,516 INFO L475 AbstractCegarLoop]: Abstraction has 244716 states and 380435 transitions. [2019-09-10 06:35:15,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:35:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 244716 states and 380435 transitions. [2019-09-10 06:35:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-10 06:35:15,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:15,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:15,620 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:15,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1024097440, now seen corresponding path program 1 times [2019-09-10 06:35:15,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:15,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:15,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:15,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:15,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:15,757 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:35:15,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:15,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:35:15,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:15,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:35:15,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:35:15,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:15,758 INFO L87 Difference]: Start difference. First operand 244716 states and 380435 transitions. Second operand 3 states. [2019-09-10 06:35:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:17,775 INFO L93 Difference]: Finished difference Result 397881 states and 618750 transitions. [2019-09-10 06:35:17,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:35:17,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2019-09-10 06:35:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:18,306 INFO L225 Difference]: With dead ends: 397881 [2019-09-10 06:35:18,306 INFO L226 Difference]: Without dead ends: 397873 [2019-09-10 06:35:18,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397873 states. [2019-09-10 06:35:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397873 to 397395. [2019-09-10 06:35:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397395 states. [2019-09-10 06:35:29,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397395 states to 397395 states and 618246 transitions. [2019-09-10 06:35:29,134 INFO L78 Accepts]: Start accepts. Automaton has 397395 states and 618246 transitions. Word has length 290 [2019-09-10 06:35:29,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:29,134 INFO L475 AbstractCegarLoop]: Abstraction has 397395 states and 618246 transitions. [2019-09-10 06:35:29,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:35:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 397395 states and 618246 transitions. [2019-09-10 06:35:29,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-10 06:35:29,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:29,336 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:29,336 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:29,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:29,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1935610132, now seen corresponding path program 1 times [2019-09-10 06:35:29,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:29,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:29,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:29,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:29,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:29,494 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:35:29,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:29,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:35:29,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:29,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:35:29,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:35:29,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:29,495 INFO L87 Difference]: Start difference. First operand 397395 states and 618246 transitions. Second operand 3 states. [2019-09-10 06:35:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:32,946 INFO L93 Difference]: Finished difference Result 668427 states and 1038196 transitions. [2019-09-10 06:35:32,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:35:32,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2019-09-10 06:35:32,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:33,880 INFO L225 Difference]: With dead ends: 668427 [2019-09-10 06:35:33,880 INFO L226 Difference]: Without dead ends: 668427 [2019-09-10 06:35:33,881 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:35:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668427 states. [2019-09-10 06:35:43,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668427 to 667081. [2019-09-10 06:35:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667081 states. [2019-09-10 06:35:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667081 states to 667081 states and 1036852 transitions. [2019-09-10 06:35:46,232 INFO L78 Accepts]: Start accepts. Automaton has 667081 states and 1036852 transitions. Word has length 290 [2019-09-10 06:35:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:35:46,232 INFO L475 AbstractCegarLoop]: Abstraction has 667081 states and 1036852 transitions. [2019-09-10 06:35:46,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:35:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 667081 states and 1036852 transitions. [2019-09-10 06:35:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-10 06:35:46,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:35:46,547 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:35:46,547 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:35:46,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:35:46,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1298576504, now seen corresponding path program 1 times [2019-09-10 06:35:46,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:35:46,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:46,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:35:46,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:35:46,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:35:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:35:46,682 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:35:46,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:35:46,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:35:46,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:35:46,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:35:46,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:35:46,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:35:46,684 INFO L87 Difference]: Start difference. First operand 667081 states and 1036852 transitions. Second operand 3 states. [2019-09-10 06:35:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:35:56,481 INFO L93 Difference]: Finished difference Result 1132505 states and 1758087 transitions. [2019-09-10 06:35:56,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:35:56,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2019-09-10 06:35:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:35:58,253 INFO L225 Difference]: With dead ends: 1132505 [2019-09-10 06:35:58,254 INFO L226 Difference]: Without dead ends: 1132505 [2019-09-10 06:35:58,254 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:36:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132505 states. [2019-09-10 06:36:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132505 to 1130415. [2019-09-10 06:36:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130415 states. [2019-09-10 06:36:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130415 states to 1130415 states and 1755999 transitions. [2019-09-10 06:36:36,313 INFO L78 Accepts]: Start accepts. Automaton has 1130415 states and 1755999 transitions. Word has length 290 [2019-09-10 06:36:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:36,314 INFO L475 AbstractCegarLoop]: Abstraction has 1130415 states and 1755999 transitions. [2019-09-10 06:36:36,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:36:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1130415 states and 1755999 transitions. [2019-09-10 06:36:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-10 06:36:36,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:36,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:36,842 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:36,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:36,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1294576852, now seen corresponding path program 1 times [2019-09-10 06:36:36,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:36,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:36,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:36,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:36,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:36,975 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:36:36,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:36,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:36,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:36,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:36,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:36,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:36,977 INFO L87 Difference]: Start difference. First operand 1130415 states and 1755999 transitions. Second operand 3 states. [2019-09-10 06:36:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:36:46,735 INFO L93 Difference]: Finished difference Result 1937622 states and 3008173 transitions. [2019-09-10 06:36:46,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:36:46,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2019-09-10 06:36:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted.