java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:13:49,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:13:49,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:13:49,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:13:49,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:13:49,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:13:49,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:13:49,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:13:49,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:13:49,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:13:49,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:13:49,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:13:49,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:13:49,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:13:49,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:13:49,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:13:49,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:13:49,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:13:49,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:13:49,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:13:49,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:13:49,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:13:49,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:13:49,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:13:49,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:13:49,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:13:49,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:13:49,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:13:49,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:13:49,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:13:49,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:13:49,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:13:49,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:13:49,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:13:49,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:13:49,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:13:49,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:13:49,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:13:49,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:13:49,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:13:49,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:13:49,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 04:13:49,922 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:13:49,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:13:49,923 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:13:49,924 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:13:49,924 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:13:49,925 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:13:49,925 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:13:49,925 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:13:49,925 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:13:49,926 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:13:49,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:13:49,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:13:49,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:13:49,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:13:49,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:13:49,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:13:49,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:13:49,930 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:13:49,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:13:49,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:13:49,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:13:49,931 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:13:49,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:13:49,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:13:49,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:13:49,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:13:49,932 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:13:49,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:13:49,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:13:49,933 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:13:49,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:13:50,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:13:50,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:13:50,012 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:13:50,013 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:13:50,014 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2019-09-10 04:13:50,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a0e6a56/b1d6ea92c17949daa12d7b23770c6f2a/FLAG9bb779011 [2019-09-10 04:13:50,607 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:13:50,608 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2019-09-10 04:13:50,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a0e6a56/b1d6ea92c17949daa12d7b23770c6f2a/FLAG9bb779011 [2019-09-10 04:13:50,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a0e6a56/b1d6ea92c17949daa12d7b23770c6f2a [2019-09-10 04:13:50,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:13:50,944 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:13:50,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:13:50,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:13:50,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:13:50,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:13:50" (1/1) ... [2019-09-10 04:13:50,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7414b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:13:50, skipping insertion in model container [2019-09-10 04:13:50,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:13:50" (1/1) ... [2019-09-10 04:13:50,960 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:13:51,006 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:13:51,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:13:51,387 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:13:51,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:13:51,465 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:13:51,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:13:51 WrapperNode [2019-09-10 04:13:51,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:13:51,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:13:51,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:13:51,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:13:51,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:13:51" (1/1) ... [2019-09-10 04:13:51,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:13:51" (1/1) ... [2019-09-10 04:13:51,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:13:51" (1/1) ... [2019-09-10 04:13:51,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:13:51" (1/1) ... [2019-09-10 04:13:51,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:13:51" (1/1) ... [2019-09-10 04:13:51,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:13:51" (1/1) ... [2019-09-10 04:13:51,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:13:51" (1/1) ... [2019-09-10 04:13:51,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:13:51,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:13:51,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:13:51,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:13:51,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:13:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:13:51,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:13:51,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:13:51,593 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:13:51,593 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:13:51,593 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:13:51,593 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:13:51,593 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:13:51,594 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:13:51,594 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:13:51,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:13:51,594 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:13:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:13:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:13:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:13:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:13:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:13:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:13:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:13:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:13:51,596 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:13:51,596 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:13:51,596 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:13:51,596 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:13:51,596 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:13:51,596 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:13:51,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:13:51,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:13:51,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:13:52,370 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:13:52,371 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:13:52,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:13:52 BoogieIcfgContainer [2019-09-10 04:13:52,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:13:52,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:13:52,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:13:52,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:13:52,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:13:50" (1/3) ... [2019-09-10 04:13:52,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136564a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:13:52, skipping insertion in model container [2019-09-10 04:13:52,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:13:51" (2/3) ... [2019-09-10 04:13:52,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136564a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:13:52, skipping insertion in model container [2019-09-10 04:13:52,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:13:52" (3/3) ... [2019-09-10 04:13:52,381 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2019-09-10 04:13:52,391 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:13:52,400 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:13:52,414 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:13:52,436 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:13:52,436 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:13:52,436 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:13:52,437 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:13:52,437 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:13:52,437 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:13:52,437 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:13:52,437 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:13:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-09-10 04:13:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 04:13:52,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:13:52,474 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] [2019-09-10 04:13:52,477 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:13:52,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:13:52,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1830124153, now seen corresponding path program 1 times [2019-09-10 04:13:52,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:13:52,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:52,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:13:52,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:52,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:13:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:13:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:13:52,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:13:52,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:13:52,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:13:52,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:13:52,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:13:52,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:13:52,915 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 5 states. [2019-09-10 04:13:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:13:53,068 INFO L93 Difference]: Finished difference Result 157 states and 236 transitions. [2019-09-10 04:13:53,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:13:53,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-10 04:13:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:13:53,084 INFO L225 Difference]: With dead ends: 157 [2019-09-10 04:13:53,084 INFO L226 Difference]: Without dead ends: 148 [2019-09-10 04:13:53,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:13:53,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-10 04:13:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-09-10 04:13:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-10 04:13:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 196 transitions. [2019-09-10 04:13:53,138 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 196 transitions. Word has length 61 [2019-09-10 04:13:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:13:53,139 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 196 transitions. [2019-09-10 04:13:53,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:13:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 196 transitions. [2019-09-10 04:13:53,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 04:13:53,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:13:53,145 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 04:13:53,146 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:13:53,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:13:53,149 INFO L82 PathProgramCache]: Analyzing trace with hash -101399106, now seen corresponding path program 1 times [2019-09-10 04:13:53,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:13:53,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:53,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:13:53,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:53,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:13:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:13:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:13:53,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:13:53,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:13:53,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:13:53,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:13:53,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:13:53,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:13:53,623 INFO L87 Difference]: Start difference. First operand 148 states and 196 transitions. Second operand 13 states. [2019-09-10 04:14:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:00,207 INFO L93 Difference]: Finished difference Result 1320 states and 1984 transitions. [2019-09-10 04:14:00,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 04:14:00,207 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 92 [2019-09-10 04:14:00,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:00,227 INFO L225 Difference]: With dead ends: 1320 [2019-09-10 04:14:00,228 INFO L226 Difference]: Without dead ends: 1320 [2019-09-10 04:14:00,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=618, Invalid=2034, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 04:14:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2019-09-10 04:14:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1098. [2019-09-10 04:14:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2019-09-10 04:14:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1617 transitions. [2019-09-10 04:14:00,378 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1617 transitions. Word has length 92 [2019-09-10 04:14:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:14:00,379 INFO L475 AbstractCegarLoop]: Abstraction has 1098 states and 1617 transitions. [2019-09-10 04:14:00,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:14:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1617 transitions. [2019-09-10 04:14:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:14:00,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:14:00,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:14:00,387 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:14:00,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:00,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1626399125, now seen corresponding path program 1 times [2019-09-10 04:14:00,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:14:00,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:00,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:00,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:00,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:14:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:14:00,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:14:00,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:14:00,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:14:00,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:14:00,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:14:00,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:14:00,587 INFO L87 Difference]: Start difference. First operand 1098 states and 1617 transitions. Second operand 11 states. [2019-09-10 04:14:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:00,746 INFO L93 Difference]: Finished difference Result 1260 states and 1875 transitions. [2019-09-10 04:14:00,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:14:00,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2019-09-10 04:14:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:00,757 INFO L225 Difference]: With dead ends: 1260 [2019-09-10 04:14:00,758 INFO L226 Difference]: Without dead ends: 1260 [2019-09-10 04:14:00,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:14:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-09-10 04:14:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1170. [2019-09-10 04:14:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2019-09-10 04:14:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1689 transitions. [2019-09-10 04:14:00,823 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1689 transitions. Word has length 93 [2019-09-10 04:14:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:14:00,824 INFO L475 AbstractCegarLoop]: Abstraction has 1170 states and 1689 transitions. [2019-09-10 04:14:00,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:14:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1689 transitions. [2019-09-10 04:14:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 04:14:00,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:14:00,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:14:00,830 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:14:00,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:00,831 INFO L82 PathProgramCache]: Analyzing trace with hash -76774090, now seen corresponding path program 1 times [2019-09-10 04:14:00,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:14:00,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:00,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:00,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:00,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:14:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:14:01,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:14:01,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:14:01,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:14:01,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:14:01,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:14:01,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:14:01,062 INFO L87 Difference]: Start difference. First operand 1170 states and 1689 transitions. Second operand 7 states. [2019-09-10 04:14:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:02,293 INFO L93 Difference]: Finished difference Result 4054 states and 5954 transitions. [2019-09-10 04:14:02,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:14:02,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-09-10 04:14:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:02,317 INFO L225 Difference]: With dead ends: 4054 [2019-09-10 04:14:02,317 INFO L226 Difference]: Without dead ends: 4054 [2019-09-10 04:14:02,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-10 04:14:02,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4054 states. [2019-09-10 04:14:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4054 to 4048. [2019-09-10 04:14:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4048 states. [2019-09-10 04:14:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 5951 transitions. [2019-09-10 04:14:02,460 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 5951 transitions. Word has length 94 [2019-09-10 04:14:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:14:02,461 INFO L475 AbstractCegarLoop]: Abstraction has 4048 states and 5951 transitions. [2019-09-10 04:14:02,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:14:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 5951 transitions. [2019-09-10 04:14:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:14:02,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:14:02,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:14:02,468 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:14:02,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:02,469 INFO L82 PathProgramCache]: Analyzing trace with hash 976113655, now seen corresponding path program 1 times [2019-09-10 04:14:02,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:14:02,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:02,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:02,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:02,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:14:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:14:02,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:14:02,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:14:02,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:14:02,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:14:02,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:14:02,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:14:02,621 INFO L87 Difference]: Start difference. First operand 4048 states and 5951 transitions. Second operand 9 states. [2019-09-10 04:14:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:03,530 INFO L93 Difference]: Finished difference Result 5509 states and 8145 transitions. [2019-09-10 04:14:03,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:14:03,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 04:14:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:03,560 INFO L225 Difference]: With dead ends: 5509 [2019-09-10 04:14:03,560 INFO L226 Difference]: Without dead ends: 5509 [2019-09-10 04:14:03,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:14:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2019-09-10 04:14:03,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 4457. [2019-09-10 04:14:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4457 states. [2019-09-10 04:14:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4457 states to 4457 states and 6561 transitions. [2019-09-10 04:14:03,740 INFO L78 Accepts]: Start accepts. Automaton has 4457 states and 6561 transitions. Word has length 95 [2019-09-10 04:14:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:14:03,741 INFO L475 AbstractCegarLoop]: Abstraction has 4457 states and 6561 transitions. [2019-09-10 04:14:03,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:14:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4457 states and 6561 transitions. [2019-09-10 04:14:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:14:03,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:14:03,745 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:14:03,746 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:14:03,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash -26017575, now seen corresponding path program 1 times [2019-09-10 04:14:03,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:14:03,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:03,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:03,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:03,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:14:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:14:03,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:14:03,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:14:03,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:14:03,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:14:03,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:14:03,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:14:03,894 INFO L87 Difference]: Start difference. First operand 4457 states and 6561 transitions. Second operand 9 states. [2019-09-10 04:14:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:04,851 INFO L93 Difference]: Finished difference Result 6969 states and 10269 transitions. [2019-09-10 04:14:04,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:14:04,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 04:14:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:04,893 INFO L225 Difference]: With dead ends: 6969 [2019-09-10 04:14:04,894 INFO L226 Difference]: Without dead ends: 6957 [2019-09-10 04:14:04,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:14:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2019-09-10 04:14:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 4436. [2019-09-10 04:14:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4436 states. [2019-09-10 04:14:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 6527 transitions. [2019-09-10 04:14:05,083 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 6527 transitions. Word has length 95 [2019-09-10 04:14:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:14:05,093 INFO L475 AbstractCegarLoop]: Abstraction has 4436 states and 6527 transitions. [2019-09-10 04:14:05,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:14:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 6527 transitions. [2019-09-10 04:14:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:14:05,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:14:05,098 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:14:05,098 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:14:05,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:05,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1571705605, now seen corresponding path program 1 times [2019-09-10 04:14:05,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:14:05,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:05,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:05,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:05,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:14:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:14:05,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:14:05,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:14:05,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:14:05,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:14:05,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:14:05,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:14:05,258 INFO L87 Difference]: Start difference. First operand 4436 states and 6527 transitions. Second operand 9 states. [2019-09-10 04:14:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:06,206 INFO L93 Difference]: Finished difference Result 6207 states and 9086 transitions. [2019-09-10 04:14:06,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:14:06,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 04:14:06,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:06,254 INFO L225 Difference]: With dead ends: 6207 [2019-09-10 04:14:06,254 INFO L226 Difference]: Without dead ends: 6195 [2019-09-10 04:14:06,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:14:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6195 states. [2019-09-10 04:14:06,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6195 to 4430. [2019-09-10 04:14:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4430 states. [2019-09-10 04:14:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4430 states to 4430 states and 6517 transitions. [2019-09-10 04:14:06,435 INFO L78 Accepts]: Start accepts. Automaton has 4430 states and 6517 transitions. Word has length 95 [2019-09-10 04:14:06,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:14:06,436 INFO L475 AbstractCegarLoop]: Abstraction has 4430 states and 6517 transitions. [2019-09-10 04:14:06,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:14:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4430 states and 6517 transitions. [2019-09-10 04:14:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:14:06,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:14:06,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:14:06,438 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:14:06,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:06,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1115354565, now seen corresponding path program 1 times [2019-09-10 04:14:06,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:14:06,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:06,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:06,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:06,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:14:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:14:06,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:14:06,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:14:06,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:14:06,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:14:06,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:14:06,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:14:06,613 INFO L87 Difference]: Start difference. First operand 4430 states and 6517 transitions. Second operand 9 states. [2019-09-10 04:14:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:07,533 INFO L93 Difference]: Finished difference Result 5428 states and 7891 transitions. [2019-09-10 04:14:07,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:14:07,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 04:14:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:07,559 INFO L225 Difference]: With dead ends: 5428 [2019-09-10 04:14:07,560 INFO L226 Difference]: Without dead ends: 5416 [2019-09-10 04:14:07,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:14:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5416 states. [2019-09-10 04:14:07,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5416 to 4427. [2019-09-10 04:14:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4427 states. [2019-09-10 04:14:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 6510 transitions. [2019-09-10 04:14:07,718 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 6510 transitions. Word has length 95 [2019-09-10 04:14:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:14:07,719 INFO L475 AbstractCegarLoop]: Abstraction has 4427 states and 6510 transitions. [2019-09-10 04:14:07,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:14:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 6510 transitions. [2019-09-10 04:14:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:14:07,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:14:07,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:14:07,721 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:14:07,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:07,722 INFO L82 PathProgramCache]: Analyzing trace with hash 601942959, now seen corresponding path program 1 times [2019-09-10 04:14:07,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:14:07,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:07,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:07,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:07,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:14:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:14:07,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:14:07,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:14:07,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:14:07,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:14:07,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:14:07,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:14:07,927 INFO L87 Difference]: Start difference. First operand 4427 states and 6510 transitions. Second operand 9 states. [2019-09-10 04:14:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:08,919 INFO L93 Difference]: Finished difference Result 4696 states and 6784 transitions. [2019-09-10 04:14:08,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:14:08,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 04:14:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:08,945 INFO L225 Difference]: With dead ends: 4696 [2019-09-10 04:14:08,945 INFO L226 Difference]: Without dead ends: 4684 [2019-09-10 04:14:08,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:14:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2019-09-10 04:14:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 4441. [2019-09-10 04:14:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4441 states. [2019-09-10 04:14:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4441 states to 4441 states and 6529 transitions. [2019-09-10 04:14:09,086 INFO L78 Accepts]: Start accepts. Automaton has 4441 states and 6529 transitions. Word has length 95 [2019-09-10 04:14:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:14:09,087 INFO L475 AbstractCegarLoop]: Abstraction has 4441 states and 6529 transitions. [2019-09-10 04:14:09,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:14:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4441 states and 6529 transitions. [2019-09-10 04:14:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:14:09,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:14:09,097 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 04:14:09,097 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:14:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:09,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1234631467, now seen corresponding path program 1 times [2019-09-10 04:14:09,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:14:09,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:09,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:09,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:14:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 04:14:09,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:14:09,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:14:09,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 04:14:09,277 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [230], [235], [240], [241], [242], [245], [267], [269], [299], [300], [303], [325], [327], [357], [358], [361], [383], [385], [415], [416], [419], [441], [443], [473], [474], [475], [476], [479], [501], [503], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:14:09,354 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:14:09,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:14:09,523 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:14:10,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:14:10,573 INFO L272 AbstractInterpreter]: Visited 99 different actions 480 times. Merged at 14 different actions 96 times. Widened at 1 different actions 2 times. Performed 5705 root evaluator evaluations with a maximum evaluation depth of 7. Performed 5705 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 7 fixpoints after 2 different actions. Largest state had 129 variables. [2019-09-10 04:14:10,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:10,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:14:10,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:14:10,582 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 04:14:10,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:10,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:14:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:10,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:14:10,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:14:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 04:14:10,838 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:14:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 38 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 04:14:10,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:14:10,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:14:10,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:14:10,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:14:10,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:14:10,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:14:10,967 INFO L87 Difference]: Start difference. First operand 4441 states and 6529 transitions. Second operand 5 states. [2019-09-10 04:14:11,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:11,680 INFO L93 Difference]: Finished difference Result 5776 states and 8395 transitions. [2019-09-10 04:14:11,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:14:11,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-09-10 04:14:11,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:11,705 INFO L225 Difference]: With dead ends: 5776 [2019-09-10 04:14:11,705 INFO L226 Difference]: Without dead ends: 5776 [2019-09-10 04:14:11,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 286 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:14:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5776 states. [2019-09-10 04:14:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5776 to 5768. [2019-09-10 04:14:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5768 states. [2019-09-10 04:14:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5768 states to 5768 states and 8388 transitions. [2019-09-10 04:14:11,936 INFO L78 Accepts]: Start accepts. Automaton has 5768 states and 8388 transitions. Word has length 145 [2019-09-10 04:14:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:14:11,937 INFO L475 AbstractCegarLoop]: Abstraction has 5768 states and 8388 transitions. [2019-09-10 04:14:11,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:14:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5768 states and 8388 transitions. [2019-09-10 04:14:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 04:14:11,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:14:11,941 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:14:11,941 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:14:11,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:11,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1644697079, now seen corresponding path program 1 times [2019-09-10 04:14:11,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:14:11,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:11,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:14:11,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:14:11,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:14:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:14:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-10 04:14:12,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:14:12,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:14:12,032 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-09-10 04:14:12,033 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [248], [251], [256], [259], [269], [271], [283], [295], [297], [299], [300], [303], [325], [327], [357], [358], [361], [383], [385], [415], [416], [419], [441], [443], [473], [474], [475], [476], [479], [501], [503], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:14:12,037 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:14:12,037 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:14:12,064 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:14:12,602 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:14:12,603 INFO L272 AbstractInterpreter]: Visited 100 different actions 380 times. Merged at 11 different actions 55 times. Widened at 1 different actions 1 times. Performed 4242 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4242 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 129 variables. [2019-09-10 04:14:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:14:12,604 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:14:13,059 INFO L227 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 78.8% of their original sizes. [2019-09-10 04:14:13,060 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:14:17,786 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-09-10 04:14:17,786 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:14:17,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:14:17,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [79] imperfect sequences [4] total 81 [2019-09-10 04:14:17,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:14:17,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-10 04:14:17,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-10 04:14:17,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=5602, Unknown=0, NotChecked=0, Total=6162 [2019-09-10 04:14:17,790 INFO L87 Difference]: Start difference. First operand 5768 states and 8388 transitions. Second operand 79 states. [2019-09-10 04:15:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:15,396 INFO L93 Difference]: Finished difference Result 7017 states and 10306 transitions. [2019-09-10 04:15:15,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-10 04:15:15,396 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 147 [2019-09-10 04:15:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:15,423 INFO L225 Difference]: With dead ends: 7017 [2019-09-10 04:15:15,423 INFO L226 Difference]: Without dead ends: 7017 [2019-09-10 04:15:15,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14559 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=3983, Invalid=37429, Unknown=0, NotChecked=0, Total=41412 [2019-09-10 04:15:15,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states. [2019-09-10 04:15:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 6250. [2019-09-10 04:15:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6250 states. [2019-09-10 04:15:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6250 states to 6250 states and 9053 transitions. [2019-09-10 04:15:15,590 INFO L78 Accepts]: Start accepts. Automaton has 6250 states and 9053 transitions. Word has length 147 [2019-09-10 04:15:15,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:15,591 INFO L475 AbstractCegarLoop]: Abstraction has 6250 states and 9053 transitions. [2019-09-10 04:15:15,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-10 04:15:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6250 states and 9053 transitions. [2019-09-10 04:15:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:15:15,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:15,598 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:15,599 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:15,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:15,599 INFO L82 PathProgramCache]: Analyzing trace with hash -901377651, now seen corresponding path program 1 times [2019-09-10 04:15:15,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:15,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:15,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:15,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:15,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-10 04:15:15,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:15:15,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:15:15,704 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-10 04:15:15,707 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [248], [251], [256], [259], [269], [271], [274], [277], [281], [297], [299], [300], [303], [325], [327], [357], [358], [361], [383], [385], [415], [416], [419], [441], [443], [473], [474], [475], [476], [479], [501], [503], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:15:15,715 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:15:15,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:15:15,739 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:15:16,140 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:15:16,141 INFO L272 AbstractInterpreter]: Visited 101 different actions 386 times. Merged at 11 different actions 55 times. Widened at 1 different actions 1 times. Performed 4587 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4587 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 129 variables. [2019-09-10 04:15:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:16,141 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:15:16,365 INFO L227 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 78.76% of their original sizes. [2019-09-10 04:15:16,365 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:15:21,037 INFO L420 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2019-09-10 04:15:21,038 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:15:21,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:15:21,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [80] imperfect sequences [5] total 83 [2019-09-10 04:15:21,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:21,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-10 04:15:21,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-10 04:15:21,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=5757, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 04:15:21,042 INFO L87 Difference]: Start difference. First operand 6250 states and 9053 transitions. Second operand 80 states. [2019-09-10 04:16:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:16:33,445 INFO L93 Difference]: Finished difference Result 7986 states and 11605 transitions. [2019-09-10 04:16:33,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2019-09-10 04:16:33,445 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 148 [2019-09-10 04:16:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:16:33,472 INFO L225 Difference]: With dead ends: 7986 [2019-09-10 04:16:33,472 INFO L226 Difference]: Without dead ends: 7986 [2019-09-10 04:16:33,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19622 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=5223, Invalid=49767, Unknown=0, NotChecked=0, Total=54990 [2019-09-10 04:16:33,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7986 states. [2019-09-10 04:16:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7986 to 6675. [2019-09-10 04:16:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6675 states. [2019-09-10 04:16:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6675 states to 6675 states and 9645 transitions. [2019-09-10 04:16:33,643 INFO L78 Accepts]: Start accepts. Automaton has 6675 states and 9645 transitions. Word has length 148 [2019-09-10 04:16:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:16:33,643 INFO L475 AbstractCegarLoop]: Abstraction has 6675 states and 9645 transitions. [2019-09-10 04:16:33,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-10 04:16:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 6675 states and 9645 transitions. [2019-09-10 04:16:33,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:16:33,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:16:33,649 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:16:33,649 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:16:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1903508881, now seen corresponding path program 1 times [2019-09-10 04:16:33,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:16:33,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:33,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:33,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:33,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:16:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-10 04:16:33,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:33,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:16:33,751 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-10 04:16:33,751 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [267], [269], [271], [274], [277], [281], [297], [299], [300], [303], [325], [327], [357], [358], [361], [383], [385], [415], [416], [419], [422], [425], [430], [433], [441], [443], [473], [474], [475], [476], [479], [501], [503], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:16:33,755 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:16:33,755 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:16:33,778 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:16:34,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:16:34,965 INFO L272 AbstractInterpreter]: Visited 107 different actions 936 times. Merged at 19 different actions 209 times. Widened at 1 different actions 4 times. Performed 13053 root evaluator evaluations with a maximum evaluation depth of 6. Performed 13053 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 27 fixpoints after 5 different actions. Largest state had 129 variables. [2019-09-10 04:16:34,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:34,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:16:34,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:34,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:16:34,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:34,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:16:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:35,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 04:16:35,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:16:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 04:16:35,423 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:16:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 04:16:35,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:16:35,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [5, 16] total 30 [2019-09-10 04:16:35,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:16:35,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 04:16:35,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 04:16:35,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2019-09-10 04:16:35,898 INFO L87 Difference]: Start difference. First operand 6675 states and 9645 transitions. Second operand 14 states. [2019-09-10 04:16:38,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:16:38,540 INFO L93 Difference]: Finished difference Result 9571 states and 13844 transitions. [2019-09-10 04:16:38,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:16:38,541 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 148 [2019-09-10 04:16:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:16:38,571 INFO L225 Difference]: With dead ends: 9571 [2019-09-10 04:16:38,571 INFO L226 Difference]: Without dead ends: 9571 [2019-09-10 04:16:38,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 266 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2019-09-10 04:16:38,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9571 states. [2019-09-10 04:16:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9571 to 9561. [2019-09-10 04:16:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9561 states. [2019-09-10 04:16:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9561 states to 9561 states and 13839 transitions. [2019-09-10 04:16:38,764 INFO L78 Accepts]: Start accepts. Automaton has 9561 states and 13839 transitions. Word has length 148 [2019-09-10 04:16:38,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:16:38,764 INFO L475 AbstractCegarLoop]: Abstraction has 9561 states and 13839 transitions. [2019-09-10 04:16:38,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 04:16:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 9561 states and 13839 transitions. [2019-09-10 04:16:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 04:16:38,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:16:38,771 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:16:38,771 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:16:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:38,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1381670492, now seen corresponding path program 1 times [2019-09-10 04:16:38,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:16:38,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:38,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:38,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:38,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:16:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:16:38,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:38,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:16:38,862 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2019-09-10 04:16:38,862 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [248], [251], [256], [259], [269], [271], [283], [295], [297], [299], [300], [303], [325], [327], [357], [358], [361], [383], [385], [415], [416], [419], [441], [443], [473], [474], [475], [476], [479], [501], [503], [505], [508], [513], [515], [531], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:16:38,867 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:16:38,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:16:38,888 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:16:39,357 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:16:39,358 INFO L272 AbstractInterpreter]: Visited 103 different actions 398 times. Merged at 11 different actions 55 times. Widened at 1 different actions 1 times. Performed 4586 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4586 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 129 variables. [2019-09-10 04:16:39,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:39,358 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:16:39,622 INFO L227 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 78.6% of their original sizes. [2019-09-10 04:16:39,622 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:16:43,580 INFO L420 sIntCurrentIteration]: We unified 148 AI predicates to 148 [2019-09-10 04:16:43,580 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:16:43,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:16:43,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [77] imperfect sequences [4] total 79 [2019-09-10 04:16:43,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:16:43,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 04:16:43,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 04:16:43,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=5339, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 04:16:43,584 INFO L87 Difference]: Start difference. First operand 9561 states and 13839 transitions. Second operand 77 states. [2019-09-10 04:17:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:17:38,326 INFO L93 Difference]: Finished difference Result 11542 states and 16934 transitions. [2019-09-10 04:17:38,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-10 04:17:38,326 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 149 [2019-09-10 04:17:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:17:38,350 INFO L225 Difference]: With dead ends: 11542 [2019-09-10 04:17:38,350 INFO L226 Difference]: Without dead ends: 11542 [2019-09-10 04:17:38,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14278 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=3876, Invalid=36726, Unknown=0, NotChecked=0, Total=40602 [2019-09-10 04:17:38,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11542 states. [2019-09-10 04:17:38,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11542 to 10002. [2019-09-10 04:17:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10002 states. [2019-09-10 04:17:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10002 states to 10002 states and 14462 transitions. [2019-09-10 04:17:38,574 INFO L78 Accepts]: Start accepts. Automaton has 10002 states and 14462 transitions. Word has length 149 [2019-09-10 04:17:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:17:38,574 INFO L475 AbstractCegarLoop]: Abstraction has 10002 states and 14462 transitions. [2019-09-10 04:17:38,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-10 04:17:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 10002 states and 14462 transitions. [2019-09-10 04:17:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 04:17:38,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:17:38,582 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:17:38,582 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:17:38,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:17:38,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1036813986, now seen corresponding path program 1 times [2019-09-10 04:17:38,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:17:38,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:17:38,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:17:38,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:17:38,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:17:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:17:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:17:38,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:17:38,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:17:38,684 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2019-09-10 04:17:38,685 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [248], [251], [256], [259], [269], [271], [283], [295], [297], [299], [300], [303], [325], [327], [357], [358], [361], [383], [385], [415], [416], [419], [441], [443], [473], [474], [475], [476], [479], [501], [503], [505], [508], [511], [515], [531], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:17:38,687 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:17:38,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:17:38,711 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:17:39,042 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:17:39,043 INFO L272 AbstractInterpreter]: Visited 105 different actions 520 times. Merged at 13 different actions 85 times. Widened at 1 different actions 2 times. Performed 6740 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6740 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 129 variables. [2019-09-10 04:17:39,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:17:39,043 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:17:39,184 INFO L227 lantSequenceWeakener]: Weakened 113 states. On average, predicates are now at 78.55% of their original sizes. [2019-09-10 04:17:39,184 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:17:43,576 INFO L420 sIntCurrentIteration]: We unified 148 AI predicates to 148 [2019-09-10 04:17:43,576 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:17:43,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:17:43,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [81] imperfect sequences [4] total 83 [2019-09-10 04:17:43,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:17:43,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-10 04:17:43,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-10 04:17:43,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=5919, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 04:17:43,578 INFO L87 Difference]: Start difference. First operand 10002 states and 14462 transitions. Second operand 81 states. [2019-09-10 04:19:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:19:04,846 INFO L93 Difference]: Finished difference Result 12519 states and 18287 transitions. [2019-09-10 04:19:04,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-09-10 04:19:04,846 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 149 [2019-09-10 04:19:04,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:19:04,880 INFO L225 Difference]: With dead ends: 12519 [2019-09-10 04:19:04,881 INFO L226 Difference]: Without dead ends: 12519 [2019-09-10 04:19:04,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17118 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=4589, Invalid=43591, Unknown=0, NotChecked=0, Total=48180 [2019-09-10 04:19:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12519 states. [2019-09-10 04:19:05,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12519 to 11165. [2019-09-10 04:19:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11165 states. [2019-09-10 04:19:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11165 states to 11165 states and 16080 transitions. [2019-09-10 04:19:05,127 INFO L78 Accepts]: Start accepts. Automaton has 11165 states and 16080 transitions. Word has length 149 [2019-09-10 04:19:05,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:19:05,128 INFO L475 AbstractCegarLoop]: Abstraction has 11165 states and 16080 transitions. [2019-09-10 04:19:05,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-10 04:19:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand 11165 states and 16080 transitions. [2019-09-10 04:19:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 04:19:05,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:19:05,136 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:19:05,136 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:19:05,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1176054896, now seen corresponding path program 1 times [2019-09-10 04:19:05,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:19:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:05,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:05,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:05,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:19:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:19:05,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:19:05,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:19:05,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2019-09-10 04:19:05,236 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [267], [269], [271], [283], [295], [297], [299], [300], [303], [306], [309], [314], [317], [325], [327], [357], [358], [361], [383], [385], [415], [416], [419], [441], [443], [473], [474], [475], [476], [479], [501], [503], [505], [508], [511], [515], [531], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:19:05,238 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:19:05,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:19:05,255 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:19:05,969 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:19:05,969 INFO L272 AbstractInterpreter]: Visited 111 different actions 994 times. Merged at 21 different actions 233 times. Widened at 1 different actions 3 times. Performed 11678 root evaluator evaluations with a maximum evaluation depth of 6. Performed 11678 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 38 fixpoints after 8 different actions. Largest state had 129 variables. [2019-09-10 04:19:05,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:05,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:19:05,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:19:05,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:19:05,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:05,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:19:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:06,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 04:19:06,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:19:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 04:19:06,359 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:19:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 04:19:06,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:19:06,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 14] total 26 [2019-09-10 04:19:06,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:19:06,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 04:19:06,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 04:19:06,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:19:06,770 INFO L87 Difference]: Start difference. First operand 11165 states and 16080 transitions. Second operand 12 states. [2019-09-10 04:19:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:19:08,640 INFO L93 Difference]: Finished difference Result 11684 states and 16825 transitions. [2019-09-10 04:19:08,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:19:08,640 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 149 [2019-09-10 04:19:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:19:08,664 INFO L225 Difference]: With dead ends: 11684 [2019-09-10 04:19:08,665 INFO L226 Difference]: Without dead ends: 11684 [2019-09-10 04:19:08,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 274 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2019-09-10 04:19:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11684 states. [2019-09-10 04:19:08,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11684 to 11676. [2019-09-10 04:19:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11676 states. [2019-09-10 04:19:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11676 states to 11676 states and 16821 transitions. [2019-09-10 04:19:08,863 INFO L78 Accepts]: Start accepts. Automaton has 11676 states and 16821 transitions. Word has length 149 [2019-09-10 04:19:08,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:19:08,864 INFO L475 AbstractCegarLoop]: Abstraction has 11676 states and 16821 transitions. [2019-09-10 04:19:08,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 04:19:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 11676 states and 16821 transitions. [2019-09-10 04:19:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 04:19:08,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:19:08,873 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:19:08,873 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:19:08,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:08,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1748442666, now seen corresponding path program 1 times [2019-09-10 04:19:08,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:19:08,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:08,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:19:08,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:19:08,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:19:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:19:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:19:08,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:19:08,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:19:08,949 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2019-09-10 04:19:08,949 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [248], [251], [256], [259], [269], [271], [283], [295], [297], [299], [300], [303], [325], [327], [329], [332], [337], [339], [355], [357], [358], [361], [383], [385], [415], [416], [419], [441], [443], [473], [474], [475], [476], [479], [501], [503], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:19:08,951 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:19:08,951 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:19:08,969 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:19:09,228 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:19:09,228 INFO L272 AbstractInterpreter]: Visited 103 different actions 398 times. Merged at 11 different actions 55 times. Widened at 1 different actions 1 times. Performed 4587 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4587 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 129 variables. [2019-09-10 04:19:09,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:19:09,229 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:19:09,333 INFO L227 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 78.6% of their original sizes. [2019-09-10 04:19:09,333 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:19:13,256 INFO L420 sIntCurrentIteration]: We unified 148 AI predicates to 148 [2019-09-10 04:19:13,256 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:19:13,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:19:13,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [77] imperfect sequences [4] total 79 [2019-09-10 04:19:13,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:19:13,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 04:19:13,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 04:19:13,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=5357, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 04:19:13,258 INFO L87 Difference]: Start difference. First operand 11676 states and 16821 transitions. Second operand 77 states. [2019-09-10 04:20:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:20:12,736 INFO L93 Difference]: Finished difference Result 15644 states and 22616 transitions. [2019-09-10 04:20:12,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-09-10 04:20:12,736 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 149 [2019-09-10 04:20:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:20:12,762 INFO L225 Difference]: With dead ends: 15644 [2019-09-10 04:20:12,763 INFO L226 Difference]: Without dead ends: 15644 [2019-09-10 04:20:12,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14254 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=3874, Invalid=36728, Unknown=0, NotChecked=0, Total=40602 [2019-09-10 04:20:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15644 states. [2019-09-10 04:20:13,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15644 to 12984. [2019-09-10 04:20:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12984 states. [2019-09-10 04:20:13,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12984 states to 12984 states and 18651 transitions. [2019-09-10 04:20:13,034 INFO L78 Accepts]: Start accepts. Automaton has 12984 states and 18651 transitions. Word has length 149 [2019-09-10 04:20:13,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:20:13,035 INFO L475 AbstractCegarLoop]: Abstraction has 12984 states and 18651 transitions. [2019-09-10 04:20:13,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-10 04:20:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 12984 states and 18651 transitions. [2019-09-10 04:20:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 04:20:13,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:20:13,044 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:20:13,045 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:20:13,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:20:13,045 INFO L82 PathProgramCache]: Analyzing trace with hash 909409004, now seen corresponding path program 1 times [2019-09-10 04:20:13,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:20:13,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:13,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:20:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:20:13,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:20:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:20:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:20:13,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:20:13,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:20:13,117 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2019-09-10 04:20:13,118 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [248], [251], [256], [259], [269], [271], [283], [295], [297], [299], [300], [303], [325], [327], [329], [332], [335], [339], [355], [357], [358], [361], [383], [385], [415], [416], [419], [441], [443], [473], [474], [475], [476], [479], [501], [503], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:20:13,119 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:20:13,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:20:13,148 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:20:13,499 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:20:13,500 INFO L272 AbstractInterpreter]: Visited 105 different actions 513 times. Merged at 13 different actions 84 times. Widened at 1 different actions 2 times. Performed 7014 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7014 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 8 fixpoints after 3 different actions. Largest state had 129 variables. [2019-09-10 04:20:13,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:20:13,500 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:20:13,646 INFO L227 lantSequenceWeakener]: Weakened 113 states. On average, predicates are now at 78.56% of their original sizes. [2019-09-10 04:20:13,646 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:20:18,304 INFO L420 sIntCurrentIteration]: We unified 148 AI predicates to 148 [2019-09-10 04:20:18,305 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:20:18,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:20:18,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [81] imperfect sequences [4] total 83 [2019-09-10 04:20:18,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:20:18,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-10 04:20:18,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-10 04:20:18,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=546, Invalid=5934, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 04:20:18,306 INFO L87 Difference]: Start difference. First operand 12984 states and 18651 transitions. Second operand 81 states. [2019-09-10 04:21:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:20,264 INFO L93 Difference]: Finished difference Result 16847 states and 24269 transitions. [2019-09-10 04:21:20,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-09-10 04:21:20,264 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 149 [2019-09-10 04:21:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:20,301 INFO L225 Difference]: With dead ends: 16847 [2019-09-10 04:21:20,301 INFO L226 Difference]: Without dead ends: 16847 [2019-09-10 04:21:20,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15075 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=4058, Invalid=38998, Unknown=0, NotChecked=0, Total=43056 [2019-09-10 04:21:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16847 states. [2019-09-10 04:21:20,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16847 to 14971. [2019-09-10 04:21:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14971 states. [2019-09-10 04:21:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14971 states to 14971 states and 21363 transitions. [2019-09-10 04:21:20,617 INFO L78 Accepts]: Start accepts. Automaton has 14971 states and 21363 transitions. Word has length 149 [2019-09-10 04:21:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:20,617 INFO L475 AbstractCegarLoop]: Abstraction has 14971 states and 21363 transitions. [2019-09-10 04:21:20,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-10 04:21:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 14971 states and 21363 transitions. [2019-09-10 04:21:20,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 04:21:20,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:20,630 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:20,631 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:20,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:20,631 INFO L82 PathProgramCache]: Analyzing trace with hash 535238308, now seen corresponding path program 1 times [2019-09-10 04:21:20,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:20,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:20,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:20,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:20,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:21:20,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:20,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:21:20,770 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2019-09-10 04:21:20,770 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [267], [269], [271], [283], [295], [297], [299], [300], [303], [325], [327], [329], [332], [335], [339], [355], [357], [358], [361], [364], [367], [372], [375], [383], [385], [415], [416], [419], [441], [443], [473], [474], [475], [476], [479], [501], [503], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:21:20,772 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:21:20,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:21:20,789 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:21:21,720 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:21:21,720 INFO L272 AbstractInterpreter]: Visited 111 different actions 1066 times. Merged at 21 different actions 251 times. Widened at 1 different actions 3 times. Performed 13853 root evaluator evaluations with a maximum evaluation depth of 6. Performed 13853 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 40 fixpoints after 7 different actions. Largest state had 129 variables. [2019-09-10 04:21:21,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:21,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:21:21,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:21,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:21:21,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:21,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:21:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:21,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 04:21:21,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:21:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:21:22,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:21:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-10 04:21:22,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:21:22,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 13] total 24 [2019-09-10 04:21:22,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:22,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:21:22,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:21:22,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-09-10 04:21:22,413 INFO L87 Difference]: Start difference. First operand 14971 states and 21363 transitions. Second operand 11 states. [2019-09-10 04:21:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:24,188 INFO L93 Difference]: Finished difference Result 14405 states and 20496 transitions. [2019-09-10 04:21:24,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:21:24,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 149 [2019-09-10 04:21:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:24,217 INFO L225 Difference]: With dead ends: 14405 [2019-09-10 04:21:24,217 INFO L226 Difference]: Without dead ends: 14405 [2019-09-10 04:21:24,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 277 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:21:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14405 states. [2019-09-10 04:21:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14405 to 14394. [2019-09-10 04:21:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14394 states. [2019-09-10 04:21:24,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14394 states to 14394 states and 20489 transitions. [2019-09-10 04:21:24,417 INFO L78 Accepts]: Start accepts. Automaton has 14394 states and 20489 transitions. Word has length 149 [2019-09-10 04:21:24,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:24,418 INFO L475 AbstractCegarLoop]: Abstraction has 14394 states and 20489 transitions. [2019-09-10 04:21:24,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:21:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 14394 states and 20489 transitions. [2019-09-10 04:21:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 04:21:24,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:24,428 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:24,429 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:24,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:24,429 INFO L82 PathProgramCache]: Analyzing trace with hash 656061218, now seen corresponding path program 1 times [2019-09-10 04:21:24,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:24,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:24,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:24,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:24,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:21:24,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:24,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:21:24,642 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2019-09-10 04:21:24,643 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [248], [251], [256], [259], [269], [271], [283], [295], [297], [299], [300], [303], [325], [327], [357], [358], [361], [383], [385], [387], [390], [393], [397], [413], [415], [416], [419], [441], [443], [473], [474], [475], [476], [479], [501], [503], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:21:24,645 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:21:24,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:21:24,665 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:21:25,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:21:25,619 INFO L272 AbstractInterpreter]: Visited 110 different actions 863 times. Merged at 18 different actions 181 times. Widened at 1 different actions 4 times. Performed 13133 root evaluator evaluations with a maximum evaluation depth of 6. Performed 13133 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 24 fixpoints after 6 different actions. Largest state had 129 variables. [2019-09-10 04:21:25,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:25,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:21:25,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:25,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:21:25,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:25,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:21:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:25,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-10 04:21:25,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:21:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:21:25,801 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:21:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:21:25,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:21:25,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-09-10 04:21:25,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:25,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:21:25,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:21:25,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:21:25,880 INFO L87 Difference]: Start difference. First operand 14394 states and 20489 transitions. Second operand 3 states. [2019-09-10 04:21:25,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:21:25,941 INFO L93 Difference]: Finished difference Result 24186 states and 34568 transitions. [2019-09-10 04:21:25,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:21:25,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-10 04:21:25,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:21:25,989 INFO L225 Difference]: With dead ends: 24186 [2019-09-10 04:21:25,989 INFO L226 Difference]: Without dead ends: 24186 [2019-09-10 04:21:25,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 295 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:21:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24186 states. [2019-09-10 04:21:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24186 to 24184. [2019-09-10 04:21:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24184 states. [2019-09-10 04:21:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24184 states to 24184 states and 34567 transitions. [2019-09-10 04:21:26,297 INFO L78 Accepts]: Start accepts. Automaton has 24184 states and 34567 transitions. Word has length 149 [2019-09-10 04:21:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:21:26,298 INFO L475 AbstractCegarLoop]: Abstraction has 24184 states and 34567 transitions. [2019-09-10 04:21:26,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:21:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 24184 states and 34567 transitions. [2019-09-10 04:21:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 04:21:26,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:21:26,310 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:21:26,311 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:21:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1251653168, now seen corresponding path program 1 times [2019-09-10 04:21:26,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:21:26,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:26,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:21:26,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:21:26,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:21:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:21:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:21:26,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:21:26,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:21:26,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2019-09-10 04:21:26,393 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [267], [269], [271], [283], [295], [297], [299], [300], [303], [325], [327], [357], [358], [361], [383], [385], [387], [390], [393], [397], [413], [415], [416], [419], [441], [443], [473], [474], [475], [476], [479], [482], [485], [490], [493], [501], [503], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:21:26,394 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:21:26,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:21:26,412 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:21:26,810 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:21:26,810 INFO L272 AbstractInterpreter]: Visited 107 different actions 678 times. Merged at 15 different actions 132 times. Widened at 1 different actions 2 times. Performed 7916 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7916 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 17 fixpoints after 6 different actions. Largest state had 129 variables. [2019-09-10 04:21:26,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:21:26,811 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:21:26,927 INFO L227 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 78.42% of their original sizes. [2019-09-10 04:21:26,928 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:21:31,789 INFO L420 sIntCurrentIteration]: We unified 148 AI predicates to 148 [2019-09-10 04:21:31,789 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:21:31,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:21:31,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [81] imperfect sequences [5] total 84 [2019-09-10 04:21:31,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:21:31,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-10 04:21:31,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-10 04:21:31,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=5958, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 04:21:31,791 INFO L87 Difference]: Start difference. First operand 24184 states and 34567 transitions. Second operand 81 states. [2019-09-10 04:25:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:25:47,608 INFO L93 Difference]: Finished difference Result 44691 states and 63015 transitions. [2019-09-10 04:25:47,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 624 states. [2019-09-10 04:25:47,608 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 149 [2019-09-10 04:25:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:25:47,688 INFO L225 Difference]: With dead ends: 44691 [2019-09-10 04:25:47,688 INFO L226 Difference]: Without dead ends: 44691 [2019-09-10 04:25:47,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197442 ImplicationChecksByTransitivity, 48.1s TimeCoverageRelationStatistics Valid=30259, Invalid=415297, Unknown=0, NotChecked=0, Total=445556 [2019-09-10 04:25:47,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44691 states. [2019-09-10 04:25:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44691 to 38273. [2019-09-10 04:25:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38273 states. [2019-09-10 04:25:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38273 states to 38273 states and 53393 transitions. [2019-09-10 04:25:48,218 INFO L78 Accepts]: Start accepts. Automaton has 38273 states and 53393 transitions. Word has length 149 [2019-09-10 04:25:48,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:25:48,218 INFO L475 AbstractCegarLoop]: Abstraction has 38273 states and 53393 transitions. [2019-09-10 04:25:48,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-10 04:25:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 38273 states and 53393 transitions. [2019-09-10 04:25:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 04:25:48,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:25:48,234 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:25:48,234 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:25:48,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:25:48,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1170208976, now seen corresponding path program 1 times [2019-09-10 04:25:48,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:25:48,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:25:48,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:25:48,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:25:48,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:25:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:25:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:25:48,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:25:48,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:25:48,325 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2019-09-10 04:25:48,325 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [267], [269], [271], [283], [295], [297], [299], [300], [303], [325], [327], [357], [358], [361], [383], [385], [415], [416], [419], [441], [443], [445], [448], [451], [455], [471], [473], [474], [475], [476], [479], [482], [485], [490], [493], [501], [503], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:25:48,327 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:25:48,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:25:48,345 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:25:50,670 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:25:50,670 INFO L272 AbstractInterpreter]: Visited 111 different actions 1128 times. Merged at 21 different actions 262 times. Widened at 1 different actions 3 times. Performed 14449 root evaluator evaluations with a maximum evaluation depth of 6. Performed 14449 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 43 fixpoints after 7 different actions. Largest state had 129 variables. [2019-09-10 04:25:50,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:25:50,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:25:50,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:25:50,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:25:50,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:25:50,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:25:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:25:50,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 04:25:50,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:25:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:25:50,991 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:25:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 04:25:51,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:25:51,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 11] total 21 [2019-09-10 04:25:51,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:25:51,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:25:51,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:25:51,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-09-10 04:25:51,259 INFO L87 Difference]: Start difference. First operand 38273 states and 53393 transitions. Second operand 13 states. [2019-09-10 04:25:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:25:54,170 INFO L93 Difference]: Finished difference Result 131404 states and 186342 transitions. [2019-09-10 04:25:54,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 04:25:54,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 149 [2019-09-10 04:25:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:25:54,455 INFO L225 Difference]: With dead ends: 131404 [2019-09-10 04:25:54,455 INFO L226 Difference]: Without dead ends: 131371 [2019-09-10 04:25:54,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 301 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=2053, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 04:25:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131371 states. [2019-09-10 04:25:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131371 to 114053. [2019-09-10 04:25:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114053 states. [2019-09-10 04:25:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114053 states to 114053 states and 159827 transitions. [2019-09-10 04:25:59,374 INFO L78 Accepts]: Start accepts. Automaton has 114053 states and 159827 transitions. Word has length 149 [2019-09-10 04:25:59,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:25:59,375 INFO L475 AbstractCegarLoop]: Abstraction has 114053 states and 159827 transitions. [2019-09-10 04:25:59,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:25:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 114053 states and 159827 transitions. [2019-09-10 04:25:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 04:25:59,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:25:59,411 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:25:59,411 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:25:59,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:25:59,412 INFO L82 PathProgramCache]: Analyzing trace with hash -28127302, now seen corresponding path program 1 times [2019-09-10 04:25:59,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:25:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:25:59,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:25:59,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:25:59,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:25:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:25:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:25:59,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:25:59,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:25:59,500 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2019-09-10 04:25:59,500 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [216], [222], [225], [228], [238], [240], [241], [242], [245], [248], [251], [256], [259], [269], [271], [274], [277], [281], [297], [299], [300], [303], [325], [327], [357], [358], [361], [383], [385], [415], [416], [419], [441], [443], [473], [474], [475], [476], [479], [501], [503], [505], [508], [513], [515], [531], [533], [534], [537], [539], [542], [544], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566] [2019-09-10 04:25:59,502 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:25:59,502 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:25:59,518 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:25:59,866 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:25:59,866 INFO L272 AbstractInterpreter]: Visited 104 different actions 404 times. Merged at 11 different actions 55 times. Widened at 1 different actions 1 times. Performed 4607 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4607 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 129 variables. [2019-09-10 04:25:59,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:25:59,866 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:26:00,036 INFO L227 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 78.56% of their original sizes. [2019-09-10 04:26:00,036 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:26:04,175 INFO L420 sIntCurrentIteration]: We unified 149 AI predicates to 149 [2019-09-10 04:26:04,175 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:26:04,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:26:04,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [78] imperfect sequences [5] total 81 [2019-09-10 04:26:04,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:26:04,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-10 04:26:04,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-10 04:26:04,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=5490, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 04:26:04,177 INFO L87 Difference]: Start difference. First operand 114053 states and 159827 transitions. Second operand 78 states.