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/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:20:49,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:20:49,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:20:49,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:20:49,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:20:49,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:20:49,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:20:49,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:20:49,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:20:49,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:20:49,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:20:49,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:20:49,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:20:49,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:20:49,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:20:49,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:20:49,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:20:49,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:20:49,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:20:49,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:20:49,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:20:49,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:20:49,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:20:49,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:20:49,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:20:49,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:20:49,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:20:49,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:20:49,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:20:49,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:20:49,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:20:49,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:20:49,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:20:49,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:20:49,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:20:49,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:20:49,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:20:49,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:20:49,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:20:49,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:20:49,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:20:49,928 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 04:20:49,952 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:20:49,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:20:49,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:20:49,953 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:20:49,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:20:49,954 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:20:49,954 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:20:49,954 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:20:49,954 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:20:49,955 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:20:49,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:20:49,955 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:20:49,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:20:49,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:20:49,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:20:49,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:20:49,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:20:49,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:20:49,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:20:49,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:20:49,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:20:49,957 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:20:49,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:20:49,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:20:49,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:20:49,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:20:49,958 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:20:49,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:20:49,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:20:49,959 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:20:49,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:20:50,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:20:50,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:20:50,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:20:50,014 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:20:50,014 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c [2019-09-10 04:20:50,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b159e900f/8273c74ccd5c4c1ba372f1ee44730ed0/FLAG1d5da736f [2019-09-10 04:20:50,508 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:20:50,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c [2019-09-10 04:20:50,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b159e900f/8273c74ccd5c4c1ba372f1ee44730ed0/FLAG1d5da736f [2019-09-10 04:20:50,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b159e900f/8273c74ccd5c4c1ba372f1ee44730ed0 [2019-09-10 04:20:50,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:20:50,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:20:50,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:20:50,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:20:50,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:20:50,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:20:50" (1/1) ... [2019-09-10 04:20:50,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@307d2cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:50, skipping insertion in model container [2019-09-10 04:20:50,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:20:50" (1/1) ... [2019-09-10 04:20:50,908 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:20:50,968 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:20:51,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:20:51,396 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:20:51,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:20:51,480 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:20:51,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:51 WrapperNode [2019-09-10 04:20:51,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:20:51,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:20:51,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:20:51,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:20:51,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:51" (1/1) ... [2019-09-10 04:20:51,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:51" (1/1) ... [2019-09-10 04:20:51,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:51" (1/1) ... [2019-09-10 04:20:51,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:51" (1/1) ... [2019-09-10 04:20:51,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:51" (1/1) ... [2019-09-10 04:20:51,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:51" (1/1) ... [2019-09-10 04:20:51,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:51" (1/1) ... [2019-09-10 04:20:51,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:20:51,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:20:51,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:20:51,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:20:51,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:51" (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 04:20:51,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:20:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:20:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:20:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:20:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:20:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:20:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:20:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:20:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:20:51,616 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:20:51,616 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:20:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:20:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:20:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:20:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:20:51,617 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:20:51,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:20:51,617 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:20:51,617 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:20:51,617 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:20:51,617 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:20:51,617 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:20:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:20:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:20:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:20:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:20:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:20:51,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:20:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:20:52,404 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:20:52,404 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:20:52,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:20:52 BoogieIcfgContainer [2019-09-10 04:20:52,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:20:52,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:20:52,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:20:52,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:20:52,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:20:50" (1/3) ... [2019-09-10 04:20:52,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1857dde1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:20:52, skipping insertion in model container [2019-09-10 04:20:52,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:20:51" (2/3) ... [2019-09-10 04:20:52,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1857dde1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:20:52, skipping insertion in model container [2019-09-10 04:20:52,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:20:52" (3/3) ... [2019-09-10 04:20:52,415 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c [2019-09-10 04:20:52,425 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:20:52,434 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:20:52,452 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:20:52,480 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:20:52,480 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:20:52,480 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:20:52,481 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:20:52,481 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:20:52,481 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:20:52,481 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:20:52,482 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:20:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-10 04:20:52,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 04:20:52,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:20:52,518 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] [2019-09-10 04:20:52,520 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:20:52,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:20:52,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1245616469, now seen corresponding path program 1 times [2019-09-10 04:20:52,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:20:52,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:52,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:20:52,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:52,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:20:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:20:52,966 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 04:20:52,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:20:52,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:20:52,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:20:52,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:20:52,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:20:52,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:20:53,000 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-09-10 04:20:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:20:53,164 INFO L93 Difference]: Finished difference Result 153 states and 233 transitions. [2019-09-10 04:20:53,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:20:53,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-09-10 04:20:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:20:53,179 INFO L225 Difference]: With dead ends: 153 [2019-09-10 04:20:53,179 INFO L226 Difference]: Without dead ends: 149 [2019-09-10 04:20:53,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 04:20:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-10 04:20:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-09-10 04:20:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-10 04:20:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 198 transitions. [2019-09-10 04:20:53,232 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 198 transitions. Word has length 62 [2019-09-10 04:20:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:20:53,232 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 198 transitions. [2019-09-10 04:20:53,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:20:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 198 transitions. [2019-09-10 04:20:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:20:53,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:20:53,238 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] [2019-09-10 04:20:53,239 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:20:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:20:53,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1850604190, now seen corresponding path program 1 times [2019-09-10 04:20:53,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:20:53,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:53,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:20:53,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:53,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:20:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:20:53,675 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 04:20:53,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:20:53,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:20:53,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:20:53,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:20:53,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:20:53,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:20:53,678 INFO L87 Difference]: Start difference. First operand 149 states and 198 transitions. Second operand 13 states. [2019-09-10 04:20:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:20:59,661 INFO L93 Difference]: Finished difference Result 1323 states and 1998 transitions. [2019-09-10 04:20:59,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 04:20:59,662 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-10 04:20:59,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:20:59,679 INFO L225 Difference]: With dead ends: 1323 [2019-09-10 04:20:59,680 INFO L226 Difference]: Without dead ends: 1323 [2019-09-10 04:20:59,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=618, Invalid=2034, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 04:20:59,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2019-09-10 04:20:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1108. [2019-09-10 04:20:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2019-09-10 04:20:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1637 transitions. [2019-09-10 04:20:59,836 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1637 transitions. Word has length 93 [2019-09-10 04:20:59,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:20:59,836 INFO L475 AbstractCegarLoop]: Abstraction has 1108 states and 1637 transitions. [2019-09-10 04:20:59,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:20:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1637 transitions. [2019-09-10 04:20:59,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 04:20:59,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:20:59,845 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] [2019-09-10 04:20:59,845 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:20:59,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:20:59,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1299803518, now seen corresponding path program 1 times [2019-09-10 04:20:59,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:20:59,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:59,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:20:59,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:59,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:20:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:00,038 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 04:21:00,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:00,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:21:00,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:00,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:21:00,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:21:00,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:21:00,040 INFO L87 Difference]: Start difference. First operand 1108 states and 1637 transitions. Second operand 11 states. [2019-09-10 04:21:00,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:00,179 INFO L93 Difference]: Finished difference Result 1262 states and 1887 transitions. [2019-09-10 04:21:00,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:21:00,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-09-10 04:21:00,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:00,188 INFO L225 Difference]: With dead ends: 1262 [2019-09-10 04:21:00,188 INFO L226 Difference]: Without dead ends: 1262 [2019-09-10 04:21:00,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:21:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-09-10 04:21:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1180. [2019-09-10 04:21:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-09-10 04:21:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1709 transitions. [2019-09-10 04:21:00,242 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1709 transitions. Word has length 94 [2019-09-10 04:21:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:00,243 INFO L475 AbstractCegarLoop]: Abstraction has 1180 states and 1709 transitions. [2019-09-10 04:21:00,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:21:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1709 transitions. [2019-09-10 04:21:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:21:00,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:00,251 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] [2019-09-10 04:21:00,251 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:00,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:00,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1310130058, now seen corresponding path program 1 times [2019-09-10 04:21:00,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:00,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:00,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:00,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:00,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:00,488 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 04:21:00,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:00,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:21:00,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:00,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:21:00,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:21:00,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:21:00,490 INFO L87 Difference]: Start difference. First operand 1180 states and 1709 transitions. Second operand 5 states. [2019-09-10 04:21:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:01,193 INFO L93 Difference]: Finished difference Result 3149 states and 4600 transitions. [2019-09-10 04:21:01,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:21:01,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 04:21:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:01,211 INFO L225 Difference]: With dead ends: 3149 [2019-09-10 04:21:01,211 INFO L226 Difference]: Without dead ends: 3149 [2019-09-10 04:21:01,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:21:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2019-09-10 04:21:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3106. [2019-09-10 04:21:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3106 states. [2019-09-10 04:21:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 4549 transitions. [2019-09-10 04:21:01,313 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 4549 transitions. Word has length 95 [2019-09-10 04:21:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:01,313 INFO L475 AbstractCegarLoop]: Abstraction has 3106 states and 4549 transitions. [2019-09-10 04:21:01,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:21:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 4549 transitions. [2019-09-10 04:21:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:21:01,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:01,318 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:01,319 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:01,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1927996876, now seen corresponding path program 1 times [2019-09-10 04:21:01,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:01,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:01,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:01,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:01,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:01,425 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 04:21:01,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:01,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:21:01,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:01,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:21:01,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:21:01,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:21:01,427 INFO L87 Difference]: Start difference. First operand 3106 states and 4549 transitions. Second operand 5 states. [2019-09-10 04:21:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:02,251 INFO L93 Difference]: Finished difference Result 4202 states and 6088 transitions. [2019-09-10 04:21:02,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:21:02,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-10 04:21:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:02,278 INFO L225 Difference]: With dead ends: 4202 [2019-09-10 04:21:02,279 INFO L226 Difference]: Without dead ends: 4202 [2019-09-10 04:21:02,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:21:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2019-09-10 04:21:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 4200. [2019-09-10 04:21:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4200 states. [2019-09-10 04:21:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4200 states to 4200 states and 6087 transitions. [2019-09-10 04:21:02,435 INFO L78 Accepts]: Start accepts. Automaton has 4200 states and 6087 transitions. Word has length 96 [2019-09-10 04:21:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:02,437 INFO L475 AbstractCegarLoop]: Abstraction has 4200 states and 6087 transitions. [2019-09-10 04:21:02,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:21:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 4200 states and 6087 transitions. [2019-09-10 04:21:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:21:02,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:02,440 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] [2019-09-10 04:21:02,440 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:02,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:02,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1775175999, now seen corresponding path program 1 times [2019-09-10 04:21:02,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:02,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:02,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:02,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:02,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:21:02,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:02,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:21:02,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:02,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:21:02,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:21:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:02,577 INFO L87 Difference]: Start difference. First operand 4200 states and 6087 transitions. Second operand 9 states. [2019-09-10 04:21:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:03,472 INFO L93 Difference]: Finished difference Result 6552 states and 9573 transitions. [2019-09-10 04:21:03,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:21:03,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 04:21:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:03,507 INFO L225 Difference]: With dead ends: 6552 [2019-09-10 04:21:03,507 INFO L226 Difference]: Without dead ends: 6552 [2019-09-10 04:21:03,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:21:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2019-09-10 04:21:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 4224. [2019-09-10 04:21:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4224 states. [2019-09-10 04:21:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4224 states to 4224 states and 6120 transitions. [2019-09-10 04:21:03,656 INFO L78 Accepts]: Start accepts. Automaton has 4224 states and 6120 transitions. Word has length 96 [2019-09-10 04:21:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:03,656 INFO L475 AbstractCegarLoop]: Abstraction has 4224 states and 6120 transitions. [2019-09-10 04:21:03,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:21:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4224 states and 6120 transitions. [2019-09-10 04:21:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:21:03,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:03,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:03,662 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:03,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash -922068117, now seen corresponding path program 1 times [2019-09-10 04:21:03,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:03,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:03,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:03,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:03,771 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 04:21:03,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:03,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:21:03,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:03,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:21:03,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:21:03,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:03,773 INFO L87 Difference]: Start difference. First operand 4224 states and 6120 transitions. Second operand 9 states. [2019-09-10 04:21:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:04,668 INFO L93 Difference]: Finished difference Result 5893 states and 8542 transitions. [2019-09-10 04:21:04,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:21:04,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 04:21:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:04,706 INFO L225 Difference]: With dead ends: 5893 [2019-09-10 04:21:04,707 INFO L226 Difference]: Without dead ends: 5887 [2019-09-10 04:21:04,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:21:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5887 states. [2019-09-10 04:21:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5887 to 4241. [2019-09-10 04:21:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4241 states. [2019-09-10 04:21:04,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4241 states to 4241 states and 6144 transitions. [2019-09-10 04:21:04,857 INFO L78 Accepts]: Start accepts. Automaton has 4241 states and 6144 transitions. Word has length 96 [2019-09-10 04:21:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:04,857 INFO L475 AbstractCegarLoop]: Abstraction has 4241 states and 6144 transitions. [2019-09-10 04:21:04,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:21:04,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4241 states and 6144 transitions. [2019-09-10 04:21:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:21:04,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:04,861 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] [2019-09-10 04:21:04,861 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:04,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:04,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1378419157, now seen corresponding path program 1 times [2019-09-10 04:21:04,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:04,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:04,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:04,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:04,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:04,992 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 04:21:04,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:04,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:21:04,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:04,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:21:04,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:21:04,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:04,995 INFO L87 Difference]: Start difference. First operand 4241 states and 6144 transitions. Second operand 9 states. [2019-09-10 04:21:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:05,736 INFO L93 Difference]: Finished difference Result 5211 states and 7492 transitions. [2019-09-10 04:21:05,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:21:05,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 04:21:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:05,771 INFO L225 Difference]: With dead ends: 5211 [2019-09-10 04:21:05,771 INFO L226 Difference]: Without dead ends: 5205 [2019-09-10 04:21:05,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:21:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2019-09-10 04:21:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 4258. [2019-09-10 04:21:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4258 states. [2019-09-10 04:21:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4258 states to 4258 states and 6168 transitions. [2019-09-10 04:21:05,914 INFO L78 Accepts]: Start accepts. Automaton has 4258 states and 6168 transitions. Word has length 96 [2019-09-10 04:21:05,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:05,915 INFO L475 AbstractCegarLoop]: Abstraction has 4258 states and 6168 transitions. [2019-09-10 04:21:05,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:21:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4258 states and 6168 transitions. [2019-09-10 04:21:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:21:05,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:05,917 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] [2019-09-10 04:21:05,917 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:05,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:05,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1891830763, now seen corresponding path program 1 times [2019-09-10 04:21:05,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:05,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:05,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:06,075 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 04:21:06,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:21:06,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:21:06,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:06,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:21:06,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:21:06,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:06,077 INFO L87 Difference]: Start difference. First operand 4258 states and 6168 transitions. Second operand 9 states. [2019-09-10 04:21:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:07,088 INFO L93 Difference]: Finished difference Result 4517 states and 6434 transitions. [2019-09-10 04:21:07,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:21:07,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 04:21:07,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:07,108 INFO L225 Difference]: With dead ends: 4517 [2019-09-10 04:21:07,108 INFO L226 Difference]: Without dead ends: 4511 [2019-09-10 04:21:07,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:21:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states. [2019-09-10 04:21:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 4275. [2019-09-10 04:21:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-09-10 04:21:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6192 transitions. [2019-09-10 04:21:07,208 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6192 transitions. Word has length 96 [2019-09-10 04:21:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:07,209 INFO L475 AbstractCegarLoop]: Abstraction has 4275 states and 6192 transitions. [2019-09-10 04:21:07,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:21:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6192 transitions. [2019-09-10 04:21:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 04:21:07,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:07,215 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:07,215 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:07,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:07,216 INFO L82 PathProgramCache]: Analyzing trace with hash 140940638, now seen corresponding path program 1 times [2019-09-10 04:21:07,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:07,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:07,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:07,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 04:21:07,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:07,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:21:07,328 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-09-10 04:21:07,331 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], [193], [194], [195], [197], [206], [212], [214], [221], [224], [227], [229], [234], [239], [240], [241], [244], [249], [251], [273], [275], [277], [289], [301], [303], [305], [306], [309], [331], [333], [363], [364], [367], [389], [391], [421], [422], [425], [447], [449], [479], [480], [481], [482], [485], [507], [509], [539], [540], [543], [545], [548], [550], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [572] [2019-09-10 04:21:07,466 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:21:07,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:21:07,653 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:21:08,228 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:21:08,233 INFO L272 AbstractInterpreter]: Visited 104 different actions 238 times. Merged at 15 different actions 36 times. Never widened. Performed 2841 root evaluator evaluations with a maximum evaluation depth of 7. Performed 2841 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 6 fixpoints after 3 different actions. Largest state had 128 variables. [2019-09-10 04:21:08,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:08,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:21:08,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:08,240 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) [2019-09-10 04:21:08,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:08,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:21:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:08,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:21:08,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:21:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 04:21:08,526 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:21:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:21:08,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:21:08,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:21:08,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:08,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:21:08,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:21:08,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:08,655 INFO L87 Difference]: Start difference. First operand 4275 states and 6192 transitions. Second operand 5 states. [2019-09-10 04:21:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:09,305 INFO L93 Difference]: Finished difference Result 7945 states and 11401 transitions. [2019-09-10 04:21:09,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:21:09,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-10 04:21:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:09,340 INFO L225 Difference]: With dead ends: 7945 [2019-09-10 04:21:09,341 INFO L226 Difference]: Without dead ends: 7945 [2019-09-10 04:21:09,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:21:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7945 states. [2019-09-10 04:21:09,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7945 to 7940. [2019-09-10 04:21:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7940 states. [2019-09-10 04:21:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7940 states to 7940 states and 11397 transitions. [2019-09-10 04:21:09,637 INFO L78 Accepts]: Start accepts. Automaton has 7940 states and 11397 transitions. Word has length 147 [2019-09-10 04:21:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:09,638 INFO L475 AbstractCegarLoop]: Abstraction has 7940 states and 11397 transitions. [2019-09-10 04:21:09,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:21:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7940 states and 11397 transitions. [2019-09-10 04:21:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:21:09,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:09,645 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:09,646 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:09,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1505128413, now seen corresponding path program 1 times [2019-09-10 04:21:09,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:09,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:09,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:09,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:09,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 04:21:09,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:09,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:21:09,800 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-10 04:21:09,800 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], [193], [194], [195], [197], [206], [212], [214], [221], [224], [227], [229], [234], [239], [240], [241], [244], [249], [251], [273], [275], [277], [289], [301], [303], [305], [306], [309], [331], [333], [363], [364], [367], [389], [391], [421], [422], [425], [447], [449], [451], [463], [475], [477], [479], [480], [481], [482], [485], [507], [509], [539], [540], [543], [545], [548], [550], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [572] [2019-09-10 04:21:09,813 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:21:09,814 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:21:09,843 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:21:10,477 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:21:10,478 INFO L272 AbstractInterpreter]: Visited 108 different actions 344 times. Merged at 17 different actions 63 times. Never widened. Performed 4205 root evaluator evaluations with a maximum evaluation depth of 7. Performed 4205 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 12 fixpoints after 5 different actions. Largest state had 128 variables. [2019-09-10 04:21:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:10,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:21:10,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:10,479 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 04:21:10,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:10,505 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 04:21:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:10,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:21:10,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:21:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 04:21:10,783 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:21:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 04:21:10,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:21:10,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:21:10,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:10,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:21:10,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:21:10,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:10,896 INFO L87 Difference]: Start difference. First operand 7940 states and 11397 transitions. Second operand 5 states. [2019-09-10 04:21:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:11,479 INFO L93 Difference]: Finished difference Result 14776 states and 20979 transitions. [2019-09-10 04:21:11,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:21:11,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-09-10 04:21:11,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:11,537 INFO L225 Difference]: With dead ends: 14776 [2019-09-10 04:21:11,538 INFO L226 Difference]: Without dead ends: 14776 [2019-09-10 04:21:11,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 292 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:21:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14776 states. [2019-09-10 04:21:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14776 to 14771. [2019-09-10 04:21:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14771 states. [2019-09-10 04:21:11,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14771 states to 14771 states and 20975 transitions. [2019-09-10 04:21:11,931 INFO L78 Accepts]: Start accepts. Automaton has 14771 states and 20975 transitions. Word has length 148 [2019-09-10 04:21:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:11,932 INFO L475 AbstractCegarLoop]: Abstraction has 14771 states and 20975 transitions. [2019-09-10 04:21:11,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:21:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 14771 states and 20975 transitions. [2019-09-10 04:21:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 04:21:11,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:11,942 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:11,942 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:11,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:11,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1208108126, now seen corresponding path program 1 times [2019-09-10 04:21:11,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:11,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:11,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:11,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:11,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 04:21:12,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:12,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:21:12,137 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2019-09-10 04:21:12,138 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], [193], [194], [195], [197], [206], [212], [214], [221], [224], [227], [229], [234], [239], [240], [241], [244], [249], [251], [273], [275], [277], [289], [301], [303], [305], [306], [309], [331], [333], [363], [364], [367], [389], [391], [421], [422], [425], [447], [449], [451], [463], [475], [477], [479], [480], [481], [482], [485], [507], [509], [511], [523], [535], [537], [539], [540], [543], [545], [548], [550], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [572] [2019-09-10 04:21:12,141 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:21:12,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:21:12,164 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:21:12,710 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:21:12,711 INFO L272 AbstractInterpreter]: Visited 112 different actions 449 times. Merged at 19 different actions 92 times. Never widened. Performed 5628 root evaluator evaluations with a maximum evaluation depth of 7. Performed 5628 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 20 fixpoints after 6 different actions. Largest state had 128 variables. [2019-09-10 04:21:12,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:12,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:21:12,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:12,712 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 04:21:12,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:12,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:21:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:12,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:21:12,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:21:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:21:12,923 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:21:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:21:13,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:21:13,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:21:13,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:13,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:21:13,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:21:13,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:13,035 INFO L87 Difference]: Start difference. First operand 14771 states and 20975 transitions. Second operand 5 states. [2019-09-10 04:21:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:13,736 INFO L93 Difference]: Finished difference Result 27411 states and 38447 transitions. [2019-09-10 04:21:13,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:21:13,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-09-10 04:21:13,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:13,854 INFO L225 Difference]: With dead ends: 27411 [2019-09-10 04:21:13,855 INFO L226 Difference]: Without dead ends: 27411 [2019-09-10 04:21:13,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:21:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27411 states. [2019-09-10 04:21:14,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27411 to 27406. [2019-09-10 04:21:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27406 states. [2019-09-10 04:21:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27406 states to 27406 states and 38443 transitions. [2019-09-10 04:21:14,437 INFO L78 Accepts]: Start accepts. Automaton has 27406 states and 38443 transitions. Word has length 149 [2019-09-10 04:21:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:14,437 INFO L475 AbstractCegarLoop]: Abstraction has 27406 states and 38443 transitions. [2019-09-10 04:21:14,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:21:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 27406 states and 38443 transitions. [2019-09-10 04:21:14,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 04:21:14,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:14,448 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:21:14,449 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:14,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:14,449 INFO L82 PathProgramCache]: Analyzing trace with hash 301245131, now seen corresponding path program 1 times [2019-09-10 04:21:14,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:14,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:14,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:14,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:14,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 04:21:14,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:14,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:21:14,548 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2019-09-10 04:21:14,549 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], [193], [194], [195], [197], [206], [212], [214], [221], [224], [227], [229], [234], [239], [240], [241], [244], [249], [251], [273], [275], [277], [289], [301], [303], [305], [306], [309], [331], [333], [335], [347], [359], [361], [363], [364], [367], [389], [391], [421], [422], [425], [447], [449], [451], [463], [475], [477], [479], [480], [481], [482], [485], [507], [509], [511], [523], [535], [537], [539], [540], [543], [545], [548], [550], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [572] [2019-09-10 04:21:14,556 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:21:14,556 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:21:15,255 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:21:16,227 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:21:16,228 INFO L272 AbstractInterpreter]: Visited 116 different actions 520 times. Merged at 21 different actions 113 times. Never widened. Performed 6208 root evaluator evaluations with a maximum evaluation depth of 7. Performed 6208 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 28 fixpoints after 7 different actions. Largest state had 128 variables. [2019-09-10 04:21:16,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:16,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:21:16,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:16,229 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) [2019-09-10 04:21:16,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:16,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:21:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:16,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:21:16,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:21:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 04:21:16,434 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:21:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 04:21:16,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:21:16,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:21:16,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:16,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:21:16,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:21:16,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:21:16,556 INFO L87 Difference]: Start difference. First operand 27406 states and 38443 transitions. Second operand 5 states. [2019-09-10 04:21:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:17,224 INFO L93 Difference]: Finished difference Result 50576 states and 69970 transitions. [2019-09-10 04:21:17,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:21:17,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 04:21:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:17,410 INFO L225 Difference]: With dead ends: 50576 [2019-09-10 04:21:17,411 INFO L226 Difference]: Without dead ends: 50576 [2019-09-10 04:21:17,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:21:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50576 states. [2019-09-10 04:21:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50576 to 50571. [2019-09-10 04:21:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50571 states. [2019-09-10 04:21:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50571 states to 50571 states and 69966 transitions. [2019-09-10 04:21:18,716 INFO L78 Accepts]: Start accepts. Automaton has 50571 states and 69966 transitions. Word has length 150 [2019-09-10 04:21:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:18,717 INFO L475 AbstractCegarLoop]: Abstraction has 50571 states and 69966 transitions. [2019-09-10 04:21:18,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:21:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 50571 states and 69966 transitions. [2019-09-10 04:21:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 04:21:18,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:18,732 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:21:18,732 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash 762532196, now seen corresponding path program 1 times [2019-09-10 04:21:18,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:18,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:18,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 04:21:19,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:19,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:21:19,026 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2019-09-10 04:21:19,026 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], [193], [194], [195], [197], [206], [212], [214], [221], [224], [227], [229], [234], [239], [240], [241], [244], [249], [251], [273], [275], [277], [289], [301], [303], [305], [306], [309], [331], [333], [335], [347], [359], [361], [363], [364], [367], [389], [391], [393], [405], [417], [419], [421], [422], [425], [447], [449], [451], [463], [475], [477], [479], [480], [481], [482], [485], [507], [509], [511], [523], [535], [537], [539], [540], [543], [545], [548], [550], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [572] [2019-09-10 04:21:19,029 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:21:19,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:21:19,055 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:21:19,804 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:21:19,804 INFO L272 AbstractInterpreter]: Visited 120 different actions 614 times. Merged at 23 different actions 146 times. Never widened. Performed 6960 root evaluator evaluations with a maximum evaluation depth of 7. Performed 6960 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 39 fixpoints after 7 different actions. Largest state had 128 variables. [2019-09-10 04:21:19,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:19,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:21:19,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:19,805 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) [2019-09-10 04:21:19,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:19,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:21:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:19,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:21:19,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:21:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 04:21:21,220 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:21:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 04:21:21,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:21:21,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 12] total 20 [2019-09-10 04:21:21,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:21,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:21:21,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:21:21,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-09-10 04:21:21,599 INFO L87 Difference]: Start difference. First operand 50571 states and 69966 transitions. Second operand 11 states. [2019-09-10 04:21:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:38,090 INFO L93 Difference]: Finished difference Result 1106602 states and 1503020 transitions. [2019-09-10 04:21:38,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 04:21:38,090 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2019-09-10 04:21:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:42,135 INFO L225 Difference]: With dead ends: 1106602 [2019-09-10 04:21:42,135 INFO L226 Difference]: Without dead ends: 1106602 [2019-09-10 04:21:42,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 278 SyntacticMatches, 17 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=502, Invalid=1220, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 04:21:49,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106602 states. [2019-09-10 04:22:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106602 to 1106158. [2019-09-10 04:22:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106158 states. [2019-09-10 04:22:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106158 states to 1106158 states and 1502542 transitions. [2019-09-10 04:22:44,900 INFO L78 Accepts]: Start accepts. Automaton has 1106158 states and 1502542 transitions. Word has length 151 [2019-09-10 04:22:44,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:22:44,900 INFO L475 AbstractCegarLoop]: Abstraction has 1106158 states and 1502542 transitions. [2019-09-10 04:22:44,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:22:44,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1106158 states and 1502542 transitions. [2019-09-10 04:22:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 04:22:45,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:22:45,084 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:22:45,085 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:22:45,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:22:45,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1215951500, now seen corresponding path program 1 times [2019-09-10 04:22:45,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:22:45,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:22:45,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:22:45,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:22:45,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:22:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:22:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 04:22:45,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:22:45,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:22:45,462 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 153 with the following transitions: [2019-09-10 04:22:45,463 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], [193], [194], [195], [197], [206], [212], [214], [221], [224], [227], [229], [234], [239], [240], [241], [244], [249], [251], [273], [275], [277], [289], [301], [303], [305], [306], [309], [331], [333], [335], [347], [359], [361], [363], [364], [367], [389], [391], [393], [405], [417], [419], [421], [422], [425], [447], [449], [451], [454], [457], [461], [477], [479], [480], [481], [482], [485], [507], [509], [511], [523], [535], [537], [539], [540], [543], [545], [548], [550], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [572] [2019-09-10 04:22:45,466 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:22:45,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:22:45,485 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:22:46,411 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:22:46,412 INFO L272 AbstractInterpreter]: Visited 121 different actions 865 times. Merged at 23 different actions 207 times. Never widened. Performed 9860 root evaluator evaluations with a maximum evaluation depth of 7. Performed 9860 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 55 fixpoints after 9 different actions. Largest state had 128 variables. [2019-09-10 04:22:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:22:46,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:22:46,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:22:46,412 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 04:22:46,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:22:46,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:22:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:22:46,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 04:22:46,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:22:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 04:22:46,821 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:22:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 04:22:47,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:22:47,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 6, 7] total 30 [2019-09-10 04:22:47,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:22:47,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 04:22:47,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 04:22:47,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2019-09-10 04:22:47,120 INFO L87 Difference]: Start difference. First operand 1106158 states and 1502542 transitions. Second operand 25 states. [2019-09-10 04:23:04,898 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32