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_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:32:40,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:32:40,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:32:40,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:32:40,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:32:40,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:32:40,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:32:40,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:32:40,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:32:40,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:32:40,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:32:40,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:32:40,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:32:40,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:32:40,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:32:40,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:32:40,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:32:40,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:32:40,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:32:40,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:32:40,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:32:40,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:32:40,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:32:40,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:32:40,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:32:40,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:32:40,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:32:40,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:32:40,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:32:40,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:32:40,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:32:40,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:32:40,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:32:40,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:32:40,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:32:40,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:32:40,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:32:40,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:32:40,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:32:40,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:32:40,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:32:40,981 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 08:32:41,004 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:32:41,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:32:41,005 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:32:41,005 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:32:41,005 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:32:41,006 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:32:41,006 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:32:41,006 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:32:41,006 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:32:41,006 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:32:41,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:32:41,007 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:32:41,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:32:41,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:32:41,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:32:41,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:32:41,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:32:41,009 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:32:41,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:32:41,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:32:41,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:32:41,009 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:32:41,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:32:41,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:32:41,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:32:41,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:32:41,010 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:32:41,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:32:41,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:32:41,011 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:32:41,053 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:32:41,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:32:41,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:32:41,069 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:32:41,070 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:32:41,071 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:32:41,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565a70f60/7e2a651f78834cc8910ddfa07b46813f/FLAG77cff4f50 [2019-09-10 08:32:41,607 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:32:41,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:32:41,620 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565a70f60/7e2a651f78834cc8910ddfa07b46813f/FLAG77cff4f50 [2019-09-10 08:32:41,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565a70f60/7e2a651f78834cc8910ddfa07b46813f [2019-09-10 08:32:41,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:32:41,960 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:32:41,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:32:41,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:32:41,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:32:41,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:32:41" (1/1) ... [2019-09-10 08:32:41,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@629e0c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:41, skipping insertion in model container [2019-09-10 08:32:41,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:32:41" (1/1) ... [2019-09-10 08:32:41,976 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:32:42,035 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:32:42,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:32:42,571 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:32:42,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:32:42,719 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:32:42,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:42 WrapperNode [2019-09-10 08:32:42,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:32:42,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:32:42,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:32:42,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:32:42,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:42" (1/1) ... [2019-09-10 08:32:42,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:42" (1/1) ... [2019-09-10 08:32:42,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:42" (1/1) ... [2019-09-10 08:32:42,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:42" (1/1) ... [2019-09-10 08:32:42,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:42" (1/1) ... [2019-09-10 08:32:42,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:42" (1/1) ... [2019-09-10 08:32:42,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:42" (1/1) ... [2019-09-10 08:32:42,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:32:42,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:32:42,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:32:42,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:32:42,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:42" (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 08:32:42,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:32:42,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:32:42,863 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:32:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:32:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:32:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:32:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:32:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:32:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:32:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:32:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:32:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:32:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:32:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:32:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:32:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:32:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:32:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:32:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-10 08:32:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:32:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:32:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:32:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:32:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:32:43,663 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:32:43,663 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:32:43,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:32:43 BoogieIcfgContainer [2019-09-10 08:32:43,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:32:43,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:32:43,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:32:43,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:32:43,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:32:41" (1/3) ... [2019-09-10 08:32:43,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601bafe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:32:43, skipping insertion in model container [2019-09-10 08:32:43,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:32:42" (2/3) ... [2019-09-10 08:32:43,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601bafe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:32:43, skipping insertion in model container [2019-09-10 08:32:43,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:32:43" (3/3) ... [2019-09-10 08:32:43,673 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:32:43,683 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:32:43,692 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:32:43,709 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:32:43,735 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:32:43,735 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:32:43,735 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:32:43,735 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:32:43,736 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:32:43,736 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:32:43,736 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:32:43,736 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:32:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2019-09-10 08:32:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:32:43,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:43,775 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] [2019-09-10 08:32:43,777 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:43,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:43,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1286510707, now seen corresponding path program 1 times [2019-09-10 08:32:43,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:43,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:43,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:43,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:43,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:44,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:44,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:44,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:44,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:44,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:44,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:44,431 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2019-09-10 08:32:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:44,513 INFO L93 Difference]: Finished difference Result 252 states and 414 transitions. [2019-09-10 08:32:44,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:44,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 08:32:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:44,541 INFO L225 Difference]: With dead ends: 252 [2019-09-10 08:32:44,541 INFO L226 Difference]: Without dead ends: 244 [2019-09-10 08:32:44,545 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 08:32:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-09-10 08:32:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2019-09-10 08:32:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-10 08:32:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 345 transitions. [2019-09-10 08:32:44,644 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 345 transitions. Word has length 106 [2019-09-10 08:32:44,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:44,645 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 345 transitions. [2019-09-10 08:32:44,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 345 transitions. [2019-09-10 08:32:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:32:44,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:44,648 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] [2019-09-10 08:32:44,648 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:44,649 INFO L82 PathProgramCache]: Analyzing trace with hash 995232503, now seen corresponding path program 1 times [2019-09-10 08:32:44,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:44,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:44,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:44,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:44,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:32:44,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:44,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:44,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:44,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:44,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:44,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:44,882 INFO L87 Difference]: Start difference. First operand 242 states and 345 transitions. Second operand 3 states. [2019-09-10 08:32:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:44,926 INFO L93 Difference]: Finished difference Result 400 states and 594 transitions. [2019-09-10 08:32:44,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:44,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:32:44,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:44,930 INFO L225 Difference]: With dead ends: 400 [2019-09-10 08:32:44,930 INFO L226 Difference]: Without dead ends: 400 [2019-09-10 08:32:44,931 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 08:32:44,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-10 08:32:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 398. [2019-09-10 08:32:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-10 08:32:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 593 transitions. [2019-09-10 08:32:44,955 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 593 transitions. Word has length 107 [2019-09-10 08:32:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:44,955 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 593 transitions. [2019-09-10 08:32:44,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 593 transitions. [2019-09-10 08:32:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:32:44,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:44,958 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] [2019-09-10 08:32:44,958 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:44,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:44,959 INFO L82 PathProgramCache]: Analyzing trace with hash -496599856, now seen corresponding path program 1 times [2019-09-10 08:32:44,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:44,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:44,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:44,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:44,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:45,112 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 08:32:45,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:45,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:45,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:45,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:45,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:45,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:45,115 INFO L87 Difference]: Start difference. First operand 398 states and 593 transitions. Second operand 3 states. [2019-09-10 08:32:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:45,164 INFO L93 Difference]: Finished difference Result 696 states and 1062 transitions. [2019-09-10 08:32:45,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:45,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 08:32:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:45,170 INFO L225 Difference]: With dead ends: 696 [2019-09-10 08:32:45,170 INFO L226 Difference]: Without dead ends: 696 [2019-09-10 08:32:45,171 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 08:32:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-09-10 08:32:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 694. [2019-09-10 08:32:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-09-10 08:32:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1061 transitions. [2019-09-10 08:32:45,198 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1061 transitions. Word has length 108 [2019-09-10 08:32:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:45,198 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 1061 transitions. [2019-09-10 08:32:45,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1061 transitions. [2019-09-10 08:32:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:32:45,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:45,201 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] [2019-09-10 08:32:45,201 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash -670648320, now seen corresponding path program 1 times [2019-09-10 08:32:45,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:45,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:45,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:45,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:45,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:45,313 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 08:32:45,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:45,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:45,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:45,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:45,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:45,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:45,315 INFO L87 Difference]: Start difference. First operand 694 states and 1061 transitions. Second operand 3 states. [2019-09-10 08:32:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:45,347 INFO L93 Difference]: Finished difference Result 1256 states and 1942 transitions. [2019-09-10 08:32:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:45,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 08:32:45,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:45,360 INFO L225 Difference]: With dead ends: 1256 [2019-09-10 08:32:45,360 INFO L226 Difference]: Without dead ends: 1256 [2019-09-10 08:32:45,360 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 08:32:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-09-10 08:32:45,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1254. [2019-09-10 08:32:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2019-09-10 08:32:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1941 transitions. [2019-09-10 08:32:45,399 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1941 transitions. Word has length 109 [2019-09-10 08:32:45,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:45,400 INFO L475 AbstractCegarLoop]: Abstraction has 1254 states and 1941 transitions. [2019-09-10 08:32:45,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1941 transitions. [2019-09-10 08:32:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:32:45,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:45,403 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] [2019-09-10 08:32:45,403 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:45,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1550925354, now seen corresponding path program 1 times [2019-09-10 08:32:45,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:45,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:45,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:45,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:45,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:45,516 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 08:32:45,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:45,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:45,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:45,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:45,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:45,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:45,519 INFO L87 Difference]: Start difference. First operand 1254 states and 1941 transitions. Second operand 3 states. [2019-09-10 08:32:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:45,565 INFO L93 Difference]: Finished difference Result 2312 states and 3590 transitions. [2019-09-10 08:32:45,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:45,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 08:32:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:45,580 INFO L225 Difference]: With dead ends: 2312 [2019-09-10 08:32:45,581 INFO L226 Difference]: Without dead ends: 2312 [2019-09-10 08:32:45,581 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 08:32:45,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2019-09-10 08:32:45,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2310. [2019-09-10 08:32:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2310 states. [2019-09-10 08:32:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 3589 transitions. [2019-09-10 08:32:45,640 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 3589 transitions. Word has length 110 [2019-09-10 08:32:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:45,641 INFO L475 AbstractCegarLoop]: Abstraction has 2310 states and 3589 transitions. [2019-09-10 08:32:45,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 3589 transitions. [2019-09-10 08:32:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:32:45,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:45,644 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] [2019-09-10 08:32:45,644 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:45,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:45,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1544892452, now seen corresponding path program 1 times [2019-09-10 08:32:45,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:45,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:45,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:45,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:45,809 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 08:32:45,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:45,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:45,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:45,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:45,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:45,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:45,812 INFO L87 Difference]: Start difference. First operand 2310 states and 3589 transitions. Second operand 3 states. [2019-09-10 08:32:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:45,865 INFO L93 Difference]: Finished difference Result 4296 states and 6662 transitions. [2019-09-10 08:32:45,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:45,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:32:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:45,889 INFO L225 Difference]: With dead ends: 4296 [2019-09-10 08:32:45,889 INFO L226 Difference]: Without dead ends: 4296 [2019-09-10 08:32:45,890 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 08:32:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2019-09-10 08:32:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 4294. [2019-09-10 08:32:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4294 states. [2019-09-10 08:32:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 6661 transitions. [2019-09-10 08:32:46,017 INFO L78 Accepts]: Start accepts. Automaton has 4294 states and 6661 transitions. Word has length 111 [2019-09-10 08:32:46,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:46,024 INFO L475 AbstractCegarLoop]: Abstraction has 4294 states and 6661 transitions. [2019-09-10 08:32:46,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 4294 states and 6661 transitions. [2019-09-10 08:32:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:32:46,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:46,038 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] [2019-09-10 08:32:46,039 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:46,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:46,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1907719388, now seen corresponding path program 1 times [2019-09-10 08:32:46,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:46,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:46,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:46,185 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 08:32:46,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:46,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:32:46,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:46,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:32:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:32:46,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:32:46,188 INFO L87 Difference]: Start difference. First operand 4294 states and 6661 transitions. Second operand 3 states. [2019-09-10 08:32:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:46,288 INFO L93 Difference]: Finished difference Result 8008 states and 12358 transitions. [2019-09-10 08:32:46,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:32:46,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 08:32:46,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:46,349 INFO L225 Difference]: With dead ends: 8008 [2019-09-10 08:32:46,350 INFO L226 Difference]: Without dead ends: 8008 [2019-09-10 08:32:46,350 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 08:32:46,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8008 states. [2019-09-10 08:32:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8008 to 8006. [2019-09-10 08:32:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8006 states. [2019-09-10 08:32:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8006 states to 8006 states and 12357 transitions. [2019-09-10 08:32:46,657 INFO L78 Accepts]: Start accepts. Automaton has 8006 states and 12357 transitions. Word has length 112 [2019-09-10 08:32:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:46,657 INFO L475 AbstractCegarLoop]: Abstraction has 8006 states and 12357 transitions. [2019-09-10 08:32:46,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:32:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 8006 states and 12357 transitions. [2019-09-10 08:32:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:46,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:46,659 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] [2019-09-10 08:32:46,660 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:46,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:46,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1486086768, now seen corresponding path program 1 times [2019-09-10 08:32:46,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:46,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:46,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:46,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:46,809 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 08:32:46,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:46,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:46,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:46,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:46,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:46,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:46,812 INFO L87 Difference]: Start difference. First operand 8006 states and 12357 transitions. Second operand 5 states. [2019-09-10 08:32:47,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:47,177 INFO L93 Difference]: Finished difference Result 15944 states and 24518 transitions. [2019-09-10 08:32:47,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:47,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:32:47,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:47,254 INFO L225 Difference]: With dead ends: 15944 [2019-09-10 08:32:47,255 INFO L226 Difference]: Without dead ends: 15944 [2019-09-10 08:32:47,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15944 states. [2019-09-10 08:32:47,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15944 to 15942. [2019-09-10 08:32:47,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-09-10 08:32:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 24517 transitions. [2019-09-10 08:32:47,825 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 24517 transitions. Word has length 113 [2019-09-10 08:32:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:47,826 INFO L475 AbstractCegarLoop]: Abstraction has 15942 states and 24517 transitions. [2019-09-10 08:32:47,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 24517 transitions. [2019-09-10 08:32:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:47,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:47,828 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] [2019-09-10 08:32:47,829 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:47,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:47,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1589830517, now seen corresponding path program 1 times [2019-09-10 08:32:47,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:47,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:47,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:47,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:47,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:48,015 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 08:32:48,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:48,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:48,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:48,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:48,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:48,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:48,017 INFO L87 Difference]: Start difference. First operand 15942 states and 24517 transitions. Second operand 5 states. [2019-09-10 08:32:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:48,260 INFO L93 Difference]: Finished difference Result 15942 states and 24389 transitions. [2019-09-10 08:32:48,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:48,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:32:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:48,305 INFO L225 Difference]: With dead ends: 15942 [2019-09-10 08:32:48,305 INFO L226 Difference]: Without dead ends: 15942 [2019-09-10 08:32:48,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15942 states. [2019-09-10 08:32:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15942 to 15942. [2019-09-10 08:32:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-09-10 08:32:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 24389 transitions. [2019-09-10 08:32:49,141 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 24389 transitions. Word has length 113 [2019-09-10 08:32:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:49,141 INFO L475 AbstractCegarLoop]: Abstraction has 15942 states and 24389 transitions. [2019-09-10 08:32:49,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 24389 transitions. [2019-09-10 08:32:49,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:49,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:49,144 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] [2019-09-10 08:32:49,145 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:49,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:49,145 INFO L82 PathProgramCache]: Analyzing trace with hash -315962512, now seen corresponding path program 1 times [2019-09-10 08:32:49,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:49,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:49,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:49,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:49,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:49,277 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 08:32:49,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:49,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:49,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:49,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:49,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:49,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:49,279 INFO L87 Difference]: Start difference. First operand 15942 states and 24389 transitions. Second operand 5 states. [2019-09-10 08:32:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:49,480 INFO L93 Difference]: Finished difference Result 15942 states and 24261 transitions. [2019-09-10 08:32:49,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:49,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:32:49,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:49,518 INFO L225 Difference]: With dead ends: 15942 [2019-09-10 08:32:49,519 INFO L226 Difference]: Without dead ends: 15942 [2019-09-10 08:32:49,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15942 states. [2019-09-10 08:32:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15942 to 15942. [2019-09-10 08:32:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-09-10 08:32:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 24261 transitions. [2019-09-10 08:32:49,916 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 24261 transitions. Word has length 113 [2019-09-10 08:32:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:49,916 INFO L475 AbstractCegarLoop]: Abstraction has 15942 states and 24261 transitions. [2019-09-10 08:32:49,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 24261 transitions. [2019-09-10 08:32:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:49,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:49,918 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] [2019-09-10 08:32:49,918 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:49,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:49,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1219435413, now seen corresponding path program 1 times [2019-09-10 08:32:49,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:49,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:49,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:49,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:49,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:50,064 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 08:32:50,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:50,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:50,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:50,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:50,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:50,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:50,067 INFO L87 Difference]: Start difference. First operand 15942 states and 24261 transitions. Second operand 5 states. [2019-09-10 08:32:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:50,258 INFO L93 Difference]: Finished difference Result 15942 states and 24133 transitions. [2019-09-10 08:32:50,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:50,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:32:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:50,291 INFO L225 Difference]: With dead ends: 15942 [2019-09-10 08:32:50,291 INFO L226 Difference]: Without dead ends: 15942 [2019-09-10 08:32:50,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15942 states. [2019-09-10 08:32:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15942 to 15942. [2019-09-10 08:32:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-09-10 08:32:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 24133 transitions. [2019-09-10 08:32:50,702 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 24133 transitions. Word has length 113 [2019-09-10 08:32:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:50,702 INFO L475 AbstractCegarLoop]: Abstraction has 15942 states and 24133 transitions. [2019-09-10 08:32:50,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 24133 transitions. [2019-09-10 08:32:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:50,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:50,704 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] [2019-09-10 08:32:50,704 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:50,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:50,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1748146694, now seen corresponding path program 1 times [2019-09-10 08:32:50,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:50,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:50,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:50,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:50,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:50,829 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 08:32:50,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:50,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:50,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:50,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:50,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:50,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:50,831 INFO L87 Difference]: Start difference. First operand 15942 states and 24133 transitions. Second operand 5 states. [2019-09-10 08:32:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:51,000 INFO L93 Difference]: Finished difference Result 15942 states and 24005 transitions. [2019-09-10 08:32:51,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:51,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:32:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:51,030 INFO L225 Difference]: With dead ends: 15942 [2019-09-10 08:32:51,030 INFO L226 Difference]: Without dead ends: 15942 [2019-09-10 08:32:51,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:51,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15942 states. [2019-09-10 08:32:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15942 to 15942. [2019-09-10 08:32:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-09-10 08:32:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 24005 transitions. [2019-09-10 08:32:51,272 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 24005 transitions. Word has length 113 [2019-09-10 08:32:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:51,273 INFO L475 AbstractCegarLoop]: Abstraction has 15942 states and 24005 transitions. [2019-09-10 08:32:51,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 24005 transitions. [2019-09-10 08:32:51,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:51,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:51,276 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] [2019-09-10 08:32:51,276 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:51,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:51,277 INFO L82 PathProgramCache]: Analyzing trace with hash -26815819, now seen corresponding path program 1 times [2019-09-10 08:32:51,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:51,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:51,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:51,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:51,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:51,389 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 08:32:51,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:51,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:32:51,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:51,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:32:51,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:32:51,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:32:51,391 INFO L87 Difference]: Start difference. First operand 15942 states and 24005 transitions. Second operand 5 states. [2019-09-10 08:32:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:51,553 INFO L93 Difference]: Finished difference Result 15942 states and 23877 transitions. [2019-09-10 08:32:51,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:32:51,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:32:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:51,579 INFO L225 Difference]: With dead ends: 15942 [2019-09-10 08:32:51,579 INFO L226 Difference]: Without dead ends: 15942 [2019-09-10 08:32:51,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:32:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15942 states. [2019-09-10 08:32:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15942 to 15942. [2019-09-10 08:32:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-09-10 08:32:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 23877 transitions. [2019-09-10 08:32:52,036 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 23877 transitions. Word has length 113 [2019-09-10 08:32:52,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:52,037 INFO L475 AbstractCegarLoop]: Abstraction has 15942 states and 23877 transitions. [2019-09-10 08:32:52,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:32:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 23877 transitions. [2019-09-10 08:32:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:32:52,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:52,038 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] [2019-09-10 08:32:52,039 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:52,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:52,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1473845414, now seen corresponding path program 1 times [2019-09-10 08:32:52,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:52,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:52,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:52,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:52,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:52,322 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 08:32:52,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:52,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:32:52,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:52,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:32:52,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:32:52,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:32:52,324 INFO L87 Difference]: Start difference. First operand 15942 states and 23877 transitions. Second operand 10 states. [2019-09-10 08:32:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:54,284 INFO L93 Difference]: Finished difference Result 222304 states and 330322 transitions. [2019-09-10 08:32:54,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:32:54,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-09-10 08:32:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:54,776 INFO L225 Difference]: With dead ends: 222304 [2019-09-10 08:32:54,776 INFO L226 Difference]: Without dead ends: 222304 [2019-09-10 08:32:54,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:32:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222304 states. [2019-09-10 08:32:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222304 to 47686. [2019-09-10 08:32:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47686 states. [2019-09-10 08:32:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47686 states to 47686 states and 70981 transitions. [2019-09-10 08:32:57,793 INFO L78 Accepts]: Start accepts. Automaton has 47686 states and 70981 transitions. Word has length 113 [2019-09-10 08:32:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:57,793 INFO L475 AbstractCegarLoop]: Abstraction has 47686 states and 70981 transitions. [2019-09-10 08:32:57,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:32:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 47686 states and 70981 transitions. [2019-09-10 08:32:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:32:57,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:57,795 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] [2019-09-10 08:32:57,795 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash 100626548, now seen corresponding path program 1 times [2019-09-10 08:32:57,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:57,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:57,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:57,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:57,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:32:58,274 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 08:32:58,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:32:58,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:32:58,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:32:58,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:32:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:32:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:32:58,276 INFO L87 Difference]: Start difference. First operand 47686 states and 70981 transitions. Second operand 10 states. [2019-09-10 08:32:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:32:58,858 INFO L93 Difference]: Finished difference Result 63564 states and 94536 transitions. [2019-09-10 08:32:58,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:32:58,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2019-09-10 08:32:58,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:32:58,969 INFO L225 Difference]: With dead ends: 63564 [2019-09-10 08:32:58,969 INFO L226 Difference]: Without dead ends: 63564 [2019-09-10 08:32:58,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:32:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63564 states. [2019-09-10 08:32:59,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63564 to 47686. [2019-09-10 08:32:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47686 states. [2019-09-10 08:32:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47686 states to 47686 states and 70725 transitions. [2019-09-10 08:32:59,884 INFO L78 Accepts]: Start accepts. Automaton has 47686 states and 70725 transitions. Word has length 115 [2019-09-10 08:32:59,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:32:59,885 INFO L475 AbstractCegarLoop]: Abstraction has 47686 states and 70725 transitions. [2019-09-10 08:32:59,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:32:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 47686 states and 70725 transitions. [2019-09-10 08:32:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:32:59,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:32:59,887 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] [2019-09-10 08:32:59,887 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:32:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:32:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash 80577205, now seen corresponding path program 1 times [2019-09-10 08:32:59,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:32:59,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:59,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:32:59,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:32:59,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:32:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:00,001 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 08:33:00,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:00,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:00,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:00,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:00,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:00,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:00,005 INFO L87 Difference]: Start difference. First operand 47686 states and 70725 transitions. Second operand 3 states. [2019-09-10 08:33:00,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:00,175 INFO L93 Difference]: Finished difference Result 69448 states and 101254 transitions. [2019-09-10 08:33:00,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:00,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 08:33:00,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:00,261 INFO L225 Difference]: With dead ends: 69448 [2019-09-10 08:33:00,262 INFO L226 Difference]: Without dead ends: 69448 [2019-09-10 08:33:00,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 08:33:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69448 states. [2019-09-10 08:33:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69448 to 69062. [2019-09-10 08:33:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69062 states. [2019-09-10 08:33:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69062 states to 69062 states and 100869 transitions. [2019-09-10 08:33:01,617 INFO L78 Accepts]: Start accepts. Automaton has 69062 states and 100869 transitions. Word has length 115 [2019-09-10 08:33:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:01,618 INFO L475 AbstractCegarLoop]: Abstraction has 69062 states and 100869 transitions. [2019-09-10 08:33:01,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:33:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 69062 states and 100869 transitions. [2019-09-10 08:33:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:33:01,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:01,622 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] [2019-09-10 08:33:01,622 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:01,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:01,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1177453533, now seen corresponding path program 1 times [2019-09-10 08:33:01,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:01,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:01,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:01,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:01,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:01,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:01,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:33:01,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:01,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:33:01,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:33:01,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:33:01,786 INFO L87 Difference]: Start difference. First operand 69062 states and 100869 transitions. Second operand 5 states. [2019-09-10 08:33:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:02,147 INFO L93 Difference]: Finished difference Result 129799 states and 188291 transitions. [2019-09-10 08:33:02,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:33:02,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-10 08:33:02,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:02,328 INFO L225 Difference]: With dead ends: 129799 [2019-09-10 08:33:02,328 INFO L226 Difference]: Without dead ends: 129799 [2019-09-10 08:33:02,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:33:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129799 states. [2019-09-10 08:33:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129799 to 70854. [2019-09-10 08:33:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70854 states. [2019-09-10 08:33:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70854 states to 70854 states and 102533 transitions. [2019-09-10 08:33:05,215 INFO L78 Accepts]: Start accepts. Automaton has 70854 states and 102533 transitions. Word has length 116 [2019-09-10 08:33:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:05,216 INFO L475 AbstractCegarLoop]: Abstraction has 70854 states and 102533 transitions. [2019-09-10 08:33:05,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:33:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 70854 states and 102533 transitions. [2019-09-10 08:33:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:33:05,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:05,218 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] [2019-09-10 08:33:05,218 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:05,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1245567265, now seen corresponding path program 1 times [2019-09-10 08:33:05,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:05,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:05,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:05,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:05,313 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 08:33:05,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:05,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:33:05,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:05,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:33:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:33:05,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:33:05,315 INFO L87 Difference]: Start difference. First operand 70854 states and 102533 transitions. Second operand 3 states. [2019-09-10 08:33:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:05,649 INFO L93 Difference]: Finished difference Result 112330 states and 162056 transitions. [2019-09-10 08:33:05,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:33:05,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 08:33:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:05,812 INFO L225 Difference]: With dead ends: 112330 [2019-09-10 08:33:05,812 INFO L226 Difference]: Without dead ends: 112330 [2019-09-10 08:33:05,813 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 08:33:05,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112330 states. [2019-09-10 08:33:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112330 to 112328. [2019-09-10 08:33:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112328 states. [2019-09-10 08:33:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112328 states to 112328 states and 162055 transitions. [2019-09-10 08:33:07,578 INFO L78 Accepts]: Start accepts. Automaton has 112328 states and 162055 transitions. Word has length 116 [2019-09-10 08:33:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:07,578 INFO L475 AbstractCegarLoop]: Abstraction has 112328 states and 162055 transitions. [2019-09-10 08:33:07,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:33:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 112328 states and 162055 transitions. [2019-09-10 08:33:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:33:07,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:07,607 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:07,608 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:07,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2023003395, now seen corresponding path program 1 times [2019-09-10 08:33:07,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:07,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:07,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:07,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:07,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:07,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:33:07,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:33:07,783 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-09-10 08:33:07,785 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [188], [206], [209], [212], [217], [219], [222], [230], [232], [235], [243], [245], [248], [256], [258], [261], [269], [271], [274], [282], [284], [287], [295], [297], [300], [307], [309], [312], [313], [315], [324], [327], [331], [340], [342], [345], [348], [350], [365], [367], [370], [373], [375], [390], [392], [395], [398], [400], [415], [417], [420], [423], [425], [440], [442], [445], [448], [450], [465], [467], [470], [473], [475], [483], [486], [492], [495], [498], [500], [519], [522], [525], [527], [598], [599], [603], [604], [605] [2019-09-10 08:33:07,830 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:33:07,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:33:07,996 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:33:11,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:33:11,263 INFO L272 AbstractInterpreter]: Visited 141 different actions 1246 times. Merged at 73 different actions 965 times. Widened at 30 different actions 138 times. Performed 4530 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4530 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 131 fixpoints after 25 different actions. Largest state had 197 variables. [2019-09-10 08:33:11,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:11,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:33:11,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:33:11,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:33:11,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:11,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:33:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:11,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 08:33:11,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:33:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:33:11,806 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:33:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:33:11,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:33:11,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 10] total 19 [2019-09-10 08:33:11,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:11,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:11,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:11,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:33:11,996 INFO L87 Difference]: Start difference. First operand 112328 states and 162055 transitions. Second operand 10 states. [2019-09-10 08:33:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:14,996 INFO L93 Difference]: Finished difference Result 778840 states and 1123279 transitions. [2019-09-10 08:33:14,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:33:14,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-10 08:33:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:16,186 INFO L225 Difference]: With dead ends: 778840 [2019-09-10 08:33:16,187 INFO L226 Difference]: Without dead ends: 778840 [2019-09-10 08:33:16,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:33:16,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778840 states. [2019-09-10 08:33:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778840 to 187336. [2019-09-10 08:33:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187336 states. [2019-09-10 08:33:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187336 states to 187336 states and 268935 transitions. [2019-09-10 08:33:26,954 INFO L78 Accepts]: Start accepts. Automaton has 187336 states and 268935 transitions. Word has length 155 [2019-09-10 08:33:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:26,954 INFO L475 AbstractCegarLoop]: Abstraction has 187336 states and 268935 transitions. [2019-09-10 08:33:26,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 187336 states and 268935 transitions. [2019-09-10 08:33:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:33:27,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:27,001 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:27,001 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:27,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:27,002 INFO L82 PathProgramCache]: Analyzing trace with hash -176973757, now seen corresponding path program 1 times [2019-09-10 08:33:27,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:27,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:27,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:27,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:27,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:33:27,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:33:27,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:33:27,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:27,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:27,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:27,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:33:27,488 INFO L87 Difference]: Start difference. First operand 187336 states and 268935 transitions. Second operand 10 states. [2019-09-10 08:33:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:34,154 INFO L93 Difference]: Finished difference Result 590680 states and 848399 transitions. [2019-09-10 08:33:34,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:33:34,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-10 08:33:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:34,962 INFO L225 Difference]: With dead ends: 590680 [2019-09-10 08:33:34,962 INFO L226 Difference]: Without dead ends: 590680 [2019-09-10 08:33:34,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:33:35,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590680 states. [2019-09-10 08:33:38,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590680 to 261960. [2019-09-10 08:33:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261960 states. [2019-09-10 08:33:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261960 states to 261960 states and 375431 transitions. [2019-09-10 08:33:39,284 INFO L78 Accepts]: Start accepts. Automaton has 261960 states and 375431 transitions. Word has length 155 [2019-09-10 08:33:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:39,284 INFO L475 AbstractCegarLoop]: Abstraction has 261960 states and 375431 transitions. [2019-09-10 08:33:39,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 261960 states and 375431 transitions. [2019-09-10 08:33:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:33:39,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:39,315 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:39,315 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:39,316 INFO L82 PathProgramCache]: Analyzing trace with hash 941361487, now seen corresponding path program 1 times [2019-09-10 08:33:39,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:39,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:39,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:39,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:39,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:39,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:33:39,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:33:39,476 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-09-10 08:33:39,476 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [188], [206], [209], [217], [219], [222], [230], [232], [235], [243], [245], [248], [251], [256], [258], [261], [269], [271], [274], [282], [284], [287], [295], [297], [300], [307], [309], [312], [313], [315], [324], [327], [331], [340], [342], [345], [348], [350], [365], [367], [370], [373], [375], [390], [392], [395], [398], [400], [408], [411], [417], [420], [423], [425], [440], [442], [445], [448], [450], [465], [467], [470], [473], [475], [490], [492], [495], [498], [500], [519], [522], [525], [527], [598], [599], [603], [604], [605] [2019-09-10 08:33:39,484 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:33:39,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:33:39,522 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:33:40,543 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:33:40,546 INFO L272 AbstractInterpreter]: Visited 141 different actions 1299 times. Merged at 73 different actions 1011 times. Widened at 31 different actions 177 times. Performed 4680 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4680 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 128 fixpoints after 24 different actions. Largest state had 197 variables. [2019-09-10 08:33:40,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:40,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:33:40,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:33:40,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:33:40,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:40,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:33:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:40,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 08:33:40,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:33:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:33:41,041 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:33:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:33:41,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:33:41,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 10] total 19 [2019-09-10 08:33:41,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:41,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:41,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:41,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:33:41,217 INFO L87 Difference]: Start difference. First operand 261960 states and 375431 transitions. Second operand 10 states. [2019-09-10 08:33:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:33:43,487 INFO L93 Difference]: Finished difference Result 665304 states and 954895 transitions. [2019-09-10 08:33:43,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:33:43,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-10 08:33:43,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:33:44,318 INFO L225 Difference]: With dead ends: 665304 [2019-09-10 08:33:44,318 INFO L226 Difference]: Without dead ends: 665304 [2019-09-10 08:33:44,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:33:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665304 states. [2019-09-10 08:33:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665304 to 336584. [2019-09-10 08:33:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336584 states. [2019-09-10 08:33:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336584 states to 336584 states and 481927 transitions. [2019-09-10 08:33:56,326 INFO L78 Accepts]: Start accepts. Automaton has 336584 states and 481927 transitions. Word has length 155 [2019-09-10 08:33:56,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:33:56,327 INFO L475 AbstractCegarLoop]: Abstraction has 336584 states and 481927 transitions. [2019-09-10 08:33:56,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:33:56,327 INFO L276 IsEmpty]: Start isEmpty. Operand 336584 states and 481927 transitions. [2019-09-10 08:33:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:33:56,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:33:56,361 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:33:56,361 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:33:56,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:56,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1068722085, now seen corresponding path program 1 times [2019-09-10 08:33:56,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:33:56,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:56,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:56,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:33:56,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:33:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:33:56,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:33:56,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:33:56,530 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-09-10 08:33:56,531 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [188], [206], [209], [217], [219], [222], [230], [232], [235], [243], [245], [248], [256], [258], [261], [269], [271], [274], [277], [282], [284], [287], [295], [297], [300], [307], [309], [312], [313], [315], [324], [327], [331], [340], [342], [345], [348], [350], [358], [361], [367], [370], [373], [375], [390], [392], [395], [398], [400], [415], [417], [420], [423], [425], [440], [442], [445], [448], [450], [465], [467], [470], [473], [475], [490], [492], [495], [498], [500], [519], [522], [525], [527], [598], [599], [603], [604], [605] [2019-09-10 08:33:56,544 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:33:56,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:33:56,611 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:33:57,494 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:33:57,495 INFO L272 AbstractInterpreter]: Visited 141 different actions 1292 times. Merged at 73 different actions 1002 times. Widened at 30 different actions 190 times. Performed 4865 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4865 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 123 fixpoints after 27 different actions. Largest state had 197 variables. [2019-09-10 08:33:57,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:33:57,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:33:57,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:33:57,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:33:57,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:33:57,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:33:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:33:57,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 08:33:57,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:33:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:33:57,920 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:33:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:33:58,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:33:58,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 10] total 19 [2019-09-10 08:33:58,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:33:58,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:33:58,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:33:58,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:33:58,061 INFO L87 Difference]: Start difference. First operand 336584 states and 481927 transitions. Second operand 10 states. [2019-09-10 08:34:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:00,757 INFO L93 Difference]: Finished difference Result 739928 states and 1061391 transitions. [2019-09-10 08:34:00,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:34:00,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-10 08:34:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:01,637 INFO L225 Difference]: With dead ends: 739928 [2019-09-10 08:34:01,637 INFO L226 Difference]: Without dead ends: 739928 [2019-09-10 08:34:01,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:34:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739928 states. [2019-09-10 08:34:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739928 to 411208. [2019-09-10 08:34:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411208 states. [2019-09-10 08:34:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411208 states to 411208 states and 588423 transitions. [2019-09-10 08:34:15,062 INFO L78 Accepts]: Start accepts. Automaton has 411208 states and 588423 transitions. Word has length 155 [2019-09-10 08:34:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:15,062 INFO L475 AbstractCegarLoop]: Abstraction has 411208 states and 588423 transitions. [2019-09-10 08:34:15,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:34:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 411208 states and 588423 transitions. [2019-09-10 08:34:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:34:15,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:15,083 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:15,083 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:15,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1044976863, now seen corresponding path program 1 times [2019-09-10 08:34:15,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:15,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:15,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:15,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:15,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:16,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:34:16,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:34:16,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-09-10 08:34:16,268 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [188], [206], [209], [217], [219], [222], [230], [232], [235], [243], [245], [248], [256], [258], [261], [269], [271], [274], [282], [284], [287], [290], [295], [297], [300], [307], [309], [312], [313], [315], [324], [327], [331], [333], [336], [342], [345], [348], [350], [365], [367], [370], [373], [375], [390], [392], [395], [398], [400], [415], [417], [420], [423], [425], [440], [442], [445], [448], [450], [465], [467], [470], [473], [475], [490], [492], [495], [498], [500], [519], [522], [525], [527], [598], [599], [603], [604], [605] [2019-09-10 08:34:16,271 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:34:16,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:34:16,307 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:34:17,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:34:17,371 INFO L272 AbstractInterpreter]: Visited 141 different actions 1354 times. Merged at 73 different actions 1057 times. Widened at 33 different actions 178 times. Performed 4863 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4863 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 133 fixpoints after 27 different actions. Largest state had 197 variables. [2019-09-10 08:34:17,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:17,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:34:17,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:34:17,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:34:17,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:17,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:34:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:17,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 08:34:17,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:34:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 08:34:17,832 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:34:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 08:34:18,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:34:18,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 10] total 19 [2019-09-10 08:34:18,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:18,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:34:18,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:34:18,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:34:18,009 INFO L87 Difference]: Start difference. First operand 411208 states and 588423 transitions. Second operand 10 states. [2019-09-10 08:34:24,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:24,646 INFO L93 Difference]: Finished difference Result 814550 states and 1167886 transitions. [2019-09-10 08:34:24,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:34:24,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-10 08:34:24,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:25,758 INFO L225 Difference]: With dead ends: 814550 [2019-09-10 08:34:25,758 INFO L226 Difference]: Without dead ends: 814550 [2019-09-10 08:34:25,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:34:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814550 states. [2019-09-10 08:34:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814550 to 485832. [2019-09-10 08:34:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485832 states. [2019-09-10 08:34:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485832 states to 485832 states and 694919 transitions. [2019-09-10 08:34:38,009 INFO L78 Accepts]: Start accepts. Automaton has 485832 states and 694919 transitions. Word has length 155 [2019-09-10 08:34:38,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:38,009 INFO L475 AbstractCegarLoop]: Abstraction has 485832 states and 694919 transitions. [2019-09-10 08:34:38,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:34:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 485832 states and 694919 transitions. [2019-09-10 08:34:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:34:38,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:38,027 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:38,027 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:38,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1441247979, now seen corresponding path program 1 times [2019-09-10 08:34:38,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:38,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:38,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:38,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:38,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:34:38,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:38,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:34:38,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:38,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:34:38,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:34:38,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:34:38,292 INFO L87 Difference]: Start difference. First operand 485832 states and 694919 transitions. Second operand 10 states. [2019-09-10 08:34:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:34:50,101 INFO L93 Difference]: Finished difference Result 889176 states and 1274383 transitions. [2019-09-10 08:34:50,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:34:50,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-10 08:34:50,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:34:51,153 INFO L225 Difference]: With dead ends: 889176 [2019-09-10 08:34:51,154 INFO L226 Difference]: Without dead ends: 889176 [2019-09-10 08:34:51,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:34:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889176 states. [2019-09-10 08:34:58,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889176 to 560456. [2019-09-10 08:34:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560456 states. [2019-09-10 08:34:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560456 states to 560456 states and 801415 transitions. [2019-09-10 08:34:58,986 INFO L78 Accepts]: Start accepts. Automaton has 560456 states and 801415 transitions. Word has length 155 [2019-09-10 08:34:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:34:58,987 INFO L475 AbstractCegarLoop]: Abstraction has 560456 states and 801415 transitions. [2019-09-10 08:34:58,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:34:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 560456 states and 801415 transitions. [2019-09-10 08:34:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:34:59,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:34:59,013 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:34:59,013 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:34:59,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:34:59,014 INFO L82 PathProgramCache]: Analyzing trace with hash -746992375, now seen corresponding path program 1 times [2019-09-10 08:34:59,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:34:59,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:59,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:34:59,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:34:59,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:34:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:34:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:34:59,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:34:59,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:34:59,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:34:59,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:34:59,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:34:59,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:34:59,115 INFO L87 Difference]: Start difference. First operand 560456 states and 801415 transitions. Second operand 3 states. [2019-09-10 08:35:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:05,663 INFO L93 Difference]: Finished difference Result 453250 states and 648714 transitions. [2019-09-10 08:35:05,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:35:05,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-10 08:35:05,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:06,161 INFO L225 Difference]: With dead ends: 453250 [2019-09-10 08:35:06,161 INFO L226 Difference]: Without dead ends: 453250 [2019-09-10 08:35:06,161 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 08:35:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453250 states. [2019-09-10 08:35:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453250 to 453248. [2019-09-10 08:35:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453248 states. [2019-09-10 08:35:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453248 states to 453248 states and 648713 transitions. [2019-09-10 08:35:18,842 INFO L78 Accepts]: Start accepts. Automaton has 453248 states and 648713 transitions. Word has length 155 [2019-09-10 08:35:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:18,842 INFO L475 AbstractCegarLoop]: Abstraction has 453248 states and 648713 transitions. [2019-09-10 08:35:18,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:35:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 453248 states and 648713 transitions. [2019-09-10 08:35:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:35:18,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:18,862 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:18,862 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:18,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1648761363, now seen corresponding path program 1 times [2019-09-10 08:35:18,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:18,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:18,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:18,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:18,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:35:18,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:35:18,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:35:18,992 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2019-09-10 08:35:18,992 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [188], [191], [196], [204], [206], [209], [217], [219], [222], [230], [232], [235], [238], [243], [245], [248], [256], [258], [261], [269], [271], [274], [282], [284], [287], [295], [297], [300], [307], [309], [312], [313], [315], [324], [327], [331], [340], [342], [345], [348], [350], [365], [367], [370], [373], [375], [390], [392], [395], [398], [400], [415], [417], [420], [423], [425], [433], [436], [442], [445], [448], [450], [465], [467], [470], [473], [475], [490], [492], [495], [498], [500], [515], [517], [519], [522], [525], [527], [598], [599], [603], [604], [605] [2019-09-10 08:35:18,994 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:35:18,994 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:35:19,032 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:35:19,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:35:19,919 INFO L272 AbstractInterpreter]: Visited 146 different actions 1450 times. Merged at 78 different actions 1132 times. Widened at 34 different actions 213 times. Performed 5127 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5127 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 152 fixpoints after 28 different actions. Largest state had 197 variables. [2019-09-10 08:35:19,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:19,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:35:19,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:35:19,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:35:19,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:19,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:35:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:20,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 08:35:20,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:35:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:35:20,533 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:35:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:35:21,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:35:21,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5, 10] total 19 [2019-09-10 08:35:21,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:21,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:35:21,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:35:21,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:35:21,664 INFO L87 Difference]: Start difference. First operand 453248 states and 648713 transitions. Second operand 10 states. [2019-09-10 08:35:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:24,209 INFO L93 Difference]: Finished difference Result 785552 states and 1126289 transitions. [2019-09-10 08:35:24,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:35:24,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2019-09-10 08:35:24,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:25,031 INFO L225 Difference]: With dead ends: 785552 [2019-09-10 08:35:25,031 INFO L226 Difference]: Without dead ends: 785552 [2019-09-10 08:35:25,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:35:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785552 states. [2019-09-10 08:35:37,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785552 to 513664. [2019-09-10 08:35:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513664 states. [2019-09-10 08:35:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513664 states to 513664 states and 734985 transitions. [2019-09-10 08:35:39,497 INFO L78 Accepts]: Start accepts. Automaton has 513664 states and 734985 transitions. Word has length 156 [2019-09-10 08:35:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:35:39,497 INFO L475 AbstractCegarLoop]: Abstraction has 513664 states and 734985 transitions. [2019-09-10 08:35:39,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:35:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 513664 states and 734985 transitions. [2019-09-10 08:35:39,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 08:35:39,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:35:39,514 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:35:39,514 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:35:39,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:35:39,515 INFO L82 PathProgramCache]: Analyzing trace with hash 220421659, now seen corresponding path program 1 times [2019-09-10 08:35:39,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:35:39,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:39,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:35:39,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:35:39,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:35:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:35:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:35:39,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:35:39,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:35:39,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:35:39,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:35:39,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:35:39,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:35:39,784 INFO L87 Difference]: Start difference. First operand 513664 states and 734985 transitions. Second operand 10 states. [2019-09-10 08:35:43,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:35:43,905 INFO L93 Difference]: Finished difference Result 966800 states and 1390737 transitions. [2019-09-10 08:35:43,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 08:35:43,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2019-09-10 08:35:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:35:45,163 INFO L225 Difference]: With dead ends: 966800 [2019-09-10 08:35:45,164 INFO L226 Difference]: Without dead ends: 966800 [2019-09-10 08:35:45,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:35:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966800 states. [2019-09-10 08:36:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966800 to 543872. [2019-09-10 08:36:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543872 states. [2019-09-10 08:36:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543872 states to 543872 states and 778633 transitions. [2019-09-10 08:36:04,401 INFO L78 Accepts]: Start accepts. Automaton has 543872 states and 778633 transitions. Word has length 156 [2019-09-10 08:36:04,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:36:04,401 INFO L475 AbstractCegarLoop]: Abstraction has 543872 states and 778633 transitions. [2019-09-10 08:36:04,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:36:04,401 INFO L276 IsEmpty]: Start isEmpty. Operand 543872 states and 778633 transitions. [2019-09-10 08:36:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 08:36:04,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:36:04,424 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:36:04,424 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:36:04,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:04,425 INFO L82 PathProgramCache]: Analyzing trace with hash -439871963, now seen corresponding path program 1 times [2019-09-10 08:36:04,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:36:04,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:04,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:04,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:36:04,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:36:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:36:04,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:36:04,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:36:04,749 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2019-09-10 08:36:04,749 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [188], [191], [196], [204], [206], [209], [217], [219], [222], [230], [232], [235], [243], [245], [248], [256], [258], [261], [269], [271], [274], [282], [284], [287], [295], [297], [300], [303], [307], [309], [312], [313], [315], [317], [322], [324], [327], [340], [342], [345], [348], [350], [365], [367], [370], [373], [375], [390], [392], [395], [398], [400], [415], [417], [420], [423], [425], [440], [442], [445], [448], [450], [465], [467], [470], [473], [475], [490], [492], [495], [498], [500], [515], [517], [519], [522], [525], [527], [598], [599], [603], [604], [605] [2019-09-10 08:36:04,752 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:36:04,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:36:04,786 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:36:05,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:36:05,587 INFO L272 AbstractInterpreter]: Visited 146 different actions 1579 times. Merged at 77 different actions 1236 times. Widened at 34 different actions 194 times. Performed 5611 root evaluator evaluations with a maximum evaluation depth of 10. Performed 5611 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 203 fixpoints after 32 different actions. Largest state had 197 variables. [2019-09-10 08:36:05,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:36:12,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:36:12,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:36:12,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:36:12,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:36:12,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:36:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:36:13,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:36:13,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:36:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:36:13,286 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:36:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:36:13,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:36:13,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 08:36:13,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:36:13,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:36:13,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:36:13,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:36:13,412 INFO L87 Difference]: Start difference. First operand 543872 states and 778633 transitions. Second operand 12 states. [2019-09-10 08:36:38,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:36:38,425 INFO L93 Difference]: Finished difference Result 3286543 states and 4599508 transitions. [2019-09-10 08:36:38,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 08:36:38,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2019-09-10 08:36:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:36:43,454 INFO L225 Difference]: With dead ends: 3286543 [2019-09-10 08:36:43,454 INFO L226 Difference]: Without dead ends: 3286543 [2019-09-10 08:36:43,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=713, Invalid=2947, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 08:36:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3286543 states. [2019-09-10 08:37:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3286543 to 1480421. [2019-09-10 08:37:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480421 states. [2019-09-10 08:37:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480421 states to 1480421 states and 2071613 transitions. [2019-09-10 08:37:48,124 INFO L78 Accepts]: Start accepts. Automaton has 1480421 states and 2071613 transitions. Word has length 157 [2019-09-10 08:37:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:37:48,124 INFO L475 AbstractCegarLoop]: Abstraction has 1480421 states and 2071613 transitions. [2019-09-10 08:37:48,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:37:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1480421 states and 2071613 transitions. [2019-09-10 08:37:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:37:48,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:37:48,146 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:37:48,147 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:37:48,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:48,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1586229160, now seen corresponding path program 1 times [2019-09-10 08:37:48,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:37:48,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:48,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:48,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:37:48,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:37:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:48,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:37:48,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:37:50,877 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-09-10 08:37:50,878 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [188], [191], [196], [199], [204], [206], [209], [212], [217], [219], [222], [230], [232], [235], [243], [245], [248], [256], [258], [261], [269], [271], [274], [282], [284], [287], [295], [297], [300], [307], [309], [312], [313], [315], [324], [327], [331], [340], [342], [345], [348], [350], [365], [367], [370], [373], [375], [390], [392], [395], [398], [400], [415], [417], [420], [423], [425], [440], [442], [445], [448], [450], [465], [467], [470], [473], [475], [483], [486], [492], [495], [498], [500], [508], [511], [517], [519], [522], [525], [527], [598], [599], [603], [604], [605] [2019-09-10 08:37:50,886 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:37:50,886 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:37:50,919 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:37:51,815 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:37:51,815 INFO L272 AbstractInterpreter]: Visited 148 different actions 1604 times. Merged at 80 different actions 1269 times. Widened at 33 different actions 241 times. Performed 5729 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5729 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 168 fixpoints after 28 different actions. Largest state had 197 variables. [2019-09-10 08:37:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:37:51,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:37:51,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:37:51,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:37:51,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:37:51,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:37:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:37:51,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:37:51,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:37:52,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:52,405 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:37:52,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:37:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:37:52,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:37:52,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2019-09-10 08:37:52,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:37:52,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:37:52,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:37:52,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:37:52,763 INFO L87 Difference]: Start difference. First operand 1480421 states and 2071613 transitions. Second operand 17 states. [2019-09-10 08:37:56,426 WARN L188 SmtUtils]: Spent 931.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-09-10 08:38:00,930 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:38:04,221 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 08:38:05,420 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44