java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:25:25,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:25:25,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:25:25,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:25:25,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:25:25,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:25:25,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:25:25,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:25:25,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:25:25,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:25:25,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:25:25,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:25:25,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:25:25,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:25:25,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:25:25,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:25:25,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:25:25,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:25:25,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:25:25,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:25:25,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:25:25,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:25:25,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:25:25,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:25:25,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:25:25,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:25:25,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:25:25,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:25:25,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:25:25,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:25:25,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:25:25,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:25:25,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:25:25,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:25:25,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:25:25,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:25:25,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:25:25,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:25:25,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:25:25,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:25:25,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:25:25,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:25:25,330 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:25:25,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:25:25,331 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:25:25,331 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:25:25,332 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:25:25,332 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:25:25,332 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:25:25,332 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:25:25,332 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:25:25,333 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:25:25,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:25:25,333 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:25:25,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:25:25,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:25:25,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:25:25,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:25:25,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:25:25,335 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:25:25,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:25:25,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:25:25,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:25:25,335 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:25:25,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:25:25,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:25:25,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:25:25,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:25:25,336 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:25:25,337 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:25:25,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:25:25,337 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:25:25,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:25:25,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:25:25,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:25:25,387 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:25:25,388 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:25:25,388 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:25:25,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ac65122/6e9a98e3126a45ee8d4c1c7a4304b9f5/FLAG695952d3f [2019-09-10 08:25:26,037 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:25:26,038 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:25:26,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ac65122/6e9a98e3126a45ee8d4c1c7a4304b9f5/FLAG695952d3f [2019-09-10 08:25:26,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ac65122/6e9a98e3126a45ee8d4c1c7a4304b9f5 [2019-09-10 08:25:26,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:25:26,339 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:25:26,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:25:26,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:25:26,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:25:26,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:25:26" (1/1) ... [2019-09-10 08:25:26,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744228c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:26, skipping insertion in model container [2019-09-10 08:25:26,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:25:26" (1/1) ... [2019-09-10 08:25:26,356 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:25:26,430 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:25:26,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:25:26,873 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:25:26,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:25:26,996 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:25:26,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:26 WrapperNode [2019-09-10 08:25:26,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:25:26,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:25:26,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:25:26,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:25:27,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:26" (1/1) ... [2019-09-10 08:25:27,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:26" (1/1) ... [2019-09-10 08:25:27,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:26" (1/1) ... [2019-09-10 08:25:27,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:26" (1/1) ... [2019-09-10 08:25:27,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:26" (1/1) ... [2019-09-10 08:25:27,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:26" (1/1) ... [2019-09-10 08:25:27,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:26" (1/1) ... [2019-09-10 08:25:27,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:25:27,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:25:27,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:25:27,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:25:27,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:25:27,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:25:27,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:25:27,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:25:27,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:25:27,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:25:27,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:25:27,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:25:27,142 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:25:27,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:25:27,142 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:25:27,142 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:25:27,142 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:25:27,142 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:25:27,143 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:25:27,143 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:25:27,143 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:25:27,143 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:25:27,143 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:25:27,144 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:25:27,144 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:25:27,144 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:25:27,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:25:27,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:25:27,924 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:25:27,925 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:25:27,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:25:27 BoogieIcfgContainer [2019-09-10 08:25:27,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:25:27,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:25:27,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:25:27,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:25:27,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:25:26" (1/3) ... [2019-09-10 08:25:27,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c86405f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:25:27, skipping insertion in model container [2019-09-10 08:25:27,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:25:26" (2/3) ... [2019-09-10 08:25:27,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c86405f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:25:27, skipping insertion in model container [2019-09-10 08:25:27,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:25:27" (3/3) ... [2019-09-10 08:25:27,935 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:25:27,945 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:25:27,955 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:25:27,970 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:25:27,992 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:25:27,992 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:25:27,992 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:25:27,992 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:25:27,992 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:25:27,993 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:25:27,993 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:25:27,993 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:25:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-09-10 08:25:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:25:28,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:28,024 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] [2019-09-10 08:25:28,026 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:28,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:28,031 INFO L82 PathProgramCache]: Analyzing trace with hash -134323180, now seen corresponding path program 1 times [2019-09-10 08:25:28,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:28,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:28,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:28,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:28,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:28,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:28,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:28,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:28,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:28,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:28,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:28,608 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-09-10 08:25:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:28,683 INFO L93 Difference]: Finished difference Result 221 states and 360 transitions. [2019-09-10 08:25:28,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:28,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 08:25:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:28,698 INFO L225 Difference]: With dead ends: 221 [2019-09-10 08:25:28,698 INFO L226 Difference]: Without dead ends: 213 [2019-09-10 08:25:28,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-10 08:25:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-09-10 08:25:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-10 08:25:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 302 transitions. [2019-09-10 08:25:28,755 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 302 transitions. Word has length 91 [2019-09-10 08:25:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:28,756 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 302 transitions. [2019-09-10 08:25:28,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 302 transitions. [2019-09-10 08:25:28,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:25:28,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:28,760 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] [2019-09-10 08:25:28,761 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:28,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:28,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1153087707, now seen corresponding path program 1 times [2019-09-10 08:25:28,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:28,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:28,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:28,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:28,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:28,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:28,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:28,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:28,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:28,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:28,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:28,979 INFO L87 Difference]: Start difference. First operand 211 states and 302 transitions. Second operand 3 states. [2019-09-10 08:25:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:29,041 INFO L93 Difference]: Finished difference Result 349 states and 519 transitions. [2019-09-10 08:25:29,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:29,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 08:25:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:29,048 INFO L225 Difference]: With dead ends: 349 [2019-09-10 08:25:29,049 INFO L226 Difference]: Without dead ends: 349 [2019-09-10 08:25:29,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:29,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-10 08:25:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2019-09-10 08:25:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-10 08:25:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 518 transitions. [2019-09-10 08:25:29,093 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 518 transitions. Word has length 92 [2019-09-10 08:25:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:29,093 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 518 transitions. [2019-09-10 08:25:29,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 518 transitions. [2019-09-10 08:25:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:25:29,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:29,105 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 08:25:29,106 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:29,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:29,106 INFO L82 PathProgramCache]: Analyzing trace with hash 453064733, now seen corresponding path program 1 times [2019-09-10 08:25:29,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:29,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:29,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:29,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:29,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:29,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:29,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:29,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:29,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:29,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:29,267 INFO L87 Difference]: Start difference. First operand 347 states and 518 transitions. Second operand 3 states. [2019-09-10 08:25:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:29,299 INFO L93 Difference]: Finished difference Result 605 states and 923 transitions. [2019-09-10 08:25:29,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:29,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 08:25:29,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:29,304 INFO L225 Difference]: With dead ends: 605 [2019-09-10 08:25:29,305 INFO L226 Difference]: Without dead ends: 605 [2019-09-10 08:25:29,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-10 08:25:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2019-09-10 08:25:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-10 08:25:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 922 transitions. [2019-09-10 08:25:29,344 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 922 transitions. Word has length 93 [2019-09-10 08:25:29,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:29,345 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 922 transitions. [2019-09-10 08:25:29,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:29,345 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 922 transitions. [2019-09-10 08:25:29,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:25:29,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:29,352 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 08:25:29,352 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:29,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:29,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1052328474, now seen corresponding path program 1 times [2019-09-10 08:25:29,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:29,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:29,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:29,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:29,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:29,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:29,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:29,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:29,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:29,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:29,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:29,517 INFO L87 Difference]: Start difference. First operand 603 states and 922 transitions. Second operand 3 states. [2019-09-10 08:25:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:29,546 INFO L93 Difference]: Finished difference Result 1085 states and 1675 transitions. [2019-09-10 08:25:29,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:29,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 08:25:29,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:29,559 INFO L225 Difference]: With dead ends: 1085 [2019-09-10 08:25:29,559 INFO L226 Difference]: Without dead ends: 1085 [2019-09-10 08:25:29,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:29,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-09-10 08:25:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1083. [2019-09-10 08:25:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-09-10 08:25:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1674 transitions. [2019-09-10 08:25:29,600 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1674 transitions. Word has length 94 [2019-09-10 08:25:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:29,602 INFO L475 AbstractCegarLoop]: Abstraction has 1083 states and 1674 transitions. [2019-09-10 08:25:29,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1674 transitions. [2019-09-10 08:25:29,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:25:29,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:29,606 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 08:25:29,607 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:29,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:29,608 INFO L82 PathProgramCache]: Analyzing trace with hash 178473406, now seen corresponding path program 1 times [2019-09-10 08:25:29,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:29,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:29,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:29,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:29,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:29,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:29,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:29,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:29,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:29,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:29,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:29,773 INFO L87 Difference]: Start difference. First operand 1083 states and 1674 transitions. Second operand 3 states. [2019-09-10 08:25:29,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:29,815 INFO L93 Difference]: Finished difference Result 1981 states and 3067 transitions. [2019-09-10 08:25:29,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:29,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 08:25:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:29,828 INFO L225 Difference]: With dead ends: 1981 [2019-09-10 08:25:29,829 INFO L226 Difference]: Without dead ends: 1981 [2019-09-10 08:25:29,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-09-10 08:25:29,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1979. [2019-09-10 08:25:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2019-09-10 08:25:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 3066 transitions. [2019-09-10 08:25:29,889 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 3066 transitions. Word has length 95 [2019-09-10 08:25:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:29,890 INFO L475 AbstractCegarLoop]: Abstraction has 1979 states and 3066 transitions. [2019-09-10 08:25:29,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 3066 transitions. [2019-09-10 08:25:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:25:29,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:29,891 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 08:25:29,892 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash -502513908, now seen corresponding path program 1 times [2019-09-10 08:25:29,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:29,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:29,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:29,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:29,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:29,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:29,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:29,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:29,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:29,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:29,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:29,992 INFO L87 Difference]: Start difference. First operand 1979 states and 3066 transitions. Second operand 3 states. [2019-09-10 08:25:30,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:30,047 INFO L93 Difference]: Finished difference Result 3645 states and 5627 transitions. [2019-09-10 08:25:30,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:30,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 08:25:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:30,069 INFO L225 Difference]: With dead ends: 3645 [2019-09-10 08:25:30,069 INFO L226 Difference]: Without dead ends: 3645 [2019-09-10 08:25:30,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:30,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2019-09-10 08:25:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 3643. [2019-09-10 08:25:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-10 08:25:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5626 transitions. [2019-09-10 08:25:30,206 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5626 transitions. Word has length 96 [2019-09-10 08:25:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:30,212 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5626 transitions. [2019-09-10 08:25:30,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5626 transitions. [2019-09-10 08:25:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:25:30,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:30,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:30,219 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:30,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1106092338, now seen corresponding path program 1 times [2019-09-10 08:25:30,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:30,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:30,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:30,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:30,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:30,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:30,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:25:30,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:30,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:25:30,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:25:30,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:25:30,368 INFO L87 Difference]: Start difference. First operand 3643 states and 5626 transitions. Second operand 5 states. [2019-09-10 08:25:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:30,568 INFO L93 Difference]: Finished difference Result 3643 states and 5594 transitions. [2019-09-10 08:25:30,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:25:30,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:25:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:30,590 INFO L225 Difference]: With dead ends: 3643 [2019-09-10 08:25:30,591 INFO L226 Difference]: Without dead ends: 3643 [2019-09-10 08:25:30,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:25:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-10 08:25:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-10 08:25:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-10 08:25:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5594 transitions. [2019-09-10 08:25:30,692 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5594 transitions. Word has length 97 [2019-09-10 08:25:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:30,692 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5594 transitions. [2019-09-10 08:25:30,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:25:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5594 transitions. [2019-09-10 08:25:30,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:25:30,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:30,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:30,694 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:30,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:30,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1467544083, now seen corresponding path program 1 times [2019-09-10 08:25:30,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:30,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:30,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:30,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:30,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:30,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:30,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:25:30,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:30,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:25:30,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:25:30,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:25:30,809 INFO L87 Difference]: Start difference. First operand 3643 states and 5594 transitions. Second operand 5 states. [2019-09-10 08:25:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:30,993 INFO L93 Difference]: Finished difference Result 3643 states and 5562 transitions. [2019-09-10 08:25:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:25:30,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:25:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:31,012 INFO L225 Difference]: With dead ends: 3643 [2019-09-10 08:25:31,013 INFO L226 Difference]: Without dead ends: 3643 [2019-09-10 08:25:31,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:25:31,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-10 08:25:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-10 08:25:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-10 08:25:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5562 transitions. [2019-09-10 08:25:31,118 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5562 transitions. Word has length 97 [2019-09-10 08:25:31,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:31,119 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5562 transitions. [2019-09-10 08:25:31,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:25:31,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5562 transitions. [2019-09-10 08:25:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:25:31,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:31,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:31,121 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash -193676078, now seen corresponding path program 1 times [2019-09-10 08:25:31,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:31,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:31,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:31,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:31,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:31,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:31,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:25:31,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:31,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:25:31,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:25:31,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:25:31,243 INFO L87 Difference]: Start difference. First operand 3643 states and 5562 transitions. Second operand 5 states. [2019-09-10 08:25:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:31,413 INFO L93 Difference]: Finished difference Result 3643 states and 5530 transitions. [2019-09-10 08:25:31,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:25:31,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:25:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:31,439 INFO L225 Difference]: With dead ends: 3643 [2019-09-10 08:25:31,440 INFO L226 Difference]: Without dead ends: 3643 [2019-09-10 08:25:31,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:25:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-10 08:25:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-10 08:25:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-10 08:25:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5530 transitions. [2019-09-10 08:25:31,564 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5530 transitions. Word has length 97 [2019-09-10 08:25:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:31,565 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5530 transitions. [2019-09-10 08:25:31,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:25:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5530 transitions. [2019-09-10 08:25:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:25:31,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:31,567 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:31,568 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:31,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:31,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1657747635, now seen corresponding path program 1 times [2019-09-10 08:25:31,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:31,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:31,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:31,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:31,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:31,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:31,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:25:31,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:31,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:25:31,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:25:31,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:25:31,767 INFO L87 Difference]: Start difference. First operand 3643 states and 5530 transitions. Second operand 5 states. [2019-09-10 08:25:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:31,985 INFO L93 Difference]: Finished difference Result 3643 states and 5498 transitions. [2019-09-10 08:25:31,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:25:31,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:25:31,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:32,049 INFO L225 Difference]: With dead ends: 3643 [2019-09-10 08:25:32,050 INFO L226 Difference]: Without dead ends: 3643 [2019-09-10 08:25:32,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:25:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-10 08:25:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-10 08:25:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-10 08:25:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5498 transitions. [2019-09-10 08:25:32,178 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5498 transitions. Word has length 97 [2019-09-10 08:25:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:32,179 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5498 transitions. [2019-09-10 08:25:32,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:25:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5498 transitions. [2019-09-10 08:25:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:25:32,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:32,181 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:32,182 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:32,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:32,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1190190066, now seen corresponding path program 1 times [2019-09-10 08:25:32,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:32,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:32,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:32,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:32,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:32,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:32,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:25:32,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:32,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:25:32,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:25:32,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:25:32,324 INFO L87 Difference]: Start difference. First operand 3643 states and 5498 transitions. Second operand 5 states. [2019-09-10 08:25:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:32,481 INFO L93 Difference]: Finished difference Result 3643 states and 5466 transitions. [2019-09-10 08:25:32,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:25:32,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:25:32,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:32,517 INFO L225 Difference]: With dead ends: 3643 [2019-09-10 08:25:32,517 INFO L226 Difference]: Without dead ends: 3643 [2019-09-10 08:25:32,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:25:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-10 08:25:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-10 08:25:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-10 08:25:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5466 transitions. [2019-09-10 08:25:32,588 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5466 transitions. Word has length 97 [2019-09-10 08:25:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:32,589 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5466 transitions. [2019-09-10 08:25:32,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:25:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5466 transitions. [2019-09-10 08:25:32,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:25:32,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:32,590 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:32,590 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:32,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:32,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1777392041, now seen corresponding path program 1 times [2019-09-10 08:25:32,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:32,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:32,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:32,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:32,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:32,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:32,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:32,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:32,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:32,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:32,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:32,822 INFO L87 Difference]: Start difference. First operand 3643 states and 5466 transitions. Second operand 9 states. [2019-09-10 08:25:33,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:33,551 INFO L93 Difference]: Finished difference Result 46675 states and 69606 transitions. [2019-09-10 08:25:33,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:25:33,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:25:33,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:33,684 INFO L225 Difference]: With dead ends: 46675 [2019-09-10 08:25:33,684 INFO L226 Difference]: Without dead ends: 46675 [2019-09-10 08:25:33,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:25:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46675 states. [2019-09-10 08:25:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46675 to 10811. [2019-09-10 08:25:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10811 states. [2019-09-10 08:25:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10811 states to 10811 states and 16154 transitions. [2019-09-10 08:25:34,304 INFO L78 Accepts]: Start accepts. Automaton has 10811 states and 16154 transitions. Word has length 97 [2019-09-10 08:25:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:34,304 INFO L475 AbstractCegarLoop]: Abstraction has 10811 states and 16154 transitions. [2019-09-10 08:25:34,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 10811 states and 16154 transitions. [2019-09-10 08:25:34,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:25:34,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:34,306 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:34,306 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:34,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:34,307 INFO L82 PathProgramCache]: Analyzing trace with hash 430043314, now seen corresponding path program 1 times [2019-09-10 08:25:34,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:34,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:34,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:34,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:34,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:34,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:34,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:34,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:34,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:34,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:34,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:34,412 INFO L87 Difference]: Start difference. First operand 10811 states and 16154 transitions. Second operand 3 states. [2019-09-10 08:25:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:34,503 INFO L93 Difference]: Finished difference Result 17277 states and 25307 transitions. [2019-09-10 08:25:34,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:34,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 08:25:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:34,554 INFO L225 Difference]: With dead ends: 17277 [2019-09-10 08:25:34,555 INFO L226 Difference]: Without dead ends: 17277 [2019-09-10 08:25:34,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17277 states. [2019-09-10 08:25:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17277 to 17147. [2019-09-10 08:25:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17147 states. [2019-09-10 08:25:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17147 states to 17147 states and 25178 transitions. [2019-09-10 08:25:34,885 INFO L78 Accepts]: Start accepts. Automaton has 17147 states and 25178 transitions. Word has length 99 [2019-09-10 08:25:34,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:34,886 INFO L475 AbstractCegarLoop]: Abstraction has 17147 states and 25178 transitions. [2019-09-10 08:25:34,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 17147 states and 25178 transitions. [2019-09-10 08:25:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:25:34,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:34,888 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:34,888 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:34,888 INFO L82 PathProgramCache]: Analyzing trace with hash 450092657, now seen corresponding path program 1 times [2019-09-10 08:25:34,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:34,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:34,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:34,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:34,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:35,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:35,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:25:35,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:35,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:35,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:35,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:25:35,782 INFO L87 Difference]: Start difference. First operand 17147 states and 25178 transitions. Second operand 9 states. [2019-09-10 08:25:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:36,224 INFO L93 Difference]: Finished difference Result 30657 states and 44765 transitions. [2019-09-10 08:25:36,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:25:36,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:25:36,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:36,285 INFO L225 Difference]: With dead ends: 30657 [2019-09-10 08:25:36,285 INFO L226 Difference]: Without dead ends: 30657 [2019-09-10 08:25:36,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:25:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30657 states. [2019-09-10 08:25:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30657 to 30651. [2019-09-10 08:25:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30651 states. [2019-09-10 08:25:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30651 states to 30651 states and 44762 transitions. [2019-09-10 08:25:36,869 INFO L78 Accepts]: Start accepts. Automaton has 30651 states and 44762 transitions. Word has length 99 [2019-09-10 08:25:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:36,870 INFO L475 AbstractCegarLoop]: Abstraction has 30651 states and 44762 transitions. [2019-09-10 08:25:36,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 30651 states and 44762 transitions. [2019-09-10 08:25:36,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:25:36,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:36,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:36,872 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:36,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:36,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1066061208, now seen corresponding path program 1 times [2019-09-10 08:25:36,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:36,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:36,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:36,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:36,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:36,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:36,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:25:36,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:36,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:25:36,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:25:36,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:25:36,984 INFO L87 Difference]: Start difference. First operand 30651 states and 44762 transitions. Second operand 5 states. [2019-09-10 08:25:37,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:37,179 INFO L93 Difference]: Finished difference Result 56188 states and 81416 transitions. [2019-09-10 08:25:37,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:25:37,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-10 08:25:37,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:37,264 INFO L225 Difference]: With dead ends: 56188 [2019-09-10 08:25:37,265 INFO L226 Difference]: Without dead ends: 56188 [2019-09-10 08:25:37,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:25:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56188 states. [2019-09-10 08:25:37,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56188 to 31419. [2019-09-10 08:25:37,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31419 states. [2019-09-10 08:25:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31419 states to 31419 states and 45466 transitions. [2019-09-10 08:25:37,972 INFO L78 Accepts]: Start accepts. Automaton has 31419 states and 45466 transitions. Word has length 100 [2019-09-10 08:25:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:37,972 INFO L475 AbstractCegarLoop]: Abstraction has 31419 states and 45466 transitions. [2019-09-10 08:25:37,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:25:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 31419 states and 45466 transitions. [2019-09-10 08:25:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:25:37,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:37,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:37,974 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:37,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:37,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2144763645, now seen corresponding path program 1 times [2019-09-10 08:25:37,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:37,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:37,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:38,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:38,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:25:38,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:38,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:25:38,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:25:38,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:38,053 INFO L87 Difference]: Start difference. First operand 31419 states and 45466 transitions. Second operand 3 states. [2019-09-10 08:25:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:38,184 INFO L93 Difference]: Finished difference Result 46783 states and 67389 transitions. [2019-09-10 08:25:38,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:25:38,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 08:25:38,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:38,242 INFO L225 Difference]: With dead ends: 46783 [2019-09-10 08:25:38,243 INFO L226 Difference]: Without dead ends: 46783 [2019-09-10 08:25:38,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:25:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46783 states. [2019-09-10 08:25:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46783 to 46781. [2019-09-10 08:25:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46781 states. [2019-09-10 08:25:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46781 states to 46781 states and 67388 transitions. [2019-09-10 08:25:39,658 INFO L78 Accepts]: Start accepts. Automaton has 46781 states and 67388 transitions. Word has length 100 [2019-09-10 08:25:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:39,659 INFO L475 AbstractCegarLoop]: Abstraction has 46781 states and 67388 transitions. [2019-09-10 08:25:39,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:25:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 46781 states and 67388 transitions. [2019-09-10 08:25:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:25:39,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:39,676 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:39,677 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:39,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1614271803, now seen corresponding path program 1 times [2019-09-10 08:25:39,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:39,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:39,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:39,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:39,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:39,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:25:39,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:25:39,850 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:25:39,852 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [173], [176], [179], [184], [186], [189], [197], [199], [202], [210], [212], [215], [223], [225], [228], [236], [238], [241], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [294], [296], [299], [302], [304], [319], [321], [324], [327], [329], [344], [346], [349], [352], [354], [369], [371], [374], [377], [379], [394], [396], [399], [402], [404], [412], [415], [421], [424], [427], [429], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:25:39,902 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:25:39,902 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:25:40,103 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:25:41,056 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:25:41,059 INFO L272 AbstractInterpreter]: Visited 122 different actions 974 times. Merged at 65 different actions 744 times. Widened at 26 different actions 105 times. Performed 3680 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3680 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 98 fixpoints after 23 different actions. Largest state had 175 variables. [2019-09-10 08:25:41,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:41,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:25:41,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:25:41,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:25:41,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:41,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:25:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:41,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:25:41,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:25:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:25:41,673 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:25:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-10 08:25:41,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:25:41,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:25:41,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:41,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:41,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:41,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:25:41,844 INFO L87 Difference]: Start difference. First operand 46781 states and 67388 transitions. Second operand 9 states. [2019-09-10 08:25:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:42,942 INFO L93 Difference]: Finished difference Result 236555 states and 339427 transitions. [2019-09-10 08:25:42,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:25:42,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:25:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:44,101 INFO L225 Difference]: With dead ends: 236555 [2019-09-10 08:25:44,101 INFO L226 Difference]: Without dead ends: 236555 [2019-09-10 08:25:44,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:25:44,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236555 states. [2019-09-10 08:25:48,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236555 to 76797. [2019-09-10 08:25:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76797 states. [2019-09-10 08:25:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76797 states to 76797 states and 110044 transitions. [2019-09-10 08:25:48,315 INFO L78 Accepts]: Start accepts. Automaton has 76797 states and 110044 transitions. Word has length 135 [2019-09-10 08:25:48,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:48,315 INFO L475 AbstractCegarLoop]: Abstraction has 76797 states and 110044 transitions. [2019-09-10 08:25:48,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 76797 states and 110044 transitions. [2019-09-10 08:25:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:25:48,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:48,332 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:48,333 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:48,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2110676875, now seen corresponding path program 1 times [2019-09-10 08:25:48,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:48,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:48,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:48,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:48,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:25:48,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:25:48,481 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:25:48,481 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [173], [176], [184], [186], [189], [192], [197], [199], [202], [210], [212], [215], [223], [225], [228], [236], [238], [241], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [294], [296], [299], [302], [304], [319], [321], [324], [327], [329], [344], [346], [349], [352], [354], [369], [371], [374], [377], [379], [387], [390], [396], [399], [402], [404], [419], [421], [424], [427], [429], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:25:48,490 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:25:48,490 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:25:48,530 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:25:49,215 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:25:49,215 INFO L272 AbstractInterpreter]: Visited 122 different actions 1030 times. Merged at 63 different actions 789 times. Widened at 26 different actions 125 times. Performed 3779 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3779 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 95 fixpoints after 18 different actions. Largest state had 175 variables. [2019-09-10 08:25:49,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:49,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:25:49,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:25:49,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:25:49,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:49,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:25:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:49,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:25:49,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:25:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:25:49,616 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:25:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:25:50,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:25:50,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:25:50,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:50,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:50,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:25:50,033 INFO L87 Difference]: Start difference. First operand 76797 states and 110044 transitions. Second operand 9 states. [2019-09-10 08:25:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:50,610 INFO L93 Difference]: Finished difference Result 156427 states and 223779 transitions. [2019-09-10 08:25:50,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:25:50,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:25:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:50,854 INFO L225 Difference]: With dead ends: 156427 [2019-09-10 08:25:50,854 INFO L226 Difference]: Without dead ends: 156427 [2019-09-10 08:25:50,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:25:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156427 states. [2019-09-10 08:25:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156427 to 96701. [2019-09-10 08:25:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96701 states. [2019-09-10 08:25:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96701 states to 96701 states and 138332 transitions. [2019-09-10 08:25:52,571 INFO L78 Accepts]: Start accepts. Automaton has 96701 states and 138332 transitions. Word has length 135 [2019-09-10 08:25:52,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:52,571 INFO L475 AbstractCegarLoop]: Abstraction has 96701 states and 138332 transitions. [2019-09-10 08:25:52,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:52,571 INFO L276 IsEmpty]: Start isEmpty. Operand 96701 states and 138332 transitions. [2019-09-10 08:25:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:25:52,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:52,587 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:52,588 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:52,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1788947165, now seen corresponding path program 1 times [2019-09-10 08:25:52,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:52,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:52,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:52,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:25:52,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:25:52,726 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:25:52,727 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [173], [176], [184], [186], [189], [197], [199], [202], [210], [212], [215], [223], [225], [228], [231], [236], [238], [241], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [294], [296], [299], [302], [304], [312], [315], [321], [324], [327], [329], [344], [346], [349], [352], [354], [369], [371], [374], [377], [379], [394], [396], [399], [402], [404], [419], [421], [424], [427], [429], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:25:52,731 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:25:52,731 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:25:52,760 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:25:53,474 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:25:53,474 INFO L272 AbstractInterpreter]: Visited 122 different actions 1028 times. Merged at 65 different actions 790 times. Widened at 28 different actions 151 times. Performed 3808 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3808 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 96 fixpoints after 26 different actions. Largest state had 175 variables. [2019-09-10 08:25:53,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:53,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:25:53,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:25:53,475 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) [2019-09-10 08:25:53,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:53,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:25:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:53,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:25:53,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:25:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 08:25:53,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:25:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:25:55,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:25:55,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:25:55,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:55,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:55,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:55,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:25:55,895 INFO L87 Difference]: Start difference. First operand 96701 states and 138332 transitions. Second operand 9 states. [2019-09-10 08:25:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:56,449 INFO L93 Difference]: Finished difference Result 176331 states and 252067 transitions. [2019-09-10 08:25:56,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:25:56,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:25:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:56,655 INFO L225 Difference]: With dead ends: 176331 [2019-09-10 08:25:56,655 INFO L226 Difference]: Without dead ends: 176331 [2019-09-10 08:25:56,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:25:56,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176331 states. [2019-09-10 08:25:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176331 to 116605. [2019-09-10 08:25:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116605 states. [2019-09-10 08:25:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116605 states to 116605 states and 166620 transitions. [2019-09-10 08:25:58,285 INFO L78 Accepts]: Start accepts. Automaton has 116605 states and 166620 transitions. Word has length 135 [2019-09-10 08:25:58,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:58,286 INFO L475 AbstractCegarLoop]: Abstraction has 116605 states and 166620 transitions. [2019-09-10 08:25:58,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:25:58,286 INFO L276 IsEmpty]: Start isEmpty. Operand 116605 states and 166620 transitions. [2019-09-10 08:25:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:25:58,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:58,300 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:58,300 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:58,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1812692387, now seen corresponding path program 1 times [2019-09-10 08:25:58,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:58,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:58,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:58,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:58,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:58,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:25:58,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:25:58,436 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:25:58,437 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [173], [176], [184], [186], [189], [197], [199], [202], [210], [212], [215], [223], [225], [228], [236], [238], [241], [244], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [287], [290], [296], [299], [302], [304], [319], [321], [324], [327], [329], [344], [346], [349], [352], [354], [369], [371], [374], [377], [379], [394], [396], [399], [402], [404], [419], [421], [424], [427], [429], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:25:58,440 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:25:58,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:25:58,474 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:25:59,059 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:25:59,060 INFO L272 AbstractInterpreter]: Visited 122 different actions 983 times. Merged at 65 different actions 752 times. Widened at 27 different actions 109 times. Performed 3524 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3524 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 90 fixpoints after 25 different actions. Largest state had 175 variables. [2019-09-10 08:25:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:59,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:25:59,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:25:59,060 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 08:25:59,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:59,076 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 08:25:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:59,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:25:59,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:25:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:25:59,436 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:25:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 08:25:59,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:25:59,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:25:59,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:59,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:25:59,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:25:59,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:25:59,918 INFO L87 Difference]: Start difference. First operand 116605 states and 166620 transitions. Second operand 9 states. [2019-09-10 08:26:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:00,449 INFO L93 Difference]: Finished difference Result 196233 states and 280354 transitions. [2019-09-10 08:26:00,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:26:00,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:26:00,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:00,672 INFO L225 Difference]: With dead ends: 196233 [2019-09-10 08:26:00,672 INFO L226 Difference]: Without dead ends: 196233 [2019-09-10 08:26:00,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:26:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196233 states. [2019-09-10 08:26:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196233 to 136509. [2019-09-10 08:26:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136509 states. [2019-09-10 08:26:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136509 states to 136509 states and 194908 transitions. [2019-09-10 08:26:04,575 INFO L78 Accepts]: Start accepts. Automaton has 136509 states and 194908 transitions. Word has length 135 [2019-09-10 08:26:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:04,576 INFO L475 AbstractCegarLoop]: Abstraction has 136509 states and 194908 transitions. [2019-09-10 08:26:04,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 136509 states and 194908 transitions. [2019-09-10 08:26:04,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:26:04,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:04,586 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:04,586 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:04,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:04,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1416421271, now seen corresponding path program 1 times [2019-09-10 08:26:04,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:04,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:04,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:04,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:04,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:04,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:26:04,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:26:04,728 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:26:04,729 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [173], [176], [184], [186], [189], [197], [199], [202], [210], [212], [215], [218], [223], [225], [228], [236], [238], [241], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [294], [296], [299], [302], [304], [319], [321], [324], [327], [329], [337], [340], [346], [349], [352], [354], [369], [371], [374], [377], [379], [394], [396], [399], [402], [404], [419], [421], [424], [427], [429], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:26:04,746 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:26:04,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:26:04,790 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:26:05,399 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:26:05,400 INFO L272 AbstractInterpreter]: Visited 122 different actions 937 times. Merged at 65 different actions 712 times. Widened at 26 different actions 111 times. Performed 3434 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3434 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 88 fixpoints after 22 different actions. Largest state had 175 variables. [2019-09-10 08:26:05,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:05,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:26:05,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:26:05,401 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 08:26:05,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:05,428 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 08:26:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:05,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:26:05,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:26:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:26:05,758 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:26:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:26:05,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:26:05,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:26:05,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:05,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:05,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:05,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:26:05,902 INFO L87 Difference]: Start difference. First operand 136509 states and 194908 transitions. Second operand 9 states. [2019-09-10 08:26:06,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:06,536 INFO L93 Difference]: Finished difference Result 216139 states and 308643 transitions. [2019-09-10 08:26:06,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:26:06,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:26:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:07,447 INFO L225 Difference]: With dead ends: 216139 [2019-09-10 08:26:07,447 INFO L226 Difference]: Without dead ends: 216139 [2019-09-10 08:26:07,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:26:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216139 states. [2019-09-10 08:26:12,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216139 to 156413. [2019-09-10 08:26:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156413 states. [2019-09-10 08:26:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156413 states to 156413 states and 223196 transitions. [2019-09-10 08:26:12,606 INFO L78 Accepts]: Start accepts. Automaton has 156413 states and 223196 transitions. Word has length 135 [2019-09-10 08:26:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:12,607 INFO L475 AbstractCegarLoop]: Abstraction has 156413 states and 223196 transitions. [2019-09-10 08:26:12,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 156413 states and 223196 transitions. [2019-09-10 08:26:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:26:12,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:12,619 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:12,619 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:12,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:12,619 INFO L82 PathProgramCache]: Analyzing trace with hash -495936559, now seen corresponding path program 1 times [2019-09-10 08:26:12,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:12,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:12,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:12,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:12,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:12,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:26:12,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:26:12,738 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:26:12,738 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [173], [176], [184], [186], [189], [197], [199], [202], [205], [210], [212], [215], [223], [225], [228], [236], [238], [241], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [294], [296], [299], [302], [304], [319], [321], [324], [327], [329], [344], [346], [349], [352], [354], [362], [365], [371], [374], [377], [379], [394], [396], [399], [402], [404], [419], [421], [424], [427], [429], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:26:12,740 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:26:12,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:26:12,770 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:26:13,509 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:26:13,510 INFO L272 AbstractInterpreter]: Visited 122 different actions 1017 times. Merged at 65 different actions 781 times. Widened at 28 different actions 136 times. Performed 3783 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3783 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 99 fixpoints after 21 different actions. Largest state had 175 variables. [2019-09-10 08:26:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:13,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:26:13,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:26:13,510 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) [2019-09-10 08:26:13,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:13,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:26:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:13,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:26:13,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:26:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:26:13,839 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:26:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:26:13,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:26:13,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:26:13,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:13,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:13,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:13,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:26:13,955 INFO L87 Difference]: Start difference. First operand 156413 states and 223196 transitions. Second operand 9 states. [2019-09-10 08:26:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:14,594 INFO L93 Difference]: Finished difference Result 236043 states and 336931 transitions. [2019-09-10 08:26:14,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:26:14,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 08:26:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:14,892 INFO L225 Difference]: With dead ends: 236043 [2019-09-10 08:26:14,892 INFO L226 Difference]: Without dead ends: 236043 [2019-09-10 08:26:14,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:26:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236043 states. [2019-09-10 08:26:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236043 to 176317. [2019-09-10 08:26:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176317 states. [2019-09-10 08:26:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176317 states to 176317 states and 251484 transitions. [2019-09-10 08:26:17,487 INFO L78 Accepts]: Start accepts. Automaton has 176317 states and 251484 transitions. Word has length 135 [2019-09-10 08:26:17,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:17,487 INFO L475 AbstractCegarLoop]: Abstraction has 176317 states and 251484 transitions. [2019-09-10 08:26:17,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 176317 states and 251484 transitions. [2019-09-10 08:26:17,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:26:17,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:17,504 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:17,504 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:17,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:17,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1796801820, now seen corresponding path program 1 times [2019-09-10 08:26:17,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:17,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:17,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:17,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:17,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:26:17,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:17,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:26:17,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:17,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:26:17,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:26:17,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:26:17,709 INFO L87 Difference]: Start difference. First operand 176317 states and 251484 transitions. Second operand 9 states. [2019-09-10 08:26:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:19,330 INFO L93 Difference]: Finished difference Result 276747 states and 396707 transitions. [2019-09-10 08:26:19,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:26:19,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-10 08:26:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:19,707 INFO L225 Difference]: With dead ends: 276747 [2019-09-10 08:26:19,707 INFO L226 Difference]: Without dead ends: 276747 [2019-09-10 08:26:19,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:26:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276747 states. [2019-09-10 08:26:25,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276747 to 183101. [2019-09-10 08:26:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183101 states. [2019-09-10 08:26:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183101 states to 183101 states and 261340 transitions. [2019-09-10 08:26:26,132 INFO L78 Accepts]: Start accepts. Automaton has 183101 states and 261340 transitions. Word has length 136 [2019-09-10 08:26:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:26,133 INFO L475 AbstractCegarLoop]: Abstraction has 183101 states and 261340 transitions. [2019-09-10 08:26:26,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:26:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 183101 states and 261340 transitions. [2019-09-10 08:26:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:26:26,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:26,149 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:26,149 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:26,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:26,149 INFO L82 PathProgramCache]: Analyzing trace with hash 658413086, now seen corresponding path program 1 times [2019-09-10 08:26:26,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:26,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:26,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:26,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:26,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:26,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:26:26,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:26:26,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:26:26,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:26:26,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:26:26,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:26:26,228 INFO L87 Difference]: Start difference. First operand 183101 states and 261340 transitions. Second operand 3 states. [2019-09-10 08:26:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:26,552 INFO L93 Difference]: Finished difference Result 129009 states and 184504 transitions. [2019-09-10 08:26:26,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:26:26,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-10 08:26:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:26,689 INFO L225 Difference]: With dead ends: 129009 [2019-09-10 08:26:26,689 INFO L226 Difference]: Without dead ends: 129009 [2019-09-10 08:26:26,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:26:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129009 states. [2019-09-10 08:26:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129009 to 129007. [2019-09-10 08:26:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129007 states. [2019-09-10 08:26:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129007 states to 129007 states and 184503 transitions. [2019-09-10 08:26:27,899 INFO L78 Accepts]: Start accepts. Automaton has 129007 states and 184503 transitions. Word has length 137 [2019-09-10 08:26:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:27,900 INFO L475 AbstractCegarLoop]: Abstraction has 129007 states and 184503 transitions. [2019-09-10 08:26:27,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:26:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 129007 states and 184503 transitions. [2019-09-10 08:26:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 08:26:27,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:27,911 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:27,911 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:27,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:27,911 INFO L82 PathProgramCache]: Analyzing trace with hash -99959780, now seen corresponding path program 1 times [2019-09-10 08:26:27,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:27,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:27,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:29,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:26:29,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:26:29,006 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2019-09-10 08:26:29,006 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [158], [163], [171], [173], [176], [184], [186], [189], [197], [199], [202], [210], [212], [215], [223], [225], [228], [236], [238], [241], [249], [251], [254], [257], [261], [263], [266], [267], [269], [271], [276], [278], [281], [294], [296], [299], [302], [304], [319], [321], [324], [327], [329], [344], [346], [349], [352], [354], [369], [371], [374], [377], [379], [394], [396], [399], [402], [404], [419], [421], [424], [427], [429], [444], [446], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:26:29,008 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:26:29,008 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:26:29,036 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:26:29,908 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:26:29,909 INFO L272 AbstractInterpreter]: Visited 127 different actions 1283 times. Merged at 69 different actions 997 times. Widened at 30 different actions 167 times. Performed 4516 root evaluator evaluations with a maximum evaluation depth of 9. Performed 4516 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 165 fixpoints after 26 different actions. Largest state had 175 variables. [2019-09-10 08:26:29,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:29,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:26:29,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:26:29,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:26:29,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:29,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:26:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:30,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:26:30,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:26:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:26:30,229 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:26:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:26:30,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:26:30,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 08:26:30,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:26:30,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:26:30,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:26:30,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:26:30,347 INFO L87 Difference]: Start difference. First operand 129007 states and 184503 transitions. Second operand 12 states. [2019-09-10 08:26:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:41,074 INFO L93 Difference]: Finished difference Result 788456 states and 1098420 transitions. [2019-09-10 08:26:41,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 08:26:41,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-09-10 08:26:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:42,079 INFO L225 Difference]: With dead ends: 788456 [2019-09-10 08:26:42,080 INFO L226 Difference]: Without dead ends: 788456 [2019-09-10 08:26:42,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=713, Invalid=2947, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 08:26:42,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788456 states. [2019-09-10 08:26:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788456 to 356797. [2019-09-10 08:26:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356797 states. [2019-09-10 08:26:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356797 states to 356797 states and 497997 transitions. [2019-09-10 08:26:48,313 INFO L78 Accepts]: Start accepts. Automaton has 356797 states and 497997 transitions. Word has length 137 [2019-09-10 08:26:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:48,313 INFO L475 AbstractCegarLoop]: Abstraction has 356797 states and 497997 transitions. [2019-09-10 08:26:48,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:26:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 356797 states and 497997 transitions. [2019-09-10 08:26:48,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 08:26:48,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:48,322 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:26:48,322 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:48,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:48,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2084830737, now seen corresponding path program 1 times [2019-09-10 08:26:48,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:48,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:48,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:48,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:48,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:48,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:26:48,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:26:48,574 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 139 with the following transitions: [2019-09-10 08:26:48,574 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [155], [158], [163], [166], [171], [173], [176], [179], [184], [186], [189], [197], [199], [202], [210], [212], [215], [223], [225], [228], [236], [238], [241], [249], [251], [254], [261], [263], [266], [267], [269], [278], [281], [285], [294], [296], [299], [302], [304], [319], [321], [324], [327], [329], [344], [346], [349], [352], [354], [369], [371], [374], [377], [379], [394], [396], [399], [402], [404], [412], [415], [421], [424], [427], [429], [437], [440], [446], [448], [451], [454], [456], [516], [517], [521], [522], [523] [2019-09-10 08:26:48,577 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:26:48,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:26:48,606 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:26:49,629 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:26:49,630 INFO L272 AbstractInterpreter]: Visited 129 different actions 1313 times. Merged at 72 different actions 1032 times. Widened at 28 different actions 152 times. Performed 4638 root evaluator evaluations with a maximum evaluation depth of 7. Performed 4638 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 134 fixpoints after 26 different actions. Largest state had 175 variables. [2019-09-10 08:26:49,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:49,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:26:49,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:26:49,631 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:26:49,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:49,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:26:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:49,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:26:49,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:26:49,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:50,226 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:26:50,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:50,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:26:50,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2019-09-10 08:26:50,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:26:50,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:26:50,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:26:50,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:26:50,605 INFO L87 Difference]: Start difference. First operand 356797 states and 497997 transitions. Second operand 17 states. [2019-09-10 08:26:58,865 WARN L188 SmtUtils]: Spent 3.67 s on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-10 08:27:08,923 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:27:19,477 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:27:20,672 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:28:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:13,919 INFO L93 Difference]: Finished difference Result 6785108 states and 9336308 transitions. [2019-09-10 08:28:13,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2019-09-10 08:28:13,919 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 138 [2019-09-10 08:28:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:40,191 INFO L225 Difference]: With dead ends: 6785108 [2019-09-10 08:28:40,191 INFO L226 Difference]: Without dead ends: 6785108 [2019-09-10 08:28:40,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32025 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=9156, Invalid=65646, Unknown=0, NotChecked=0, Total=74802 [2019-09-10 08:28:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6785108 states.