java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:01:43,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:01:43,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:01:43,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:01:43,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:01:43,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:01:43,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:01:43,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:01:43,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:01:43,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:01:43,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:01:43,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:01:43,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:01:43,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:01:43,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:01:43,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:01:43,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:01:43,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:01:43,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:01:43,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:01:43,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:01:43,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:01:43,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:01:43,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:01:43,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:01:43,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:01:43,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:01:43,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:01:43,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:01:43,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:01:43,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:01:43,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:01:43,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:01:43,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:01:43,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:01:43,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:01:43,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:01:43,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:01:43,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:01:43,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:01:43,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:01:43,865 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 07:01:43,880 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:01:43,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:01:43,880 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:01:43,880 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:01:43,881 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:01:43,881 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:01:43,881 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:01:43,882 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:01:43,882 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:01:43,882 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:01:43,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:01:43,883 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:01:43,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:01:43,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:01:43,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:01:43,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:01:43,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:01:43,884 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:01:43,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:01:43,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:01:43,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:01:43,885 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:01:43,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:01:43,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:01:43,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:01:43,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:01:43,887 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:01:43,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:01:43,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:01:43,887 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:01:43,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:01:43,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:01:43,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:01:43,944 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:01:43,944 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:01:43,945 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:01:44,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce50e26f/4cba44ac5be34c2d800af05dc261e96e/FLAG9690b7465 [2019-09-10 07:01:44,416 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:01:44,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:01:44,427 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce50e26f/4cba44ac5be34c2d800af05dc261e96e/FLAG9690b7465 [2019-09-10 07:01:44,751 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce50e26f/4cba44ac5be34c2d800af05dc261e96e [2019-09-10 07:01:44,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:01:44,761 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:01:44,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:01:44,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:01:44,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:01:44,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:01:44" (1/1) ... [2019-09-10 07:01:44,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d0d83ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:44, skipping insertion in model container [2019-09-10 07:01:44,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:01:44" (1/1) ... [2019-09-10 07:01:44,777 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:01:44,817 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:01:45,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:01:45,076 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:01:45,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:01:45,244 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:01:45,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:45 WrapperNode [2019-09-10 07:01:45,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:01:45,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:01:45,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:01:45,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:01:45,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:45" (1/1) ... [2019-09-10 07:01:45,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:45" (1/1) ... [2019-09-10 07:01:45,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:45" (1/1) ... [2019-09-10 07:01:45,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:45" (1/1) ... [2019-09-10 07:01:45,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:45" (1/1) ... [2019-09-10 07:01:45,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:45" (1/1) ... [2019-09-10 07:01:45,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:45" (1/1) ... [2019-09-10 07:01:45,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:01:45,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:01:45,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:01:45,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:01:45,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:45" (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 07:01:45,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:01:45,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:01:45,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:01:45,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:01:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:01:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:01:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:01:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:01:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:01:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:01:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:01:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:01:45,376 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:01:45,376 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:01:45,376 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:01:45,376 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:01:45,376 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:01:45,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:01:45,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:01:45,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:01:46,188 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:01:46,189 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:01:46,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:01:46 BoogieIcfgContainer [2019-09-10 07:01:46,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:01:46,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:01:46,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:01:46,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:01:46,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:01:44" (1/3) ... [2019-09-10 07:01:46,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5014b677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:01:46, skipping insertion in model container [2019-09-10 07:01:46,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:01:45" (2/3) ... [2019-09-10 07:01:46,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5014b677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:01:46, skipping insertion in model container [2019-09-10 07:01:46,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:01:46" (3/3) ... [2019-09-10 07:01:46,206 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:01:46,218 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:01:46,226 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:01:46,244 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:01:46,277 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:01:46,277 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:01:46,278 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:01:46,278 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:01:46,278 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:01:46,278 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:01:46,279 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:01:46,279 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:01:46,308 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-09-10 07:01:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 07:01:46,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:46,336 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:46,338 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:46,343 INFO L82 PathProgramCache]: Analyzing trace with hash 66205719, now seen corresponding path program 1 times [2019-09-10 07:01:46,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:46,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:46,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:46,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:46,753 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 07:01:46,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:46,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:46,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:46,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:46,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:46,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:46,781 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2019-09-10 07:01:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:46,865 INFO L93 Difference]: Finished difference Result 187 states and 295 transitions. [2019-09-10 07:01:46,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:46,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-10 07:01:46,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:46,891 INFO L225 Difference]: With dead ends: 187 [2019-09-10 07:01:46,891 INFO L226 Difference]: Without dead ends: 179 [2019-09-10 07:01:46,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:46,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-10 07:01:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-09-10 07:01:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-10 07:01:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 263 transitions. [2019-09-10 07:01:46,995 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 263 transitions. Word has length 53 [2019-09-10 07:01:46,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:46,995 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 263 transitions. [2019-09-10 07:01:46,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2019-09-10 07:01:47,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:01:47,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:47,000 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] [2019-09-10 07:01:47,001 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:47,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:47,002 INFO L82 PathProgramCache]: Analyzing trace with hash -160431346, now seen corresponding path program 1 times [2019-09-10 07:01:47,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:47,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:47,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:47,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:47,191 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 07:01:47,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:47,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:47,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:47,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:47,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:47,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:47,195 INFO L87 Difference]: Start difference. First operand 177 states and 263 transitions. Second operand 3 states. [2019-09-10 07:01:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:47,239 INFO L93 Difference]: Finished difference Result 291 states and 441 transitions. [2019-09-10 07:01:47,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:47,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-10 07:01:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:47,242 INFO L225 Difference]: With dead ends: 291 [2019-09-10 07:01:47,243 INFO L226 Difference]: Without dead ends: 291 [2019-09-10 07:01:47,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:47,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-10 07:01:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2019-09-10 07:01:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-10 07:01:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 440 transitions. [2019-09-10 07:01:47,269 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 440 transitions. Word has length 54 [2019-09-10 07:01:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:47,270 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 440 transitions. [2019-09-10 07:01:47,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 440 transitions. [2019-09-10 07:01:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:01:47,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:47,276 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:47,277 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:47,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:47,277 INFO L82 PathProgramCache]: Analyzing trace with hash 783075062, now seen corresponding path program 1 times [2019-09-10 07:01:47,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:47,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:47,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:47,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:47,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:47,403 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 07:01:47,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:47,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:47,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:47,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:47,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:47,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:47,405 INFO L87 Difference]: Start difference. First operand 289 states and 440 transitions. Second operand 3 states. [2019-09-10 07:01:47,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:47,442 INFO L93 Difference]: Finished difference Result 483 states and 741 transitions. [2019-09-10 07:01:47,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:47,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-10 07:01:47,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:47,449 INFO L225 Difference]: With dead ends: 483 [2019-09-10 07:01:47,449 INFO L226 Difference]: Without dead ends: 483 [2019-09-10 07:01:47,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:47,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-10 07:01:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2019-09-10 07:01:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-10 07:01:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 740 transitions. [2019-09-10 07:01:47,483 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 740 transitions. Word has length 55 [2019-09-10 07:01:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:47,483 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 740 transitions. [2019-09-10 07:01:47,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 740 transitions. [2019-09-10 07:01:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:01:47,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:47,486 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] [2019-09-10 07:01:47,486 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:47,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:47,487 INFO L82 PathProgramCache]: Analyzing trace with hash -842625673, now seen corresponding path program 1 times [2019-09-10 07:01:47,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:47,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:47,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:47,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:47,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:47,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 07:01:47,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:47,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:47,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:47,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:47,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:47,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:47,587 INFO L87 Difference]: Start difference. First operand 481 states and 740 transitions. Second operand 6 states. [2019-09-10 07:01:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:47,782 INFO L93 Difference]: Finished difference Result 2281 states and 3560 transitions. [2019-09-10 07:01:47,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:01:47,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 07:01:47,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:47,803 INFO L225 Difference]: With dead ends: 2281 [2019-09-10 07:01:47,803 INFO L226 Difference]: Without dead ends: 2281 [2019-09-10 07:01:47,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2019-09-10 07:01:47,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 929. [2019-09-10 07:01:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-10 07:01:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1432 transitions. [2019-09-10 07:01:47,853 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1432 transitions. Word has length 56 [2019-09-10 07:01:47,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:47,856 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1432 transitions. [2019-09-10 07:01:47,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1432 transitions. [2019-09-10 07:01:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:01:47,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:47,867 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] [2019-09-10 07:01:47,868 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:47,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:47,871 INFO L82 PathProgramCache]: Analyzing trace with hash -370124845, now seen corresponding path program 1 times [2019-09-10 07:01:47,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:47,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:47,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:47,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:47,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:48,081 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 07:01:48,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:48,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:01:48,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:48,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:01:48,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:01:48,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:48,084 INFO L87 Difference]: Start difference. First operand 929 states and 1432 transitions. Second operand 6 states. [2019-09-10 07:01:48,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:48,236 INFO L93 Difference]: Finished difference Result 3135 states and 4819 transitions. [2019-09-10 07:01:48,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:01:48,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-10 07:01:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:48,254 INFO L225 Difference]: With dead ends: 3135 [2019-09-10 07:01:48,254 INFO L226 Difference]: Without dead ends: 3135 [2019-09-10 07:01:48,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2019-09-10 07:01:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 3129. [2019-09-10 07:01:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2019-09-10 07:01:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4816 transitions. [2019-09-10 07:01:48,327 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4816 transitions. Word has length 57 [2019-09-10 07:01:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:48,328 INFO L475 AbstractCegarLoop]: Abstraction has 3129 states and 4816 transitions. [2019-09-10 07:01:48,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4816 transitions. [2019-09-10 07:01:48,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:01:48,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:48,330 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] [2019-09-10 07:01:48,330 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1007315784, now seen corresponding path program 1 times [2019-09-10 07:01:48,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:48,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:48,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:48,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:48,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:48,380 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 07:01:48,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:48,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:48,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:48,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:48,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:48,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:48,382 INFO L87 Difference]: Start difference. First operand 3129 states and 4816 transitions. Second operand 3 states. [2019-09-10 07:01:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:48,428 INFO L93 Difference]: Finished difference Result 5155 states and 7809 transitions. [2019-09-10 07:01:48,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:48,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-10 07:01:48,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:48,455 INFO L225 Difference]: With dead ends: 5155 [2019-09-10 07:01:48,455 INFO L226 Difference]: Without dead ends: 5155 [2019-09-10 07:01:48,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2019-09-10 07:01:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 5153. [2019-09-10 07:01:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2019-09-10 07:01:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 7808 transitions. [2019-09-10 07:01:48,582 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 7808 transitions. Word has length 58 [2019-09-10 07:01:48,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:48,583 INFO L475 AbstractCegarLoop]: Abstraction has 5153 states and 7808 transitions. [2019-09-10 07:01:48,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 7808 transitions. [2019-09-10 07:01:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 07:01:48,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:48,584 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] [2019-09-10 07:01:48,585 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:48,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:48,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1404763850, now seen corresponding path program 1 times [2019-09-10 07:01:48,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:48,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:48,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:48,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:48,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:48,653 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 07:01:48,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:48,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:01:48,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:48,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:01:48,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:01:48,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:01:48,655 INFO L87 Difference]: Start difference. First operand 5153 states and 7808 transitions. Second operand 5 states. [2019-09-10 07:01:49,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:49,004 INFO L93 Difference]: Finished difference Result 9139 states and 13761 transitions. [2019-09-10 07:01:49,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:49,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 07:01:49,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:49,064 INFO L225 Difference]: With dead ends: 9139 [2019-09-10 07:01:49,064 INFO L226 Difference]: Without dead ends: 9139 [2019-09-10 07:01:49,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:01:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9139 states. [2019-09-10 07:01:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9139 to 9137. [2019-09-10 07:01:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9137 states. [2019-09-10 07:01:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9137 states to 9137 states and 13760 transitions. [2019-09-10 07:01:49,353 INFO L78 Accepts]: Start accepts. Automaton has 9137 states and 13760 transitions. Word has length 59 [2019-09-10 07:01:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:49,356 INFO L475 AbstractCegarLoop]: Abstraction has 9137 states and 13760 transitions. [2019-09-10 07:01:49,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:01:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 9137 states and 13760 transitions. [2019-09-10 07:01:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 07:01:49,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:49,359 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] [2019-09-10 07:01:49,360 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:49,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:49,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1120231739, now seen corresponding path program 1 times [2019-09-10 07:01:49,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:49,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:49,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:49,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:49,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:49,509 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 07:01:49,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:49,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:01:49,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:49,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:01:49,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:01:49,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:01:49,512 INFO L87 Difference]: Start difference. First operand 9137 states and 13760 transitions. Second operand 5 states. [2019-09-10 07:01:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:49,735 INFO L93 Difference]: Finished difference Result 18689 states and 27712 transitions. [2019-09-10 07:01:49,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:01:49,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 07:01:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:49,808 INFO L225 Difference]: With dead ends: 18689 [2019-09-10 07:01:49,808 INFO L226 Difference]: Without dead ends: 18689 [2019-09-10 07:01:49,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:01:49,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18689 states. [2019-09-10 07:01:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18689 to 9585. [2019-09-10 07:01:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9585 states. [2019-09-10 07:01:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9585 states to 9585 states and 14208 transitions. [2019-09-10 07:01:50,081 INFO L78 Accepts]: Start accepts. Automaton has 9585 states and 14208 transitions. Word has length 59 [2019-09-10 07:01:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:50,082 INFO L475 AbstractCegarLoop]: Abstraction has 9585 states and 14208 transitions. [2019-09-10 07:01:50,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:01:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 9585 states and 14208 transitions. [2019-09-10 07:01:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 07:01:50,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:50,083 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] [2019-09-10 07:01:50,083 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:50,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:50,084 INFO L82 PathProgramCache]: Analyzing trace with hash -357825804, now seen corresponding path program 1 times [2019-09-10 07:01:50,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:50,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:50,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:50,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:50,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:50,164 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 07:01:50,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:50,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:50,165 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:50,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:50,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:50,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:50,166 INFO L87 Difference]: Start difference. First operand 9585 states and 14208 transitions. Second operand 3 states. [2019-09-10 07:01:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:50,223 INFO L93 Difference]: Finished difference Result 12061 states and 17687 transitions. [2019-09-10 07:01:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:50,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 07:01:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:50,251 INFO L225 Difference]: With dead ends: 12061 [2019-09-10 07:01:50,251 INFO L226 Difference]: Without dead ends: 12061 [2019-09-10 07:01:50,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:50,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12061 states. [2019-09-10 07:01:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12061 to 12003. [2019-09-10 07:01:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12003 states. [2019-09-10 07:01:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12003 states to 12003 states and 17630 transitions. [2019-09-10 07:01:50,576 INFO L78 Accepts]: Start accepts. Automaton has 12003 states and 17630 transitions. Word has length 60 [2019-09-10 07:01:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:50,576 INFO L475 AbstractCegarLoop]: Abstraction has 12003 states and 17630 transitions. [2019-09-10 07:01:50,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 12003 states and 17630 transitions. [2019-09-10 07:01:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:01:50,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:50,583 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:01:50,583 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:50,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1589729241, now seen corresponding path program 1 times [2019-09-10 07:01:50,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:50,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:50,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:50,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:50,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:50,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:01:50,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:01:50,897 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2019-09-10 07:01:50,900 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], [77], [80], [85], [96], [98], [101], [112], [114], [117], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [162], [167], [180], [182], [195], [203], [222], [233], [235], [248], [256], [275], [286], [288], [301], [309], [328], [339], [341], [343], [346], [349], [352], [354], [356], [411], [412], [416], [417], [418] [2019-09-10 07:01:50,952 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:01:50,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:01:51,118 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:01:51,550 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:01:51,560 INFO L272 AbstractInterpreter]: Visited 76 different actions 429 times. Merged at 45 different actions 308 times. Widened at 14 different actions 28 times. Performed 1381 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1381 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 49 fixpoints after 11 different actions. Largest state had 118 variables. [2019-09-10 07:01:51,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:51,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:01:51,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:01:51,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:01:51,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:51,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:01:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:51,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 07:01:51,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:01:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:01:51,844 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:01:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:01:52,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:01:52,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 07:01:52,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:01:52,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:01:52,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:01:52,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:01:52,166 INFO L87 Difference]: Start difference. First operand 12003 states and 17630 transitions. Second operand 12 states. [2019-09-10 07:02:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:01,987 INFO L93 Difference]: Finished difference Result 144861 states and 206895 transitions. [2019-09-10 07:02:01,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 07:02:01,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-09-10 07:02:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:02,320 INFO L225 Difference]: With dead ends: 144861 [2019-09-10 07:02:02,320 INFO L226 Difference]: Without dead ends: 144861 [2019-09-10 07:02:02,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3728 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1763, Invalid=8137, Unknown=0, NotChecked=0, Total=9900 [2019-09-10 07:02:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144861 states. [2019-09-10 07:02:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144861 to 36823. [2019-09-10 07:02:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36823 states. [2019-09-10 07:02:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36823 states to 36823 states and 53002 transitions. [2019-09-10 07:02:04,343 INFO L78 Accepts]: Start accepts. Automaton has 36823 states and 53002 transitions. Word has length 83 [2019-09-10 07:02:04,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:04,344 INFO L475 AbstractCegarLoop]: Abstraction has 36823 states and 53002 transitions. [2019-09-10 07:02:04,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:02:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 36823 states and 53002 transitions. [2019-09-10 07:02:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:02:04,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:04,361 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:02:04,362 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:04,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:04,362 INFO L82 PathProgramCache]: Analyzing trace with hash 972468303, now seen corresponding path program 1 times [2019-09-10 07:02:04,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:04,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:04,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:04,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:04,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:04,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:04,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:04,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:04,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:04,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:04,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:04,441 INFO L87 Difference]: Start difference. First operand 36823 states and 53002 transitions. Second operand 3 states. [2019-09-10 07:02:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:04,600 INFO L93 Difference]: Finished difference Result 55786 states and 79981 transitions. [2019-09-10 07:02:04,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:02:04,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:02:04,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:04,685 INFO L225 Difference]: With dead ends: 55786 [2019-09-10 07:02:04,685 INFO L226 Difference]: Without dead ends: 55786 [2019-09-10 07:02:04,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55786 states. [2019-09-10 07:02:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55786 to 55784. [2019-09-10 07:02:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55784 states. [2019-09-10 07:02:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55784 states to 55784 states and 79980 transitions. [2019-09-10 07:02:06,305 INFO L78 Accepts]: Start accepts. Automaton has 55784 states and 79980 transitions. Word has length 83 [2019-09-10 07:02:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:06,305 INFO L475 AbstractCegarLoop]: Abstraction has 55784 states and 79980 transitions. [2019-09-10 07:02:06,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:02:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 55784 states and 79980 transitions. [2019-09-10 07:02:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:02:06,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:06,316 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:06,316 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:06,317 INFO L82 PathProgramCache]: Analyzing trace with hash -256954202, now seen corresponding path program 1 times [2019-09-10 07:02:06,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:06,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:06,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:06,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:06,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 07:02:06,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:06,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:02:06,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:06,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:02:06,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:02:06,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:02:06,407 INFO L87 Difference]: Start difference. First operand 55784 states and 79980 transitions. Second operand 6 states. [2019-09-10 07:02:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:07,063 INFO L93 Difference]: Finished difference Result 154724 states and 219486 transitions. [2019-09-10 07:02:07,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:02:07,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-10 07:02:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:07,301 INFO L225 Difference]: With dead ends: 154724 [2019-09-10 07:02:07,301 INFO L226 Difference]: Without dead ends: 154724 [2019-09-10 07:02:07,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:02:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154724 states. [2019-09-10 07:02:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154724 to 154720. [2019-09-10 07:02:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154720 states. [2019-09-10 07:02:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154720 states to 154720 states and 219484 transitions. [2019-09-10 07:02:10,756 INFO L78 Accepts]: Start accepts. Automaton has 154720 states and 219484 transitions. Word has length 83 [2019-09-10 07:02:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:10,756 INFO L475 AbstractCegarLoop]: Abstraction has 154720 states and 219484 transitions. [2019-09-10 07:02:10,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:02:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 154720 states and 219484 transitions. [2019-09-10 07:02:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:02:10,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:10,777 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:10,777 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:10,777 INFO L82 PathProgramCache]: Analyzing trace with hash -526229301, now seen corresponding path program 1 times [2019-09-10 07:02:10,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:10,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:10,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:10,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:10,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:10,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:02:10,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:02:10,874 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2019-09-10 07:02:10,875 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], [77], [98], [101], [104], [107], [112], [114], [117], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [195], [203], [222], [233], [235], [248], [256], [275], [277], [280], [288], [291], [294], [297], [299], [301], [343], [356], [364], [383], [411], [412], [416], [417], [418] [2019-09-10 07:02:10,883 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:02:10,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:02:10,915 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:02:11,002 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:02:11,002 INFO L272 AbstractInterpreter]: Visited 68 different actions 152 times. Merged at 34 different actions 69 times. Widened at 2 different actions 2 times. Performed 628 root evaluator evaluations with a maximum evaluation depth of 5. Performed 628 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 3 different actions. Largest state had 118 variables. [2019-09-10 07:02:11,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:11,003 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:02:11,200 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 80.35% of their original sizes. [2019-09-10 07:02:11,201 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:02:15,343 INFO L420 sIntCurrentIteration]: We unified 82 AI predicates to 82 [2019-09-10 07:02:15,344 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:02:15,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:02:15,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [7] total 48 [2019-09-10 07:02:15,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:15,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 07:02:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 07:02:15,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1584, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:02:15,347 INFO L87 Difference]: Start difference. First operand 154720 states and 219484 transitions. Second operand 43 states. [2019-09-10 07:03:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:15,401 INFO L93 Difference]: Finished difference Result 374315 states and 520653 transitions. [2019-09-10 07:03:15,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 372 states. [2019-09-10 07:03:15,401 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-09-10 07:03:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:15,860 INFO L225 Difference]: With dead ends: 374315 [2019-09-10 07:03:15,860 INFO L226 Difference]: Without dead ends: 374315 [2019-09-10 07:03:15,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67896 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=16568, Invalid=132042, Unknown=0, NotChecked=0, Total=148610 [2019-09-10 07:03:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374315 states. [2019-09-10 07:03:19,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374315 to 196774. [2019-09-10 07:03:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196774 states. [2019-09-10 07:03:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196774 states to 196774 states and 277061 transitions. [2019-09-10 07:03:19,654 INFO L78 Accepts]: Start accepts. Automaton has 196774 states and 277061 transitions. Word has length 83 [2019-09-10 07:03:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:19,655 INFO L475 AbstractCegarLoop]: Abstraction has 196774 states and 277061 transitions. [2019-09-10 07:03:19,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 07:03:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 196774 states and 277061 transitions. [2019-09-10 07:03:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:03:19,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:19,687 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:19,687 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1752895755, now seen corresponding path program 1 times [2019-09-10 07:03:19,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:19,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:19,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:19,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:19,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:19,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:19,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:19,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:19,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:19,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:19,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:19,755 INFO L87 Difference]: Start difference. First operand 196774 states and 277061 transitions. Second operand 3 states. [2019-09-10 07:03:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:23,747 INFO L93 Difference]: Finished difference Result 262857 states and 365827 transitions. [2019-09-10 07:03:23,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:23,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:03:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:24,186 INFO L225 Difference]: With dead ends: 262857 [2019-09-10 07:03:24,186 INFO L226 Difference]: Without dead ends: 262857 [2019-09-10 07:03:24,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262857 states. [2019-09-10 07:03:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262857 to 261469. [2019-09-10 07:03:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261469 states. [2019-09-10 07:03:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261469 states to 261469 states and 364440 transitions. [2019-09-10 07:03:27,981 INFO L78 Accepts]: Start accepts. Automaton has 261469 states and 364440 transitions. Word has length 83 [2019-09-10 07:03:27,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:27,981 INFO L475 AbstractCegarLoop]: Abstraction has 261469 states and 364440 transitions. [2019-09-10 07:03:27,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 261469 states and 364440 transitions. [2019-09-10 07:03:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:03:28,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:28,004 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:28,004 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:28,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash 274444906, now seen corresponding path program 1 times [2019-09-10 07:03:28,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:28,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:28,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:28,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:28,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:28,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:28,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:28,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:28,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:28,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:28,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:28,059 INFO L87 Difference]: Start difference. First operand 261469 states and 364440 transitions. Second operand 3 states. [2019-09-10 07:03:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:28,832 INFO L93 Difference]: Finished difference Result 359204 states and 491355 transitions. [2019-09-10 07:03:28,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:28,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:03:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:29,321 INFO L225 Difference]: With dead ends: 359204 [2019-09-10 07:03:29,322 INFO L226 Difference]: Without dead ends: 359204 [2019-09-10 07:03:29,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:29,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359204 states. [2019-09-10 07:03:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359204 to 345287. [2019-09-10 07:03:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345287 states. [2019-09-10 07:03:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345287 states to 345287 states and 474106 transitions. [2019-09-10 07:03:38,771 INFO L78 Accepts]: Start accepts. Automaton has 345287 states and 474106 transitions. Word has length 83 [2019-09-10 07:03:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:38,771 INFO L475 AbstractCegarLoop]: Abstraction has 345287 states and 474106 transitions. [2019-09-10 07:03:38,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 345287 states and 474106 transitions. [2019-09-10 07:03:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:03:38,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:38,795 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:03:38,795 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:38,796 INFO L82 PathProgramCache]: Analyzing trace with hash -212390925, now seen corresponding path program 1 times [2019-09-10 07:03:38,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:38,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:38,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:38,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:38,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:38,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:03:38,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:03:38,878 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2019-09-10 07:03:38,879 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], [77], [98], [101], [112], [114], [117], [128], [130], [133], [136], [139], [144], [146], [149], [152], [154], [157], [158], [160], [169], [171], [174], [182], [185], [188], [191], [193], [195], [233], [235], [248], [256], [275], [286], [288], [301], [309], [328], [343], [356], [364], [383], [411], [412], [416], [417], [418] [2019-09-10 07:03:38,883 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:03:38,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:03:38,903 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:03:38,992 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:03:38,993 INFO L272 AbstractInterpreter]: Visited 68 different actions 169 times. Merged at 34 different actions 85 times. Never widened. Performed 619 root evaluator evaluations with a maximum evaluation depth of 5. Performed 619 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 3 different actions. Largest state had 118 variables. [2019-09-10 07:03:38,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:38,993 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:03:39,094 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 80.6% of their original sizes. [2019-09-10 07:03:39,094 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:03:41,032 INFO L420 sIntCurrentIteration]: We unified 82 AI predicates to 82 [2019-09-10 07:03:41,032 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:03:41,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:03:41,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [7] total 48 [2019-09-10 07:03:41,032 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:41,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 07:03:41,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 07:03:41,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1578, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:03:41,034 INFO L87 Difference]: Start difference. First operand 345287 states and 474106 transitions. Second operand 43 states. [2019-09-10 07:04:27,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:27,896 INFO L93 Difference]: Finished difference Result 644334 states and 877849 transitions. [2019-09-10 07:04:27,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2019-09-10 07:04:27,896 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-09-10 07:04:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:28,708 INFO L225 Difference]: With dead ends: 644334 [2019-09-10 07:04:28,708 INFO L226 Difference]: Without dead ends: 644334 [2019-09-10 07:04:28,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30834 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=8792, Invalid=62230, Unknown=0, NotChecked=0, Total=71022 [2019-09-10 07:04:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644334 states. [2019-09-10 07:04:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644334 to 364118. [2019-09-10 07:04:35,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364118 states. [2019-09-10 07:04:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364118 states to 364118 states and 498209 transitions. [2019-09-10 07:04:36,026 INFO L78 Accepts]: Start accepts. Automaton has 364118 states and 498209 transitions. Word has length 83 [2019-09-10 07:04:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:36,026 INFO L475 AbstractCegarLoop]: Abstraction has 364118 states and 498209 transitions. [2019-09-10 07:04:36,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 07:04:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 364118 states and 498209 transitions. [2019-09-10 07:04:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:04:36,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:36,046 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:36,046 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:36,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:36,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1701976494, now seen corresponding path program 1 times [2019-09-10 07:04:36,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:36,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:36,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:36,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:36,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:36,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:04:36,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:04:36,125 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 84 with the following transitions: [2019-09-10 07:04:36,126 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], [77], [98], [101], [112], [114], [117], [120], [123], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [195], [203], [222], [224], [227], [235], [238], [241], [244], [246], [248], [286], [288], [301], [309], [328], [343], [356], [364], [383], [411], [412], [416], [417], [418] [2019-09-10 07:04:36,129 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:04:36,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:04:36,139 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:04:36,183 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:04:36,184 INFO L272 AbstractInterpreter]: Visited 68 different actions 167 times. Merged at 34 different actions 82 times. Widened at 2 different actions 2 times. Performed 626 root evaluator evaluations with a maximum evaluation depth of 5. Performed 626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 3 different actions. Largest state had 118 variables. [2019-09-10 07:04:36,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:36,184 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:04:36,259 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 80.47% of their original sizes. [2019-09-10 07:04:36,259 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:04:39,480 INFO L420 sIntCurrentIteration]: We unified 82 AI predicates to 82 [2019-09-10 07:04:39,481 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:04:39,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:04:39,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [7] total 48 [2019-09-10 07:04:39,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:04:39,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 07:04:39,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 07:04:39,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1584, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:04:39,482 INFO L87 Difference]: Start difference. First operand 364118 states and 498209 transitions. Second operand 43 states. [2019-09-10 07:05:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:34,716 INFO L93 Difference]: Finished difference Result 722657 states and 978766 transitions. [2019-09-10 07:05:34,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 346 states. [2019-09-10 07:05:34,716 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-09-10 07:05:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:35,530 INFO L225 Difference]: With dead ends: 722657 [2019-09-10 07:05:35,531 INFO L226 Difference]: Without dead ends: 722657 [2019-09-10 07:05:35,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57355 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=13553, Invalid=114969, Unknown=0, NotChecked=0, Total=128522 [2019-09-10 07:05:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722657 states. [2019-09-10 07:05:48,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722657 to 392726. [2019-09-10 07:05:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392726 states. [2019-09-10 07:05:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392726 states to 392726 states and 536245 transitions. [2019-09-10 07:05:49,340 INFO L78 Accepts]: Start accepts. Automaton has 392726 states and 536245 transitions. Word has length 83 [2019-09-10 07:05:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:49,341 INFO L475 AbstractCegarLoop]: Abstraction has 392726 states and 536245 transitions. [2019-09-10 07:05:49,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 07:05:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 392726 states and 536245 transitions. [2019-09-10 07:05:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:05:49,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:49,357 INFO L399 BasicCegarLoop]: trace histogram [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 07:05:49,358 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:49,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:49,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1605418753, now seen corresponding path program 1 times [2019-09-10 07:05:49,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:49,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:49,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:49,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:49,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:49,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:49,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:05:49,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:49,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:05:49,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:05:49,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:49,420 INFO L87 Difference]: Start difference. First operand 392726 states and 536245 transitions. Second operand 3 states. [2019-09-10 07:05:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:50,148 INFO L93 Difference]: Finished difference Result 344424 states and 464613 transitions. [2019-09-10 07:05:50,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:05:50,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:05:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:51,980 INFO L225 Difference]: With dead ends: 344424 [2019-09-10 07:05:51,980 INFO L226 Difference]: Without dead ends: 344424 [2019-09-10 07:05:51,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:05:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344424 states. [2019-09-10 07:06:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344424 to 301047. [2019-09-10 07:06:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301047 states. [2019-09-10 07:06:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301047 states to 301047 states and 405468 transitions. [2019-09-10 07:06:01,036 INFO L78 Accepts]: Start accepts. Automaton has 301047 states and 405468 transitions. Word has length 84 [2019-09-10 07:06:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:01,036 INFO L475 AbstractCegarLoop]: Abstraction has 301047 states and 405468 transitions. [2019-09-10 07:06:01,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 301047 states and 405468 transitions. [2019-09-10 07:06:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:06:01,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:01,051 INFO L399 BasicCegarLoop]: trace histogram [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 07:06:01,052 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:01,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1227683816, now seen corresponding path program 1 times [2019-09-10 07:06:01,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:01,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:01,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:01,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:01,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:01,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:01,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:01,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:01,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:01,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:01,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:01,112 INFO L87 Difference]: Start difference. First operand 301047 states and 405468 transitions. Second operand 3 states. [2019-09-10 07:06:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:03,227 INFO L93 Difference]: Finished difference Result 342801 states and 453051 transitions. [2019-09-10 07:06:03,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:03,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:06:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:03,940 INFO L225 Difference]: With dead ends: 342801 [2019-09-10 07:06:03,941 INFO L226 Difference]: Without dead ends: 302922 [2019-09-10 07:06:03,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:04,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302922 states. [2019-09-10 07:06:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302922 to 287536. [2019-09-10 07:06:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287536 states. [2019-09-10 07:06:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287536 states to 287536 states and 381875 transitions. [2019-09-10 07:06:11,327 INFO L78 Accepts]: Start accepts. Automaton has 287536 states and 381875 transitions. Word has length 84 [2019-09-10 07:06:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:11,327 INFO L475 AbstractCegarLoop]: Abstraction has 287536 states and 381875 transitions. [2019-09-10 07:06:11,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 287536 states and 381875 transitions. [2019-09-10 07:06:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:06:11,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:11,345 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:11,345 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:11,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:11,346 INFO L82 PathProgramCache]: Analyzing trace with hash 993170858, now seen corresponding path program 1 times [2019-09-10 07:06:11,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:11,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:11,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:11,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:11,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:11,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:06:11,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:06:11,441 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2019-09-10 07:06:11,441 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], [77], [80], [85], [88], [91], [96], [98], [114], [117], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [195], [203], [222], [233], [235], [248], [256], [275], [288], [301], [309], [328], [330], [333], [341], [343], [346], [349], [352], [354], [356], [411], [412], [416], [417], [418] [2019-09-10 07:06:11,443 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:06:11,443 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:06:11,465 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:06:11,529 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:06:11,529 INFO L272 AbstractInterpreter]: Visited 70 different actions 151 times. Merged at 36 different actions 67 times. Widened at 1 different actions 1 times. Performed 596 root evaluator evaluations with a maximum evaluation depth of 5. Performed 596 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 4 different actions. Largest state had 118 variables. [2019-09-10 07:06:11,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:11,530 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:06:11,700 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 80.53% of their original sizes. [2019-09-10 07:06:11,700 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:06:14,556 INFO L420 sIntCurrentIteration]: We unified 84 AI predicates to 84 [2019-09-10 07:06:14,556 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:06:14,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:06:14,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [7] total 48 [2019-09-10 07:06:14,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:14,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 07:06:14,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 07:06:14,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1583, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 07:06:14,558 INFO L87 Difference]: Start difference. First operand 287536 states and 381875 transitions. Second operand 43 states. [2019-09-10 07:07:26,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:26,928 INFO L93 Difference]: Finished difference Result 553241 states and 726765 transitions. [2019-09-10 07:07:26,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 457 states. [2019-09-10 07:07:26,928 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 85 [2019-09-10 07:07:26,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:27,637 INFO L225 Difference]: With dead ends: 553241 [2019-09-10 07:07:27,638 INFO L226 Difference]: Without dead ends: 553230 [2019-09-10 07:07:27,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102808 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=24459, Invalid=196911, Unknown=0, NotChecked=0, Total=221370 [2019-09-10 07:07:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553230 states. [2019-09-10 07:07:32,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553230 to 310877. [2019-09-10 07:07:32,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310877 states. [2019-09-10 07:07:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310877 states to 310877 states and 410643 transitions. [2019-09-10 07:07:32,841 INFO L78 Accepts]: Start accepts. Automaton has 310877 states and 410643 transitions. Word has length 85 [2019-09-10 07:07:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:32,841 INFO L475 AbstractCegarLoop]: Abstraction has 310877 states and 410643 transitions. [2019-09-10 07:07:32,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 07:07:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 310877 states and 410643 transitions. [2019-09-10 07:07:32,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:07:32,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:32,859 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:07:32,860 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:32,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:32,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1459433209, now seen corresponding path program 1 times [2019-09-10 07:07:32,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:32,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:32,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:32,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:32,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:32,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:07:32,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:07:32,934 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2019-09-10 07:07:32,934 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], [77], [98], [101], [104], [107], [112], [114], [117], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [185], [188], [191], [193], [195], [233], [235], [248], [256], [275], [277], [280], [288], [291], [294], [297], [299], [301], [343], [356], [364], [383], [411], [412], [416], [417], [418] [2019-09-10 07:07:32,936 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:07:32,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:07:32,947 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:07:33,029 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:07:33,029 INFO L272 AbstractInterpreter]: Visited 70 different actions 224 times. Merged at 36 different actions 133 times. Widened at 4 different actions 5 times. Performed 817 root evaluator evaluations with a maximum evaluation depth of 5. Performed 817 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 11 fixpoints after 5 different actions. Largest state had 119 variables. [2019-09-10 07:07:33,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:33,030 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:07:33,184 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 80.45% of their original sizes. [2019-09-10 07:07:33,184 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:07:36,463 INFO L420 sIntCurrentIteration]: We unified 84 AI predicates to 84 [2019-09-10 07:07:36,464 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:07:36,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:07:36,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [45] imperfect sequences [7] total 50 [2019-09-10 07:07:36,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:36,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 07:07:36,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 07:07:36,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1741, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 07:07:36,465 INFO L87 Difference]: Start difference. First operand 310877 states and 410643 transitions. Second operand 45 states. [2019-09-10 07:08:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:36,456 INFO L93 Difference]: Finished difference Result 572694 states and 751195 transitions. [2019-09-10 07:08:36,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 422 states. [2019-09-10 07:08:36,456 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2019-09-10 07:08:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:37,172 INFO L225 Difference]: With dead ends: 572694 [2019-09-10 07:08:37,172 INFO L226 Difference]: Without dead ends: 572694 [2019-09-10 07:08:37,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87413 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=20117, Invalid=170415, Unknown=0, NotChecked=0, Total=190532 [2019-09-10 07:08:37,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572694 states. [2019-09-10 07:08:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572694 to 317761. [2019-09-10 07:08:43,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317761 states. [2019-09-10 07:08:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317761 states to 317761 states and 419108 transitions. [2019-09-10 07:08:43,560 INFO L78 Accepts]: Start accepts. Automaton has 317761 states and 419108 transitions. Word has length 85 [2019-09-10 07:08:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:43,560 INFO L475 AbstractCegarLoop]: Abstraction has 317761 states and 419108 transitions. [2019-09-10 07:08:43,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 07:08:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 317761 states and 419108 transitions. [2019-09-10 07:08:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:08:43,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:43,575 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:08:43,575 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:43,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:43,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1408002499, now seen corresponding path program 1 times [2019-09-10 07:08:43,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:43,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:43,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:43,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:43,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:43,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:08:43,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:08:43,669 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2019-09-10 07:08:43,670 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], [77], [98], [101], [104], [107], [112], [114], [117], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [195], [203], [222], [233], [235], [238], [241], [244], [246], [248], [277], [280], [288], [291], [294], [297], [299], [301], [343], [356], [364], [383], [411], [412], [416], [417], [418] [2019-09-10 07:08:43,672 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:08:43,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:08:43,683 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:08:43,786 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:08:43,787 INFO L272 AbstractInterpreter]: Visited 70 different actions 284 times. Merged at 36 different actions 186 times. Widened at 12 different actions 17 times. Performed 993 root evaluator evaluations with a maximum evaluation depth of 5. Performed 993 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 14 fixpoints after 8 different actions. Largest state had 119 variables. [2019-09-10 07:08:43,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:43,787 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:08:43,862 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 80.89% of their original sizes. [2019-09-10 07:08:43,863 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:08:45,828 INFO L420 sIntCurrentIteration]: We unified 84 AI predicates to 84 [2019-09-10 07:08:45,829 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:08:45,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:08:45,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [7] total 49 [2019-09-10 07:08:45,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:45,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-10 07:08:45,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-10 07:08:45,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1655, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 07:08:45,830 INFO L87 Difference]: Start difference. First operand 317761 states and 419108 transitions. Second operand 44 states. [2019-09-10 07:09:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:47,127 INFO L93 Difference]: Finished difference Result 644855 states and 842867 transitions. [2019-09-10 07:09:47,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 328 states. [2019-09-10 07:09:47,127 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2019-09-10 07:09:47,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:47,909 INFO L225 Difference]: With dead ends: 644855 [2019-09-10 07:09:47,909 INFO L226 Difference]: Without dead ends: 644855 [2019-09-10 07:09:47,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52426 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=13654, Invalid=105026, Unknown=0, NotChecked=0, Total=118680 [2019-09-10 07:09:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644855 states. [2019-09-10 07:09:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644855 to 351095. [2019-09-10 07:09:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351095 states. [2019-09-10 07:09:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351095 states to 351095 states and 461912 transitions. [2019-09-10 07:09:54,306 INFO L78 Accepts]: Start accepts. Automaton has 351095 states and 461912 transitions. Word has length 85 [2019-09-10 07:09:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:54,306 INFO L475 AbstractCegarLoop]: Abstraction has 351095 states and 461912 transitions. [2019-09-10 07:09:54,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-10 07:09:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 351095 states and 461912 transitions. [2019-09-10 07:09:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:09:54,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:54,320 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:54,321 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:54,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:54,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1550128860, now seen corresponding path program 1 times [2019-09-10 07:09:54,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:54,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:54,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:54,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:54,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:54,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:09:54,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:09:54,405 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2019-09-10 07:09:54,405 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], [77], [98], [101], [112], [114], [117], [120], [123], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [185], [188], [191], [193], [195], [224], [227], [235], [238], [241], [244], [246], [248], [286], [288], [301], [309], [328], [343], [356], [364], [383], [411], [412], [416], [417], [418] [2019-09-10 07:09:54,407 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:09:54,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:09:54,420 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:09:54,507 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:09:54,508 INFO L272 AbstractInterpreter]: Visited 70 different actions 275 times. Merged at 36 different actions 179 times. Widened at 8 different actions 9 times. Performed 951 root evaluator evaluations with a maximum evaluation depth of 5. Performed 951 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 7 different actions. Largest state had 119 variables. [2019-09-10 07:09:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:54,508 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:09:54,591 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 80.56% of their original sizes. [2019-09-10 07:09:54,591 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:09:57,898 INFO L420 sIntCurrentIteration]: We unified 84 AI predicates to 84 [2019-09-10 07:09:57,899 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:09:57,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:09:57,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [45] imperfect sequences [7] total 50 [2019-09-10 07:09:57,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:57,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 07:09:57,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 07:09:57,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1743, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 07:09:57,900 INFO L87 Difference]: Start difference. First operand 351095 states and 461912 transitions. Second operand 45 states. [2019-09-10 07:11:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:03,808 INFO L93 Difference]: Finished difference Result 673024 states and 878981 transitions. [2019-09-10 07:11:03,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 392 states. [2019-09-10 07:11:03,808 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 85 [2019-09-10 07:11:03,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:05,106 INFO L225 Difference]: With dead ends: 673024 [2019-09-10 07:11:05,107 INFO L226 Difference]: Without dead ends: 673024 [2019-09-10 07:11:05,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74593 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=16468, Invalid=148774, Unknown=0, NotChecked=0, Total=165242 [2019-09-10 07:11:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673024 states. [2019-09-10 07:11:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673024 to 372238. [2019-09-10 07:11:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372238 states. [2019-09-10 07:11:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372238 states to 372238 states and 488767 transitions. [2019-09-10 07:11:15,840 INFO L78 Accepts]: Start accepts. Automaton has 372238 states and 488767 transitions. Word has length 85 [2019-09-10 07:11:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:15,841 INFO L475 AbstractCegarLoop]: Abstraction has 372238 states and 488767 transitions. [2019-09-10 07:11:15,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 07:11:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 372238 states and 488767 transitions. [2019-09-10 07:11:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:11:15,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:15,856 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:15,856 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:15,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1491728894, now seen corresponding path program 1 times [2019-09-10 07:11:15,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:15,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:15,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:15,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:15,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 07:11:15,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:15,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:11:15,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:15,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:11:15,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:11:15,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:11:15,939 INFO L87 Difference]: Start difference. First operand 372238 states and 488767 transitions. Second operand 6 states. [2019-09-10 07:11:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:18,166 INFO L93 Difference]: Finished difference Result 556693 states and 739662 transitions. [2019-09-10 07:11:18,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:11:18,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-10 07:11:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:18,829 INFO L225 Difference]: With dead ends: 556693 [2019-09-10 07:11:18,830 INFO L226 Difference]: Without dead ends: 556168 [2019-09-10 07:11:18,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:11:19,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556168 states. [2019-09-10 07:11:30,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556168 to 462323. [2019-09-10 07:11:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462323 states. [2019-09-10 07:11:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462323 states to 462323 states and 609402 transitions. [2019-09-10 07:11:31,725 INFO L78 Accepts]: Start accepts. Automaton has 462323 states and 609402 transitions. Word has length 86 [2019-09-10 07:11:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:31,725 INFO L475 AbstractCegarLoop]: Abstraction has 462323 states and 609402 transitions. [2019-09-10 07:11:31,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:11:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 462323 states and 609402 transitions. [2019-09-10 07:11:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:11:31,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:31,740 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:31,740 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:31,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:31,740 INFO L82 PathProgramCache]: Analyzing trace with hash 657901357, now seen corresponding path program 1 times [2019-09-10 07:11:31,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:31,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:31,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:31,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:31,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:11:31,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:31,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:31,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:31,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:31,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:31,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:31,788 INFO L87 Difference]: Start difference. First operand 462323 states and 609402 transitions. Second operand 3 states. [2019-09-10 07:11:32,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:32,786 INFO L93 Difference]: Finished difference Result 428366 states and 563414 transitions. [2019-09-10 07:11:32,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:32,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:11:32,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:33,350 INFO L225 Difference]: With dead ends: 428366 [2019-09-10 07:11:33,350 INFO L226 Difference]: Without dead ends: 428366 [2019-09-10 07:11:33,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428366 states. [2019-09-10 07:11:43,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428366 to 426298. [2019-09-10 07:11:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426298 states. [2019-09-10 07:11:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426298 states to 426298 states and 560910 transitions. [2019-09-10 07:11:45,159 INFO L78 Accepts]: Start accepts. Automaton has 426298 states and 560910 transitions. Word has length 86 [2019-09-10 07:11:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:45,159 INFO L475 AbstractCegarLoop]: Abstraction has 426298 states and 560910 transitions. [2019-09-10 07:11:45,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:11:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 426298 states and 560910 transitions. [2019-09-10 07:11:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:11:45,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:45,172 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:11:45,172 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:45,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1248252319, now seen corresponding path program 1 times [2019-09-10 07:11:45,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:45,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:45,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:45,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:45,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:11:45,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:45,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:11:45,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:45,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:11:45,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:11:45,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:11:45,264 INFO L87 Difference]: Start difference. First operand 426298 states and 560910 transitions. Second operand 6 states. [2019-09-10 07:11:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:46,938 INFO L93 Difference]: Finished difference Result 604156 states and 802835 transitions. [2019-09-10 07:11:46,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:11:46,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-10 07:11:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:47,707 INFO L225 Difference]: With dead ends: 604156 [2019-09-10 07:11:47,707 INFO L226 Difference]: Without dead ends: 604143 [2019-09-10 07:11:47,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:11:49,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604143 states. [2019-09-10 07:12:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604143 to 494796. [2019-09-10 07:12:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494796 states. [2019-09-10 07:12:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494796 states to 494796 states and 653164 transitions. [2019-09-10 07:12:03,243 INFO L78 Accepts]: Start accepts. Automaton has 494796 states and 653164 transitions. Word has length 86 [2019-09-10 07:12:03,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:03,243 INFO L475 AbstractCegarLoop]: Abstraction has 494796 states and 653164 transitions. [2019-09-10 07:12:03,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:12:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 494796 states and 653164 transitions. [2019-09-10 07:12:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:12:03,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:03,258 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:12:03,258 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:03,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:03,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1639993174, now seen corresponding path program 1 times [2019-09-10 07:12:03,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:03,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:03,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:03,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:03,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 07:12:03,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:03,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:12:03,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:03,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:12:03,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:12:03,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:12:03,336 INFO L87 Difference]: Start difference. First operand 494796 states and 653164 transitions. Second operand 6 states. [2019-09-10 07:12:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:05,915 INFO L93 Difference]: Finished difference Result 660975 states and 878918 transitions. [2019-09-10 07:12:05,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:12:05,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-10 07:12:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:06,718 INFO L225 Difference]: With dead ends: 660975 [2019-09-10 07:12:06,719 INFO L226 Difference]: Without dead ends: 660975 [2019-09-10 07:12:06,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:12:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660975 states. [2019-09-10 07:12:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660975 to 551628. [2019-09-10 07:12:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551628 states. [2019-09-10 07:12:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551628 states to 551628 states and 729482 transitions. [2019-09-10 07:12:20,904 INFO L78 Accepts]: Start accepts. Automaton has 551628 states and 729482 transitions. Word has length 86 [2019-09-10 07:12:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:20,904 INFO L475 AbstractCegarLoop]: Abstraction has 551628 states and 729482 transitions. [2019-09-10 07:12:20,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:12:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 551628 states and 729482 transitions. [2019-09-10 07:12:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:12:20,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:20,918 INFO L399 BasicCegarLoop]: trace histogram [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 07:12:20,918 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:20,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:20,918 INFO L82 PathProgramCache]: Analyzing trace with hash 738156312, now seen corresponding path program 1 times [2019-09-10 07:12:20,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:20,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:20,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:20,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:20,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:20,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:20,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:12:20,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:20,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:12:20,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:12:20,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:12:20,972 INFO L87 Difference]: Start difference. First operand 551628 states and 729482 transitions. Second operand 3 states. [2019-09-10 07:12:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:23,295 INFO L93 Difference]: Finished difference Result 501200 states and 656094 transitions. [2019-09-10 07:12:23,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:12:23,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-10 07:12:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:23,890 INFO L225 Difference]: With dead ends: 501200 [2019-09-10 07:12:23,890 INFO L226 Difference]: Without dead ends: 501200 [2019-09-10 07:12:23,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:12:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501200 states. [2019-09-10 07:12:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501200 to 499773. [2019-09-10 07:12:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499773 states. [2019-09-10 07:12:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499773 states to 499773 states and 654492 transitions. [2019-09-10 07:12:36,741 INFO L78 Accepts]: Start accepts. Automaton has 499773 states and 654492 transitions. Word has length 87 [2019-09-10 07:12:36,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:36,741 INFO L475 AbstractCegarLoop]: Abstraction has 499773 states and 654492 transitions. [2019-09-10 07:12:36,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:12:36,741 INFO L276 IsEmpty]: Start isEmpty. Operand 499773 states and 654492 transitions. [2019-09-10 07:12:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:12:36,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:36,755 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:12:36,755 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:36,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:36,755 INFO L82 PathProgramCache]: Analyzing trace with hash 544014168, now seen corresponding path program 1 times [2019-09-10 07:12:36,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:36,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:36,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:36,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:36,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:12:36,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:36,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:12:36,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:36,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:12:36,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:12:36,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:12:36,828 INFO L87 Difference]: Start difference. First operand 499773 states and 654492 transitions. Second operand 6 states. [2019-09-10 07:12:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:39,592 INFO L93 Difference]: Finished difference Result 587607 states and 773380 transitions. [2019-09-10 07:12:39,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:12:39,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-09-10 07:12:39,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:40,312 INFO L225 Difference]: With dead ends: 587607 [2019-09-10 07:12:40,313 INFO L226 Difference]: Without dead ends: 587594 [2019-09-10 07:12:40,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:12:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587594 states. [2019-09-10 07:12:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587594 to 536733. [2019-09-10 07:12:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536733 states. [2019-09-10 07:12:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536733 states to 536733 states and 703746 transitions. [2019-09-10 07:12:56,792 INFO L78 Accepts]: Start accepts. Automaton has 536733 states and 703746 transitions. Word has length 87 [2019-09-10 07:12:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:56,792 INFO L475 AbstractCegarLoop]: Abstraction has 536733 states and 703746 transitions. [2019-09-10 07:12:56,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:12:56,792 INFO L276 IsEmpty]: Start isEmpty. Operand 536733 states and 703746 transitions. [2019-09-10 07:12:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:12:56,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:56,807 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:12:56,808 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:56,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:56,808 INFO L82 PathProgramCache]: Analyzing trace with hash -159617555, now seen corresponding path program 1 times [2019-09-10 07:12:56,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:56,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:56,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:56,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:56,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:56,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:12:56,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:12:56,876 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-09-10 07:12:56,877 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], [77], [80], [85], [88], [91], [96], [98], [101], [104], [107], [112], [114], [117], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [195], [203], [222], [233], [235], [248], [256], [275], [277], [280], [288], [291], [294], [297], [299], [301], [330], [333], [341], [343], [346], [349], [352], [354], [356], [411], [412], [416], [417], [418] [2019-09-10 07:12:56,878 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:12:56,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:12:56,888 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:12:56,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:12:56,993 INFO L272 AbstractInterpreter]: Visited 79 different actions 333 times. Merged at 47 different actions 219 times. Widened at 7 different actions 13 times. Performed 1114 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1114 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 24 fixpoints after 10 different actions. Largest state had 119 variables. [2019-09-10 07:12:56,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:56,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:12:56,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:12:56,994 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:12:57,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:57,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:12:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:57,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:12:57,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:12:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:57,178 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:12:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:12:57,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:12:57,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 07:12:57,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:12:57,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:12:57,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:12:57,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:12:57,251 INFO L87 Difference]: Start difference. First operand 536733 states and 703746 transitions. Second operand 11 states. [2019-09-10 07:13:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:00,032 INFO L93 Difference]: Finished difference Result 690566 states and 900571 transitions. [2019-09-10 07:13:00,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:13:00,033 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-10 07:13:00,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:00,873 INFO L225 Difference]: With dead ends: 690566 [2019-09-10 07:13:00,873 INFO L226 Difference]: Without dead ends: 690566 [2019-09-10 07:13:00,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 170 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:13:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690566 states.