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.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:57:35,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:57:35,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:57:35,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:57:35,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:57:35,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:57:35,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:57:35,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:57:35,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:57:35,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:57:35,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:57:35,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:57:35,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:57:35,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:57:35,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:57:35,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:57:35,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:57:35,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:57:35,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:57:35,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:57:35,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:57:35,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:57:35,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:57:35,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:57:35,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:57:35,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:57:35,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:57:35,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:57:35,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:57:35,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:57:35,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:57:35,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:57:35,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:57:35,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:57:35,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:57:35,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:57:35,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:57:35,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:57:35,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:57:35,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:57:35,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:57:35,276 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 06:57:35,304 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:57:35,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:57:35,305 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:57:35,306 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:57:35,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:57:35,306 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:57:35,307 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:57:35,307 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:57:35,307 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:57:35,307 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:57:35,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:57:35,310 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:57:35,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:57:35,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:57:35,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:57:35,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:57:35,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:57:35,311 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:57:35,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:57:35,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:57:35,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:57:35,312 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:57:35,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:57:35,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:57:35,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:57:35,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:57:35,313 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:57:35,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:57:35,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:57:35,314 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:57:35,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:57:35,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:57:35,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:57:35,370 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:57:35,371 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:57:35,371 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.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:57:35,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14da937e7/3b95d04e0dd841debde2c8e9a349256a/FLAG644e8a0cd [2019-09-10 06:57:35,957 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:57:35,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:57:35,970 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14da937e7/3b95d04e0dd841debde2c8e9a349256a/FLAG644e8a0cd [2019-09-10 06:57:36,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14da937e7/3b95d04e0dd841debde2c8e9a349256a [2019-09-10 06:57:36,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:57:36,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:57:36,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:57:36,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:57:36,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:57:36,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:57:36" (1/1) ... [2019-09-10 06:57:36,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45625c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:36, skipping insertion in model container [2019-09-10 06:57:36,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:57:36" (1/1) ... [2019-09-10 06:57:36,332 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:57:36,388 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:57:36,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:57:36,802 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:57:36,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:57:36,928 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:57:36,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:36 WrapperNode [2019-09-10 06:57:36,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:57:36,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:57:36,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:57:36,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:57:36,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:36" (1/1) ... [2019-09-10 06:57:36,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:36" (1/1) ... [2019-09-10 06:57:36,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:36" (1/1) ... [2019-09-10 06:57:36,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:36" (1/1) ... [2019-09-10 06:57:36,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:36" (1/1) ... [2019-09-10 06:57:37,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:36" (1/1) ... [2019-09-10 06:57:37,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:36" (1/1) ... [2019-09-10 06:57:37,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:57:37,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:57:37,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:57:37,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:57:37,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:36" (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 06:57:37,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:57:37,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:57:37,081 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:57:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:57:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:57:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:57:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:57:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:57:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:57:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:57:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:57:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:57:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:57:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:57:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:57:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:57:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:57:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:57:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:57:37,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:57:37,801 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:57:37,802 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:57:37,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:57:37 BoogieIcfgContainer [2019-09-10 06:57:37,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:57:37,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:57:37,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:57:37,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:57:37,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:57:36" (1/3) ... [2019-09-10 06:57:37,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11967ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:57:37, skipping insertion in model container [2019-09-10 06:57:37,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:57:36" (2/3) ... [2019-09-10 06:57:37,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11967ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:57:37, skipping insertion in model container [2019-09-10 06:57:37,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:57:37" (3/3) ... [2019-09-10 06:57:37,813 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:57:37,828 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:57:37,849 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:57:37,869 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:57:37,911 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:57:37,911 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:57:37,912 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:57:37,912 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:57:37,912 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:57:37,913 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:57:37,913 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:57:37,913 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:57:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states. [2019-09-10 06:57:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 06:57:37,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:37,969 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] [2019-09-10 06:57:37,972 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:37,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1880463615, now seen corresponding path program 1 times [2019-09-10 06:57:37,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:38,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:38,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:38,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:38,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:38,438 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 06:57:38,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:38,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:38,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:38,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:38,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:38,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:38,464 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 3 states. [2019-09-10 06:57:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:38,544 INFO L93 Difference]: Finished difference Result 177 states and 279 transitions. [2019-09-10 06:57:38,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:38,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-10 06:57:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:38,572 INFO L225 Difference]: With dead ends: 177 [2019-09-10 06:57:38,572 INFO L226 Difference]: Without dead ends: 169 [2019-09-10 06:57:38,576 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 06:57:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-10 06:57:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2019-09-10 06:57:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-09-10 06:57:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2019-09-10 06:57:38,647 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 52 [2019-09-10 06:57:38,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:38,647 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2019-09-10 06:57:38,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2019-09-10 06:57:38,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 06:57:38,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:38,650 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 06:57:38,651 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:38,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:38,651 INFO L82 PathProgramCache]: Analyzing trace with hash 246988582, now seen corresponding path program 1 times [2019-09-10 06:57:38,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:38,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:38,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:38,862 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 06:57:38,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:38,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:38,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:38,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:38,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:38,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:38,869 INFO L87 Difference]: Start difference. First operand 167 states and 247 transitions. Second operand 3 states. [2019-09-10 06:57:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:38,927 INFO L93 Difference]: Finished difference Result 271 states and 409 transitions. [2019-09-10 06:57:38,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:38,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-10 06:57:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:38,931 INFO L225 Difference]: With dead ends: 271 [2019-09-10 06:57:38,931 INFO L226 Difference]: Without dead ends: 271 [2019-09-10 06:57:38,932 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 06:57:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-10 06:57:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2019-09-10 06:57:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-10 06:57:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 408 transitions. [2019-09-10 06:57:38,957 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 408 transitions. Word has length 53 [2019-09-10 06:57:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:38,958 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 408 transitions. [2019-09-10 06:57:38,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 408 transitions. [2019-09-10 06:57:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 06:57:38,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:38,960 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 06:57:38,961 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:38,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash 528190942, now seen corresponding path program 1 times [2019-09-10 06:57:38,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:38,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:38,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:38,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:39,062 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 06:57:39,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:39,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:39,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:39,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:39,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:39,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:39,064 INFO L87 Difference]: Start difference. First operand 269 states and 408 transitions. Second operand 3 states. [2019-09-10 06:57:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:39,095 INFO L93 Difference]: Finished difference Result 443 states and 677 transitions. [2019-09-10 06:57:39,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:39,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-10 06:57:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:39,100 INFO L225 Difference]: With dead ends: 443 [2019-09-10 06:57:39,100 INFO L226 Difference]: Without dead ends: 443 [2019-09-10 06:57:39,101 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 06:57:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-10 06:57:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2019-09-10 06:57:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-09-10 06:57:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 676 transitions. [2019-09-10 06:57:39,140 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 676 transitions. Word has length 54 [2019-09-10 06:57:39,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:39,141 INFO L475 AbstractCegarLoop]: Abstraction has 441 states and 676 transitions. [2019-09-10 06:57:39,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:39,141 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 676 transitions. [2019-09-10 06:57:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 06:57:39,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:39,145 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:57:39,145 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:39,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:39,146 INFO L82 PathProgramCache]: Analyzing trace with hash -154098801, now seen corresponding path program 1 times [2019-09-10 06:57:39,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:39,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:39,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:39,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:39,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:39,272 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 06:57:39,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:39,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:39,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:39,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:39,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:39,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:39,275 INFO L87 Difference]: Start difference. First operand 441 states and 676 transitions. Second operand 6 states. [2019-09-10 06:57:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:39,466 INFO L93 Difference]: Finished difference Result 2081 states and 3240 transitions. [2019-09-10 06:57:39,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:57:39,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-10 06:57:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:39,483 INFO L225 Difference]: With dead ends: 2081 [2019-09-10 06:57:39,483 INFO L226 Difference]: Without dead ends: 2081 [2019-09-10 06:57:39,484 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 06:57:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2019-09-10 06:57:39,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 849. [2019-09-10 06:57:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-09-10 06:57:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1304 transitions. [2019-09-10 06:57:39,532 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1304 transitions. Word has length 55 [2019-09-10 06:57:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:39,532 INFO L475 AbstractCegarLoop]: Abstraction has 849 states and 1304 transitions. [2019-09-10 06:57:39,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1304 transitions. [2019-09-10 06:57:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 06:57:39,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:39,535 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 06:57:39,535 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:39,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:39,535 INFO L82 PathProgramCache]: Analyzing trace with hash -500628293, now seen corresponding path program 1 times [2019-09-10 06:57:39,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:39,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:39,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:39,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:39,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:39,688 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 06:57:39,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:39,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:39,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:39,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:39,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:39,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:39,691 INFO L87 Difference]: Start difference. First operand 849 states and 1304 transitions. Second operand 6 states. [2019-09-10 06:57:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:39,857 INFO L93 Difference]: Finished difference Result 2895 states and 4435 transitions. [2019-09-10 06:57:39,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:57:39,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-10 06:57:39,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:39,876 INFO L225 Difference]: With dead ends: 2895 [2019-09-10 06:57:39,876 INFO L226 Difference]: Without dead ends: 2895 [2019-09-10 06:57:39,877 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 06:57:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2019-09-10 06:57:39,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2889. [2019-09-10 06:57:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2019-09-10 06:57:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4432 transitions. [2019-09-10 06:57:39,951 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4432 transitions. Word has length 56 [2019-09-10 06:57:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:39,951 INFO L475 AbstractCegarLoop]: Abstraction has 2889 states and 4432 transitions. [2019-09-10 06:57:39,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4432 transitions. [2019-09-10 06:57:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:57:39,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:39,954 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 06:57:39,954 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:39,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:39,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1812681259, now seen corresponding path program 1 times [2019-09-10 06:57:39,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:39,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:39,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:39,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:39,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:40,017 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 06:57:40,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:40,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:40,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:40,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:40,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:40,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:40,019 INFO L87 Difference]: Start difference. First operand 2889 states and 4432 transitions. Second operand 3 states. [2019-09-10 06:57:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:40,069 INFO L93 Difference]: Finished difference Result 4915 states and 7425 transitions. [2019-09-10 06:57:40,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:40,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-10 06:57:40,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:40,096 INFO L225 Difference]: With dead ends: 4915 [2019-09-10 06:57:40,096 INFO L226 Difference]: Without dead ends: 4915 [2019-09-10 06:57:40,097 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 06:57:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2019-09-10 06:57:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4913. [2019-09-10 06:57:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4913 states. [2019-09-10 06:57:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4913 states to 4913 states and 7424 transitions. [2019-09-10 06:57:40,219 INFO L78 Accepts]: Start accepts. Automaton has 4913 states and 7424 transitions. Word has length 58 [2019-09-10 06:57:40,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:40,219 INFO L475 AbstractCegarLoop]: Abstraction has 4913 states and 7424 transitions. [2019-09-10 06:57:40,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 4913 states and 7424 transitions. [2019-09-10 06:57:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:57:40,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:40,221 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 06:57:40,222 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:40,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:40,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1907951364, now seen corresponding path program 1 times [2019-09-10 06:57:40,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:40,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:40,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:40,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:40,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:40,349 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 06:57:40,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:40,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:57:40,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:40,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:57:40,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:57:40,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:57:40,351 INFO L87 Difference]: Start difference. First operand 4913 states and 7424 transitions. Second operand 6 states. [2019-09-10 06:57:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:40,723 INFO L93 Difference]: Finished difference Result 14341 states and 21538 transitions. [2019-09-10 06:57:40,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:57:40,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-09-10 06:57:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:40,821 INFO L225 Difference]: With dead ends: 14341 [2019-09-10 06:57:40,821 INFO L226 Difference]: Without dead ends: 14341 [2019-09-10 06:57:40,821 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 06:57:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14341 states. [2019-09-10 06:57:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14341 to 14337. [2019-09-10 06:57:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14337 states. [2019-09-10 06:57:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14337 states to 14337 states and 21536 transitions. [2019-09-10 06:57:41,277 INFO L78 Accepts]: Start accepts. Automaton has 14337 states and 21536 transitions. Word has length 58 [2019-09-10 06:57:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:41,278 INFO L475 AbstractCegarLoop]: Abstraction has 14337 states and 21536 transitions. [2019-09-10 06:57:41,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:57:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 14337 states and 21536 transitions. [2019-09-10 06:57:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 06:57:41,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:41,279 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 06:57:41,280 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:41,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1093539369, now seen corresponding path program 1 times [2019-09-10 06:57:41,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:41,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:41,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:41,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:41,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:41,370 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 06:57:41,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:41,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:57:41,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:41,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:57:41,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:57:41,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:57:41,372 INFO L87 Difference]: Start difference. First operand 14337 states and 21536 transitions. Second operand 5 states. [2019-09-10 06:57:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:41,515 INFO L93 Difference]: Finished difference Result 29409 states and 43424 transitions. [2019-09-10 06:57:41,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:57:41,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-10 06:57:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:41,582 INFO L225 Difference]: With dead ends: 29409 [2019-09-10 06:57:41,583 INFO L226 Difference]: Without dead ends: 29409 [2019-09-10 06:57:41,583 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 06:57:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29409 states. [2019-09-10 06:57:41,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29409 to 15105. [2019-09-10 06:57:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15105 states. [2019-09-10 06:57:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15105 states to 15105 states and 22304 transitions. [2019-09-10 06:57:42,016 INFO L78 Accepts]: Start accepts. Automaton has 15105 states and 22304 transitions. Word has length 58 [2019-09-10 06:57:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:42,016 INFO L475 AbstractCegarLoop]: Abstraction has 15105 states and 22304 transitions. [2019-09-10 06:57:42,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:57:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 15105 states and 22304 transitions. [2019-09-10 06:57:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 06:57:42,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:42,018 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 06:57:42,018 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:42,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:42,018 INFO L82 PathProgramCache]: Analyzing trace with hash -450398192, now seen corresponding path program 1 times [2019-09-10 06:57:42,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:42,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:42,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:42,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:42,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:42,095 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 06:57:42,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:57:42,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:57:42,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:42,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:57:42,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:57:42,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:57:42,096 INFO L87 Difference]: Start difference. First operand 15105 states and 22304 transitions. Second operand 3 states. [2019-09-10 06:57:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:57:42,170 INFO L93 Difference]: Finished difference Result 21657 states and 31595 transitions. [2019-09-10 06:57:42,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:57:42,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-10 06:57:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:57:42,213 INFO L225 Difference]: With dead ends: 21657 [2019-09-10 06:57:42,213 INFO L226 Difference]: Without dead ends: 21657 [2019-09-10 06:57:42,214 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 06:57:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21657 states. [2019-09-10 06:57:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21657 to 21487. [2019-09-10 06:57:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21487 states. [2019-09-10 06:57:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21487 states to 21487 states and 31426 transitions. [2019-09-10 06:57:43,091 INFO L78 Accepts]: Start accepts. Automaton has 21487 states and 31426 transitions. Word has length 59 [2019-09-10 06:57:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:57:43,092 INFO L475 AbstractCegarLoop]: Abstraction has 21487 states and 31426 transitions. [2019-09-10 06:57:43,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:57:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 21487 states and 31426 transitions. [2019-09-10 06:57:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:57:43,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:57:43,100 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] [2019-09-10 06:57:43,100 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:57:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash 828250558, now seen corresponding path program 1 times [2019-09-10 06:57:43,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:57:43,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:43,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:57:43,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:57:43,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:57:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:57:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:57:43,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:57:43,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:57:43,239 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2019-09-10 06:57:43,242 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], [392], [393], [397], [398], [399] [2019-09-10 06:57:43,295 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:57:43,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:57:43,472 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:57:43,726 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:57:43,729 INFO L272 AbstractInterpreter]: Visited 67 different actions 150 times. Merged at 33 different actions 68 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 06:57:43,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:57:43,735 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:57:44,033 INFO L227 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 82.31% of their original sizes. [2019-09-10 06:57:44,034 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:57:46,195 INFO L420 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2019-09-10 06:57:46,196 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:57:46,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:57:46,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [7] total 48 [2019-09-10 06:57:46,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:57:46,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 06:57:46,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 06:57:46,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1582, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:57:46,199 INFO L87 Difference]: Start difference. First operand 21487 states and 31426 transitions. Second operand 43 states. [2019-09-10 06:58:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:34,877 INFO L93 Difference]: Finished difference Result 74811 states and 105197 transitions. [2019-09-10 06:58:34,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 356 states. [2019-09-10 06:58:34,877 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 81 [2019-09-10 06:58:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:35,055 INFO L225 Difference]: With dead ends: 74811 [2019-09-10 06:58:35,056 INFO L226 Difference]: Without dead ends: 74811 [2019-09-10 06:58:35,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61851 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=15650, Invalid=121620, Unknown=0, NotChecked=0, Total=137270 [2019-09-10 06:58:35,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74811 states. [2019-09-10 06:58:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74811 to 34346. [2019-09-10 06:58:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34346 states. [2019-09-10 06:58:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34346 states to 34346 states and 49283 transitions. [2019-09-10 06:58:36,190 INFO L78 Accepts]: Start accepts. Automaton has 34346 states and 49283 transitions. Word has length 81 [2019-09-10 06:58:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:36,190 INFO L475 AbstractCegarLoop]: Abstraction has 34346 states and 49283 transitions. [2019-09-10 06:58:36,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 06:58:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 34346 states and 49283 transitions. [2019-09-10 06:58:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:58:36,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:36,205 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] [2019-09-10 06:58:36,205 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:36,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:36,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1871602046, now seen corresponding path program 1 times [2019-09-10 06:58:36,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:36,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:36,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:36,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:36,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:36,286 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 06:58:36,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:36,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:36,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:36,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:36,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:36,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:36,288 INFO L87 Difference]: Start difference. First operand 34346 states and 49283 transitions. Second operand 3 states. [2019-09-10 06:58:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:36,423 INFO L93 Difference]: Finished difference Result 46263 states and 65398 transitions. [2019-09-10 06:58:36,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:36,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 06:58:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:36,534 INFO L225 Difference]: With dead ends: 46263 [2019-09-10 06:58:36,534 INFO L226 Difference]: Without dead ends: 46263 [2019-09-10 06:58:36,535 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 06:58:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46263 states. [2019-09-10 06:58:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46263 to 43835. [2019-09-10 06:58:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43835 states. [2019-09-10 06:58:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43835 states to 43835 states and 62205 transitions. [2019-09-10 06:58:38,501 INFO L78 Accepts]: Start accepts. Automaton has 43835 states and 62205 transitions. Word has length 81 [2019-09-10 06:58:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:38,501 INFO L475 AbstractCegarLoop]: Abstraction has 43835 states and 62205 transitions. [2019-09-10 06:58:38,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 43835 states and 62205 transitions. [2019-09-10 06:58:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:58:38,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:38,514 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] [2019-09-10 06:58:38,514 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:38,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:38,515 INFO L82 PathProgramCache]: Analyzing trace with hash 393151197, now seen corresponding path program 1 times [2019-09-10 06:58:38,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:38,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:38,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:38,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:38,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:38,575 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 06:58:38,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:38,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:58:38,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:38,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:58:38,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:58:38,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:58:38,577 INFO L87 Difference]: Start difference. First operand 43835 states and 62205 transitions. Second operand 3 states. [2019-09-10 06:58:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:38,759 INFO L93 Difference]: Finished difference Result 59645 states and 82960 transitions. [2019-09-10 06:58:38,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:58:38,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 06:58:38,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:38,840 INFO L225 Difference]: With dead ends: 59645 [2019-09-10 06:58:38,841 INFO L226 Difference]: Without dead ends: 59645 [2019-09-10 06:58:38,841 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 06:58:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59645 states. [2019-09-10 06:58:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59645 to 56651. [2019-09-10 06:58:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56651 states. [2019-09-10 06:58:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56651 states to 56651 states and 79098 transitions. [2019-09-10 06:58:39,534 INFO L78 Accepts]: Start accepts. Automaton has 56651 states and 79098 transitions. Word has length 81 [2019-09-10 06:58:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:39,535 INFO L475 AbstractCegarLoop]: Abstraction has 56651 states and 79098 transitions. [2019-09-10 06:58:39,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:58:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 56651 states and 79098 transitions. [2019-09-10 06:58:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:58:39,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:39,552 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] [2019-09-10 06:58:39,552 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:39,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:39,553 INFO L82 PathProgramCache]: Analyzing trace with hash -93684634, now seen corresponding path program 1 times [2019-09-10 06:58:39,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:39,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:39,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:39,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:39,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:39,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:58:39,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:58:39,651 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2019-09-10 06:58:39,652 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], [392], [393], [397], [398], [399] [2019-09-10 06:58:39,656 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:58:39,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:58:39,668 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:58:39,745 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:58:39,746 INFO L272 AbstractInterpreter]: Visited 67 different actions 181 times. Merged at 33 different actions 96 times. Widened at 4 different actions 4 times. Performed 687 root evaluator evaluations with a maximum evaluation depth of 5. Performed 687 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 06:58:39,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:39,746 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:58:39,859 INFO L227 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 82.56% of their original sizes. [2019-09-10 06:58:39,859 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:58:42,265 INFO L420 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2019-09-10 06:58:42,266 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:58:42,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:58:42,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [7] total 48 [2019-09-10 06:58:42,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:42,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 06:58:42,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 06:58:42,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1580, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:58:42,267 INFO L87 Difference]: Start difference. First operand 56651 states and 79098 transitions. Second operand 43 states. [2019-09-10 06:59:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:18,874 INFO L93 Difference]: Finished difference Result 121421 states and 167107 transitions. [2019-09-10 06:59:18,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2019-09-10 06:59:18,874 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 81 [2019-09-10 06:59:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:18,999 INFO L225 Difference]: With dead ends: 121421 [2019-09-10 06:59:19,000 INFO L226 Difference]: Without dead ends: 121421 [2019-09-10 06:59:19,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27784 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=8004, Invalid=57276, Unknown=0, NotChecked=0, Total=65280 [2019-09-10 06:59:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121421 states. [2019-09-10 06:59:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121421 to 61824. [2019-09-10 06:59:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61824 states. [2019-09-10 06:59:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61824 states to 61824 states and 85846 transitions. [2019-09-10 06:59:19,814 INFO L78 Accepts]: Start accepts. Automaton has 61824 states and 85846 transitions. Word has length 81 [2019-09-10 06:59:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:19,814 INFO L475 AbstractCegarLoop]: Abstraction has 61824 states and 85846 transitions. [2019-09-10 06:59:19,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 06:59:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 61824 states and 85846 transitions. [2019-09-10 06:59:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 06:59:19,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:19,829 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] [2019-09-10 06:59:19,830 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:19,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:19,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1777556711, now seen corresponding path program 1 times [2019-09-10 06:59:19,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:19,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:19,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:19,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:19,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:19,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:59:19,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:59:19,923 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2019-09-10 06:59:19,923 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], [392], [393], [397], [398], [399] [2019-09-10 06:59:19,929 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:59:19,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:59:19,942 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:59:20,009 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:59:20,010 INFO L272 AbstractInterpreter]: Visited 67 different actions 170 times. Merged at 33 different actions 85 times. Widened at 2 different actions 2 times. Performed 667 root evaluator evaluations with a maximum evaluation depth of 5. Performed 667 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 06:59:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:20,010 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:59:20,136 INFO L227 lantSequenceWeakener]: Weakened 51 states. On average, predicates are now at 82.44% of their original sizes. [2019-09-10 06:59:20,136 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:59:22,366 INFO L420 sIntCurrentIteration]: We unified 80 AI predicates to 80 [2019-09-10 06:59:22,366 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:59:22,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:59:22,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [7] total 48 [2019-09-10 06:59:22,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:22,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 06:59:22,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 06:59:22,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 06:59:22,368 INFO L87 Difference]: Start difference. First operand 61824 states and 85846 transitions. Second operand 43 states. [2019-09-10 07:00:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:06,054 INFO L93 Difference]: Finished difference Result 147798 states and 201785 transitions. [2019-09-10 07:00:06,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 338 states. [2019-09-10 07:00:06,054 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 81 [2019-09-10 07:00:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:06,255 INFO L225 Difference]: With dead ends: 147798 [2019-09-10 07:00:06,255 INFO L226 Difference]: Without dead ends: 147798 [2019-09-10 07:00:06,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 351 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55028 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=13149, Invalid=111107, Unknown=0, NotChecked=0, Total=124256 [2019-09-10 07:00:06,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147798 states. [2019-09-10 07:00:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147798 to 70609. [2019-09-10 07:00:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70609 states. [2019-09-10 07:00:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70609 states to 70609 states and 97672 transitions. [2019-09-10 07:00:07,765 INFO L78 Accepts]: Start accepts. Automaton has 70609 states and 97672 transitions. Word has length 81 [2019-09-10 07:00:07,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:07,765 INFO L475 AbstractCegarLoop]: Abstraction has 70609 states and 97672 transitions. [2019-09-10 07:00:07,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 07:00:07,766 INFO L276 IsEmpty]: Start isEmpty. Operand 70609 states and 97672 transitions. [2019-09-10 07:00:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:00:07,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:07,781 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] [2019-09-10 07:00:07,781 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:07,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:07,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1984199512, now seen corresponding path program 1 times [2019-09-10 07:00:07,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:07,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:07,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:07,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:07,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:07,835 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:00:07,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:07,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:07,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:07,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:07,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:07,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:07,837 INFO L87 Difference]: Start difference. First operand 70609 states and 97672 transitions. Second operand 3 states. [2019-09-10 07:00:08,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:08,070 INFO L93 Difference]: Finished difference Result 106320 states and 145757 transitions. [2019-09-10 07:00:08,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:08,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:00:08,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:08,186 INFO L225 Difference]: With dead ends: 106320 [2019-09-10 07:00:08,187 INFO L226 Difference]: Without dead ends: 106320 [2019-09-10 07:00:08,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:00:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106320 states. [2019-09-10 07:00:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106320 to 103778. [2019-09-10 07:00:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103778 states. [2019-09-10 07:00:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103778 states to 103778 states and 142663 transitions. [2019-09-10 07:00:09,893 INFO L78 Accepts]: Start accepts. Automaton has 103778 states and 142663 transitions. Word has length 82 [2019-09-10 07:00:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:09,893 INFO L475 AbstractCegarLoop]: Abstraction has 103778 states and 142663 transitions. [2019-09-10 07:00:09,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 103778 states and 142663 transitions. [2019-09-10 07:00:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:00:09,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:09,909 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] [2019-09-10 07:00:09,909 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:09,909 INFO L82 PathProgramCache]: Analyzing trace with hash 274588477, now seen corresponding path program 1 times [2019-09-10 07:00:09,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:09,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:09,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:09,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:09,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:10,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:00:10,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:00:10,135 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2019-09-10 07:00:10,135 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], [291], [294], [297], [299], [301], [339], [341], [343], [356], [364], [392], [393], [397], [398], [399] [2019-09-10 07:00:10,138 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:00:10,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:00:10,148 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:00:10,265 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:00:10,266 INFO L272 AbstractInterpreter]: Visited 75 different actions 367 times. Merged at 44 different actions 254 times. Widened at 13 different actions 22 times. Performed 1209 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1209 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 43 fixpoints after 13 different actions. Largest state had 118 variables. [2019-09-10 07:00:10,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:10,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:00:10,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:00:10,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:00:10,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:10,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:00:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:10,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 07:00:10,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:00:10,545 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:00:10,546 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:00:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:00:10,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:00:10,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 07:00:10,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:00:10,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:00:10,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:00:10,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:00:10,651 INFO L87 Difference]: Start difference. First operand 103778 states and 142663 transitions. Second operand 12 states. [2019-09-10 07:00:23,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:23,702 INFO L93 Difference]: Finished difference Result 736764 states and 995214 transitions. [2019-09-10 07:00:23,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-10 07:00:23,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2019-09-10 07:00:23,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:24,845 INFO L225 Difference]: With dead ends: 736764 [2019-09-10 07:00:24,845 INFO L226 Difference]: Without dead ends: 736764 [2019-09-10 07:00:24,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7705 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2808, Invalid=15552, Unknown=0, NotChecked=0, Total=18360 [2019-09-10 07:00:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736764 states. [2019-09-10 07:00:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736764 to 210586. [2019-09-10 07:00:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210586 states. [2019-09-10 07:00:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210586 states to 210586 states and 287069 transitions. [2019-09-10 07:00:31,580 INFO L78 Accepts]: Start accepts. Automaton has 210586 states and 287069 transitions. Word has length 82 [2019-09-10 07:00:31,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:31,580 INFO L475 AbstractCegarLoop]: Abstraction has 210586 states and 287069 transitions. [2019-09-10 07:00:31,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:00:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 210586 states and 287069 transitions. [2019-09-10 07:00:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:00:31,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:31,596 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] [2019-09-10 07:00:31,597 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:31,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:31,597 INFO L82 PathProgramCache]: Analyzing trace with hash -259102357, now seen corresponding path program 1 times [2019-09-10 07:00:31,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:31,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:31,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:31,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:31,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 07:00:31,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:31,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:00:31,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:31,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:00:31,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:00:31,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:31,701 INFO L87 Difference]: Start difference. First operand 210586 states and 287069 transitions. Second operand 6 states. [2019-09-10 07:00:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:32,812 INFO L93 Difference]: Finished difference Result 328934 states and 451977 transitions. [2019-09-10 07:00:32,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:00:32,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-10 07:00:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:33,311 INFO L225 Difference]: With dead ends: 328934 [2019-09-10 07:00:33,311 INFO L226 Difference]: Without dead ends: 328934 [2019-09-10 07:00:33,312 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:00:33,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328934 states. [2019-09-10 07:00:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328934 to 264686. [2019-09-10 07:00:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264686 states. [2019-09-10 07:00:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264686 states to 264686 states and 361789 transitions. [2019-09-10 07:00:41,753 INFO L78 Accepts]: Start accepts. Automaton has 264686 states and 361789 transitions. Word has length 83 [2019-09-10 07:00:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:41,753 INFO L475 AbstractCegarLoop]: Abstraction has 264686 states and 361789 transitions. [2019-09-10 07:00:41,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:00:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 264686 states and 361789 transitions. [2019-09-10 07:00:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:00:41,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:41,772 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] [2019-09-10 07:00:41,772 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:41,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:41,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1723275991, now seen corresponding path program 1 times [2019-09-10 07:00:41,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:41,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:41,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:41,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:41,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:41,824 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:00:41,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:41,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:41,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:41,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:41,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:41,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:41,826 INFO L87 Difference]: Start difference. First operand 264686 states and 361789 transitions. Second operand 3 states. [2019-09-10 07:00:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:42,436 INFO L93 Difference]: Finished difference Result 254843 states and 344690 transitions. [2019-09-10 07:00:42,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:42,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-10 07:00:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:42,742 INFO L225 Difference]: With dead ends: 254843 [2019-09-10 07:00:42,742 INFO L226 Difference]: Without dead ends: 254843 [2019-09-10 07:00:42,743 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:00:42,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254843 states. [2019-09-10 07:00:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254843 to 254841. [2019-09-10 07:00:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254841 states. [2019-09-10 07:00:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254841 states to 254841 states and 344689 transitions. [2019-09-10 07:00:52,935 INFO L78 Accepts]: Start accepts. Automaton has 254841 states and 344689 transitions. Word has length 83 [2019-09-10 07:00:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:52,936 INFO L475 AbstractCegarLoop]: Abstraction has 254841 states and 344689 transitions. [2019-09-10 07:00:52,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 254841 states and 344689 transitions. [2019-09-10 07:00:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:00:52,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:52,944 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] [2019-09-10 07:00:52,945 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:52,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash 367008692, now seen corresponding path program 1 times [2019-09-10 07:00:52,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:52,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:52,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:52,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:52,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 07:00:53,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:53,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:00:53,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:53,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:00:53,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:00:53,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:00:53,027 INFO L87 Difference]: Start difference. First operand 254841 states and 344689 transitions. Second operand 6 states. [2019-09-10 07:00:54,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:54,067 INFO L93 Difference]: Finished difference Result 355155 states and 483157 transitions. [2019-09-10 07:00:54,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:00:54,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-10 07:00:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:54,582 INFO L225 Difference]: With dead ends: 355155 [2019-09-10 07:00:54,582 INFO L226 Difference]: Without dead ends: 355155 [2019-09-10 07:00:54,582 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:00:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355155 states. [2019-09-10 07:00:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355155 to 290907. [2019-09-10 07:00:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290907 states. [2019-09-10 07:01:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290907 states to 290907 states and 393469 transitions. [2019-09-10 07:01:01,304 INFO L78 Accepts]: Start accepts. Automaton has 290907 states and 393469 transitions. Word has length 83 [2019-09-10 07:01:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:01,305 INFO L475 AbstractCegarLoop]: Abstraction has 290907 states and 393469 transitions. [2019-09-10 07:01:01,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:01:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand 290907 states and 393469 transitions. [2019-09-10 07:01:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:01:01,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:01,316 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:01:01,316 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:01,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:01,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1410147657, now seen corresponding path program 1 times [2019-09-10 07:01:01,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:01,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:01,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:01,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:01,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 07:01:01,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:01,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:01:01,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:01,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:01:01,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:01:01,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:01:01,375 INFO L87 Difference]: Start difference. First operand 290907 states and 393469 transitions. Second operand 5 states. [2019-09-10 07:01:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:02,505 INFO L93 Difference]: Finished difference Result 414174 states and 556053 transitions. [2019-09-10 07:01:02,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:01:02,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-10 07:01:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:03,238 INFO L225 Difference]: With dead ends: 414174 [2019-09-10 07:01:03,238 INFO L226 Difference]: Without dead ends: 414174 [2019-09-10 07:01:03,239 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:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414174 states. [2019-09-10 07:01:15,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414174 to 290690. [2019-09-10 07:01:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290690 states. [2019-09-10 07:01:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290690 states to 290690 states and 390943 transitions. [2019-09-10 07:01:15,715 INFO L78 Accepts]: Start accepts. Automaton has 290690 states and 390943 transitions. Word has length 84 [2019-09-10 07:01:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:15,715 INFO L475 AbstractCegarLoop]: Abstraction has 290690 states and 390943 transitions. [2019-09-10 07:01:15,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:01:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 290690 states and 390943 transitions. [2019-09-10 07:01:15,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:01:15,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:15,725 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:01:15,725 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:15,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:15,725 INFO L82 PathProgramCache]: Analyzing trace with hash 304276910, now seen corresponding path program 1 times [2019-09-10 07:01:15,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:15,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:15,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:15,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:15,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:15,805 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:01:15,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:01:15,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:01:15,805 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2019-09-10 07:01:15,806 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], [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], [286], [288], [301], [309], [328], [330], [333], [341], [343], [346], [349], [352], [354], [356], [392], [393], [397], [398], [399] [2019-09-10 07:01:15,808 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:01:15,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:01:15,820 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:01:15,875 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:01:15,876 INFO L272 AbstractInterpreter]: Visited 73 different actions 192 times. Merged at 39 different actions 99 times. Widened at 2 different actions 3 times. Performed 698 root evaluator evaluations with a maximum evaluation depth of 5. Performed 698 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 5 different actions. Largest state had 118 variables. [2019-09-10 07:01:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:15,876 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:01:16,016 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 81.41% of their original sizes. [2019-09-10 07:01:16,016 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:01:18,816 INFO L420 sIntCurrentIteration]: We unified 83 AI predicates to 83 [2019-09-10 07:01:18,816 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:01:18,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:01:18,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [45] imperfect sequences [7] total 50 [2019-09-10 07:01:18,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:18,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 07:01:18,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 07:01:18,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1749, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 07:01:18,818 INFO L87 Difference]: Start difference. First operand 290690 states and 390943 transitions. Second operand 45 states. [2019-09-10 07:02:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:14,298 INFO L93 Difference]: Finished difference Result 538463 states and 716518 transitions. [2019-09-10 07:02:14,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 418 states. [2019-09-10 07:02:14,299 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 84 [2019-09-10 07:02:14,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:14,980 INFO L225 Difference]: With dead ends: 538463 [2019-09-10 07:02:14,980 INFO L226 Difference]: Without dead ends: 538463 [2019-09-10 07:02:14,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83877 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=20594, Invalid=165598, Unknown=0, NotChecked=0, Total=186192 [2019-09-10 07:02:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538463 states. [2019-09-10 07:02:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538463 to 326503. [2019-09-10 07:02:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326503 states. [2019-09-10 07:02:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326503 states to 326503 states and 436105 transitions. [2019-09-10 07:02:20,734 INFO L78 Accepts]: Start accepts. Automaton has 326503 states and 436105 transitions. Word has length 84 [2019-09-10 07:02:20,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:20,735 INFO L475 AbstractCegarLoop]: Abstraction has 326503 states and 436105 transitions. [2019-09-10 07:02:20,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 07:02:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 326503 states and 436105 transitions. [2019-09-10 07:02:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:02:20,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:20,754 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] [2019-09-10 07:02:20,754 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:20,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:20,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1366253358, now seen corresponding path program 1 times [2019-09-10 07:02:20,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:20,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:20,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:20,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:20,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:02:20,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:02:20,844 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 85 with the following transitions: [2019-09-10 07:02:20,845 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], [120], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [185], [188], [191], [193], [195], [231], [235], [248], [256], [275], [277], [280], [288], [291], [294], [297], [299], [301], [343], [356], [364], [392], [393], [397], [398], [399] [2019-09-10 07:02:20,850 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:02:20,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:02:20,861 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:02:20,944 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:02:20,945 INFO L272 AbstractInterpreter]: Visited 70 different actions 219 times. Merged at 36 different actions 131 times. Never widened. Performed 828 root evaluator evaluations with a maximum evaluation depth of 5. Performed 828 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 10 fixpoints after 6 different actions. Largest state had 119 variables. [2019-09-10 07:02:20,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:20,945 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:02:21,051 INFO L227 lantSequenceWeakener]: Weakened 54 states. On average, predicates are now at 82.42% of their original sizes. [2019-09-10 07:02:21,051 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:02:24,279 INFO L420 sIntCurrentIteration]: We unified 83 AI predicates to 83 [2019-09-10 07:02:24,279 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:02:24,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:02:24,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [45] imperfect sequences [7] total 50 [2019-09-10 07:02:24,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:24,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 07:02:24,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 07:02:24,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1739, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 07:02:24,281 INFO L87 Difference]: Start difference. First operand 326503 states and 436105 transitions. Second operand 45 states. [2019-09-10 07:03:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:19,426 INFO L93 Difference]: Finished difference Result 569156 states and 754287 transitions. [2019-09-10 07:03:19,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 436 states. [2019-09-10 07:03:19,426 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 84 [2019-09-10 07:03:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:20,179 INFO L225 Difference]: With dead ends: 569156 [2019-09-10 07:03:20,179 INFO L226 Difference]: Without dead ends: 569156 [2019-09-10 07:03:20,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 447 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92535 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=21030, Invalid=180122, Unknown=0, NotChecked=0, Total=201152 [2019-09-10 07:03:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569156 states. [2019-09-10 07:03:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569156 to 330196. [2019-09-10 07:03:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330196 states. [2019-09-10 07:03:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330196 states to 330196 states and 440442 transitions. [2019-09-10 07:03:26,370 INFO L78 Accepts]: Start accepts. Automaton has 330196 states and 440442 transitions. Word has length 84 [2019-09-10 07:03:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:26,370 INFO L475 AbstractCegarLoop]: Abstraction has 330196 states and 440442 transitions. [2019-09-10 07:03:26,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 07:03:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 330196 states and 440442 transitions. [2019-09-10 07:03:26,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:03:26,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:26,388 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] [2019-09-10 07:03:26,388 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:26,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:26,389 INFO L82 PathProgramCache]: Analyzing trace with hash 61278230, now seen corresponding path program 1 times [2019-09-10 07:03:26,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:26,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:26,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:26,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:26,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:26,446 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:03:26,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:26,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:26,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:26,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:26,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:26,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:26,448 INFO L87 Difference]: Start difference. First operand 330196 states and 440442 transitions. Second operand 3 states. [2019-09-10 07:03:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:29,224 INFO L93 Difference]: Finished difference Result 311501 states and 410570 transitions. [2019-09-10 07:03:29,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:29,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:03:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:29,670 INFO L225 Difference]: With dead ends: 311501 [2019-09-10 07:03:29,670 INFO L226 Difference]: Without dead ends: 311501 [2019-09-10 07:03:29,670 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,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311501 states. [2019-09-10 07:03:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311501 to 310276. [2019-09-10 07:03:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310276 states. [2019-09-10 07:03:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310276 states to 310276 states and 409132 transitions. [2019-09-10 07:03:38,266 INFO L78 Accepts]: Start accepts. Automaton has 310276 states and 409132 transitions. Word has length 84 [2019-09-10 07:03:38,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:38,266 INFO L475 AbstractCegarLoop]: Abstraction has 310276 states and 409132 transitions. [2019-09-10 07:03:38,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:38,266 INFO L276 IsEmpty]: Start isEmpty. Operand 310276 states and 409132 transitions. [2019-09-10 07:03:38,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:03:38,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:38,279 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] [2019-09-10 07:03:38,279 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:38,280 INFO L82 PathProgramCache]: Analyzing trace with hash 565168638, now seen corresponding path program 1 times [2019-09-10 07:03:38,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:38,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:38,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:38,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:38,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:03:38,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:38,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:38,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:38,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:38,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:38,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:38,323 INFO L87 Difference]: Start difference. First operand 310276 states and 409132 transitions. Second operand 3 states. [2019-09-10 07:03:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:40,359 INFO L93 Difference]: Finished difference Result 481808 states and 639795 transitions. [2019-09-10 07:03:40,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:40,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 07:03:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:41,072 INFO L225 Difference]: With dead ends: 481808 [2019-09-10 07:03:41,072 INFO L226 Difference]: Without dead ends: 481808 [2019-09-10 07:03:41,072 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:41,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481808 states. [2019-09-10 07:03:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481808 to 344483. [2019-09-10 07:03:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344483 states. [2019-09-10 07:03:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344483 states to 344483 states and 455709 transitions. [2019-09-10 07:03:52,682 INFO L78 Accepts]: Start accepts. Automaton has 344483 states and 455709 transitions. Word has length 85 [2019-09-10 07:03:52,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:52,683 INFO L475 AbstractCegarLoop]: Abstraction has 344483 states and 455709 transitions. [2019-09-10 07:03:52,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 344483 states and 455709 transitions. [2019-09-10 07:03:52,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:03:52,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:52,694 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] [2019-09-10 07:03:52,695 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:52,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:52,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1132416258, now seen corresponding path program 1 times [2019-09-10 07:03:52,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:52,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:52,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:52,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:52,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:52,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:03:52,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:03:52,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 86 with the following transitions: [2019-09-10 07:03:52,773 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], [120], [123], [126], [128], [130], [133], [144], [146], [149], [152], [154], [157], [158], [160], [169], [180], [182], [195], [203], [222], [235], [238], [241], [244], [246], [248], [277], [280], [288], [291], [294], [297], [299], [301], [343], [356], [364], [392], [393], [397], [398], [399] [2019-09-10 07:03:52,777 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:03:52,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:03:52,789 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:03:52,826 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:03:52,826 INFO L272 AbstractInterpreter]: Visited 71 different actions 132 times. Merged at 34 different actions 51 times. Never widened. Performed 556 root evaluator evaluations with a maximum evaluation depth of 5. Performed 556 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 5 fixpoints after 2 different actions. Largest state had 119 variables. [2019-09-10 07:03:52,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:52,827 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:03:52,943 INFO L227 lantSequenceWeakener]: Weakened 52 states. On average, predicates are now at 81.66% of their original sizes. [2019-09-10 07:03:52,943 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:03:56,445 INFO L420 sIntCurrentIteration]: We unified 84 AI predicates to 84 [2019-09-10 07:03:56,446 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:03:56,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:03:56,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [7] total 52 [2019-09-10 07:03:56,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:56,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 07:03:56,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 07:03:56,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1897, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 07:03:56,447 INFO L87 Difference]: Start difference. First operand 344483 states and 455709 transitions. Second operand 47 states. [2019-09-10 07:04:54,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:04:54,556 INFO L93 Difference]: Finished difference Result 633950 states and 834812 transitions. [2019-09-10 07:04:54,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 352 states. [2019-09-10 07:04:54,556 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 85 [2019-09-10 07:04:54,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:56,199 INFO L225 Difference]: With dead ends: 633950 [2019-09-10 07:04:56,199 INFO L226 Difference]: Without dead ends: 633950 [2019-09-10 07:04:56,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61674 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=14294, Invalid=122236, Unknown=0, NotChecked=0, Total=136530 [2019-09-10 07:04:56,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633950 states. [2019-09-10 07:05:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633950 to 368418. [2019-09-10 07:05:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368418 states. [2019-09-10 07:05:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368418 states to 368418 states and 487098 transitions. [2019-09-10 07:05:03,879 INFO L78 Accepts]: Start accepts. Automaton has 368418 states and 487098 transitions. Word has length 85 [2019-09-10 07:05:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:03,880 INFO L475 AbstractCegarLoop]: Abstraction has 368418 states and 487098 transitions. [2019-09-10 07:05:03,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 07:05:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 368418 states and 487098 transitions. [2019-09-10 07:05:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:05:03,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:03,894 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:05:03,894 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:03,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:03,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1087073664, now seen corresponding path program 1 times [2019-09-10 07:05:03,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:03,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:03,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:03,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:03,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:05:03,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:05:03,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:05:03,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:03,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:05:03,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:05:03,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:05:03,986 INFO L87 Difference]: Start difference. First operand 368418 states and 487098 transitions. Second operand 6 states. [2019-09-10 07:05:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:06,812 INFO L93 Difference]: Finished difference Result 453372 states and 602378 transitions. [2019-09-10 07:05:06,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:05:06,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-10 07:05:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:07,472 INFO L225 Difference]: With dead ends: 453372 [2019-09-10 07:05:07,472 INFO L226 Difference]: Without dead ends: 453372 [2019-09-10 07:05:07,472 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:05:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453372 states. [2019-09-10 07:05:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453372 to 405058. [2019-09-10 07:05:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405058 states. [2019-09-10 07:05:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405058 states to 405058 states and 536198 transitions. [2019-09-10 07:05:20,339 INFO L78 Accepts]: Start accepts. Automaton has 405058 states and 536198 transitions. Word has length 86 [2019-09-10 07:05:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:05:20,340 INFO L475 AbstractCegarLoop]: Abstraction has 405058 states and 536198 transitions. [2019-09-10 07:05:20,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:05:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 405058 states and 536198 transitions. [2019-09-10 07:05:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:05:20,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:05:20,354 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:05:20,354 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:05:20,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1237945161, now seen corresponding path program 1 times [2019-09-10 07:05:20,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:05:20,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:20,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:05:20,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:05:20,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:05:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:05:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:05:20,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:05:20,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:05:20,435 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 87 with the following transitions: [2019-09-10 07:05:20,435 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], [136], [139], [144], [146], [149], [152], [154], [157], [158], [160], [169], [171], [174], [182], [185], [188], [191], [193], [195], [224], [227], [235], [238], [241], [244], [246], [248], [286], [288], [301], [309], [328], [343], [356], [364], [392], [393], [397], [398], [399] [2019-09-10 07:05:20,441 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:05:20,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:05:20,451 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:05:20,544 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:05:20,545 INFO L272 AbstractInterpreter]: Visited 72 different actions 269 times. Merged at 38 different actions 173 times. Never widened. Performed 876 root evaluator evaluations with a maximum evaluation depth of 5. Performed 876 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:05:20,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:05:20,545 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:05:21,697 INFO L227 lantSequenceWeakener]: Weakened 56 states. On average, predicates are now at 82.21% of their original sizes. [2019-09-10 07:05:21,697 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:05:24,027 INFO L420 sIntCurrentIteration]: We unified 85 AI predicates to 85 [2019-09-10 07:05:24,027 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:05:24,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:05:24,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [7] total 52 [2019-09-10 07:05:24,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:05:24,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 07:05:24,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 07:05:24,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1925, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 07:05:24,029 INFO L87 Difference]: Start difference. First operand 405058 states and 536198 transitions. Second operand 47 states. [2019-09-10 07:06:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:30,059 INFO L93 Difference]: Finished difference Result 699919 states and 924225 transitions. [2019-09-10 07:06:30,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 338 states. [2019-09-10 07:06:30,059 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 86 [2019-09-10 07:06:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:30,929 INFO L225 Difference]: With dead ends: 699919 [2019-09-10 07:06:30,929 INFO L226 Difference]: Without dead ends: 699919 [2019-09-10 07:06:30,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55668 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=12898, Invalid=114194, Unknown=0, NotChecked=0, Total=127092 [2019-09-10 07:06:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699919 states. [2019-09-10 07:06:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699919 to 423770. [2019-09-10 07:06:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423770 states. [2019-09-10 07:06:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423770 states to 423770 states and 560036 transitions. [2019-09-10 07:06:40,077 INFO L78 Accepts]: Start accepts. Automaton has 423770 states and 560036 transitions. Word has length 86 [2019-09-10 07:06:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:40,077 INFO L475 AbstractCegarLoop]: Abstraction has 423770 states and 560036 transitions. [2019-09-10 07:06:40,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 07:06:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 423770 states and 560036 transitions. [2019-09-10 07:06:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:06:40,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:40,091 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] [2019-09-10 07:06:40,092 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:40,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1500052403, now seen corresponding path program 1 times [2019-09-10 07:06:40,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:40,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:40,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:40,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:40,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:40,173 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:06:40,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:40,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:06:40,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:40,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:06:40,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:06:40,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:06:40,176 INFO L87 Difference]: Start difference. First operand 423770 states and 560036 transitions. Second operand 6 states. [2019-09-10 07:06:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:42,721 INFO L93 Difference]: Finished difference Result 544310 states and 722900 transitions. [2019-09-10 07:06:42,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:06:42,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-09-10 07:06:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:43,500 INFO L225 Difference]: With dead ends: 544310 [2019-09-10 07:06:43,500 INFO L226 Difference]: Without dead ends: 544310 [2019-09-10 07:06:43,501 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:06:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544310 states. [2019-09-10 07:06:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544310 to 495996. [2019-09-10 07:06:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495996 states. [2019-09-10 07:06:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495996 states to 495996 states and 656720 transitions. [2019-09-10 07:06:56,719 INFO L78 Accepts]: Start accepts. Automaton has 495996 states and 656720 transitions. Word has length 87 [2019-09-10 07:06:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:56,720 INFO L475 AbstractCegarLoop]: Abstraction has 495996 states and 656720 transitions. [2019-09-10 07:06:56,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:06:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 495996 states and 656720 transitions. [2019-09-10 07:06:56,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:06:56,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:56,739 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:56,739 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:56,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:56,740 INFO L82 PathProgramCache]: Analyzing trace with hash 928475611, now seen corresponding path program 1 times [2019-09-10 07:06:56,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:56,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:56,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:56,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:56,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:56,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:06:56,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:06:56,819 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 89 with the following transitions: [2019-09-10 07:06:56,819 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], [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], [277], [280], [288], [291], [294], [297], [299], [301], [343], [356], [364], [392], [393], [397], [398], [399] [2019-09-10 07:06:56,822 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:06:56,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:06:56,833 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:06:56,900 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:06:56,901 INFO L272 AbstractInterpreter]: Visited 74 different actions 214 times. Merged at 40 different actions 124 times. Never widened. Performed 815 root evaluator evaluations with a maximum evaluation depth of 5. Performed 815 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 9 fixpoints after 5 different actions. Largest state had 120 variables. [2019-09-10 07:06:56,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:56,901 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:06:57,003 INFO L227 lantSequenceWeakener]: Weakened 58 states. On average, predicates are now at 82.23% of their original sizes. [2019-09-10 07:06:57,003 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:07:06,568 INFO L420 sIntCurrentIteration]: We unified 87 AI predicates to 87 [2019-09-10 07:07:06,568 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:07:06,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:07:06,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [7] total 55 [2019-09-10 07:07:06,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:06,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 07:07:06,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 07:07:06,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2188, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:07:06,569 INFO L87 Difference]: Start difference. First operand 495996 states and 656720 transitions. Second operand 50 states. [2019-09-10 07:08:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:16,593 INFO L93 Difference]: Finished difference Result 792243 states and 1046929 transitions. [2019-09-10 07:08:16,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 334 states. [2019-09-10 07:08:16,593 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 88 [2019-09-10 07:08:16,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:17,701 INFO L225 Difference]: With dead ends: 792243 [2019-09-10 07:08:17,701 INFO L226 Difference]: Without dead ends: 792243 [2019-09-10 07:08:17,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55284 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=14196, Invalid=112184, Unknown=0, NotChecked=0, Total=126380 [2019-09-10 07:08:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792243 states. [2019-09-10 07:08:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792243 to 457295. [2019-09-10 07:08:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457295 states. [2019-09-10 07:08:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457295 states to 457295 states and 605632 transitions. [2019-09-10 07:08:29,580 INFO L78 Accepts]: Start accepts. Automaton has 457295 states and 605632 transitions. Word has length 88 [2019-09-10 07:08:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:29,580 INFO L475 AbstractCegarLoop]: Abstraction has 457295 states and 605632 transitions. [2019-09-10 07:08:29,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 07:08:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 457295 states and 605632 transitions. [2019-09-10 07:08:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:08:29,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:29,595 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] [2019-09-10 07:08:29,595 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:29,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:29,595 INFO L82 PathProgramCache]: Analyzing trace with hash 483000745, now seen corresponding path program 1 times [2019-09-10 07:08:29,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:29,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:29,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:29,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:29,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:29,642 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:08:29,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:08:29,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:08:29,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:08:29,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:08:29,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:08:29,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:08:29,644 INFO L87 Difference]: Start difference. First operand 457295 states and 605632 transitions. Second operand 3 states. [2019-09-10 07:08:37,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:37,593 INFO L93 Difference]: Finished difference Result 470663 states and 614101 transitions. [2019-09-10 07:08:37,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:08:37,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-10 07:08:37,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:38,449 INFO L225 Difference]: With dead ends: 470663 [2019-09-10 07:08:38,449 INFO L226 Difference]: Without dead ends: 446433 [2019-09-10 07:08:38,450 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:08:38,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446433 states. [2019-09-10 07:08:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446433 to 434550. [2019-09-10 07:08:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434550 states. [2019-09-10 07:08:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434550 states to 434550 states and 568874 transitions. [2019-09-10 07:08:44,054 INFO L78 Accepts]: Start accepts. Automaton has 434550 states and 568874 transitions. Word has length 88 [2019-09-10 07:08:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:08:44,054 INFO L475 AbstractCegarLoop]: Abstraction has 434550 states and 568874 transitions. [2019-09-10 07:08:44,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:08:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 434550 states and 568874 transitions. [2019-09-10 07:08:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:08:45,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:08:45,266 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:08:45,266 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:08:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1929276738, now seen corresponding path program 1 times [2019-09-10 07:08:45,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:08:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:45,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:08:45,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:08:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:45,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:08:45,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:08:45,341 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-09-10 07:08:45,341 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], [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], [330], [333], [341], [343], [346], [349], [352], [354], [356], [392], [393], [397], [398], [399] [2019-09-10 07:08:45,343 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:08:45,343 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:08:45,353 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:08:45,532 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:08:45,533 INFO L272 AbstractInterpreter]: Visited 79 different actions 450 times. Merged at 47 different actions 324 times. Widened at 13 different actions 41 times. Performed 1465 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1465 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 30 fixpoints after 12 different actions. Largest state had 119 variables. [2019-09-10 07:08:45,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:08:45,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:08:45,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:08:45,533 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:08:45,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:08:45,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:08:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:08:45,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:08:45,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:08:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:45,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:08:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:08:45,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:08:45,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-09-10 07:08:45,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:08:45,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:08:45,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:08:45,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:08:45,780 INFO L87 Difference]: Start difference. First operand 434550 states and 568874 transitions. Second operand 11 states. [2019-09-10 07:08:49,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:49,235 INFO L93 Difference]: Finished difference Result 670937 states and 872197 transitions. [2019-09-10 07:08:49,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:08:49,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2019-09-10 07:08:49,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:50,166 INFO L225 Difference]: With dead ends: 670937 [2019-09-10 07:08:50,166 INFO L226 Difference]: Without dead ends: 670937 [2019-09-10 07:08:50,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 170 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:08:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670937 states. [2019-09-10 07:09:05,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670937 to 453949. [2019-09-10 07:09:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453949 states. [2019-09-10 07:09:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453949 states to 453949 states and 593478 transitions. [2019-09-10 07:09:06,400 INFO L78 Accepts]: Start accepts. Automaton has 453949 states and 593478 transitions. Word has length 89 [2019-09-10 07:09:06,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:06,400 INFO L475 AbstractCegarLoop]: Abstraction has 453949 states and 593478 transitions. [2019-09-10 07:09:06,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:09:06,400 INFO L276 IsEmpty]: Start isEmpty. Operand 453949 states and 593478 transitions. [2019-09-10 07:09:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:09:06,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:06,414 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:09:06,414 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:06,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:06,414 INFO L82 PathProgramCache]: Analyzing trace with hash 424417533, now seen corresponding path program 1 times [2019-09-10 07:09:06,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:06,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:06,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:06,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:06,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:06,495 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:09:06,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:09:06,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:09:06,496 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-09-10 07:09:06,496 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], [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], [330], [333], [341], [343], [346], [349], [352], [354], [356], [392], [393], [397], [398], [399] [2019-09-10 07:09:06,498 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:09:06,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:09:06,508 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:09:06,549 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:09:06,549 INFO L272 AbstractInterpreter]: Visited 74 different actions 181 times. Merged at 39 different actions 89 times. Widened at 2 different actions 3 times. Performed 685 root evaluator evaluations with a maximum evaluation depth of 5. Performed 685 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 2 different actions. Largest state had 119 variables. [2019-09-10 07:09:06,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:06,550 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:09:06,626 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 81.11% of their original sizes. [2019-09-10 07:09:06,626 INFO L418 sIntCurrentIteration]: Unifying AI predicates