java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:15:32,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:15:32,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:15:32,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:15:32,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:15:32,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:15:32,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:15:32,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:15:32,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:15:32,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:15:32,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:15:32,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:15:32,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:15:32,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:15:32,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:15:32,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:15:32,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:15:32,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:15:32,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:15:32,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:15:32,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:15:32,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:15:32,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:15:32,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:15:32,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:15:32,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:15:32,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:15:32,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:15:32,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:15:32,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:15:32,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:15:32,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:15:32,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:15:32,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:15:32,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:15:32,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:15:32,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:15:32,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:15:32,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:15:32,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:15:32,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:15:32,219 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 04:15:32,238 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:15:32,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:15:32,239 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:15:32,240 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:15:32,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:15:32,240 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:15:32,241 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:15:32,241 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:15:32,241 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:15:32,241 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:15:32,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:15:32,242 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:15:32,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:15:32,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:15:32,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:15:32,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:15:32,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:15:32,245 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:15:32,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:15:32,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:15:32,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:15:32,246 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:15:32,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:15:32,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:15:32,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:15:32,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:15:32,247 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:15:32,247 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:15:32,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:15:32,247 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:15:32,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:15:32,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:15:32,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:15:32,313 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:15:32,313 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:15:32,314 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:15:32,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d9aa659/2af2d6d778764c94866ceee61a273f05/FLAGe64f83c35 [2019-09-10 04:15:32,840 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:15:32,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:15:32,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d9aa659/2af2d6d778764c94866ceee61a273f05/FLAGe64f83c35 [2019-09-10 04:15:33,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d9aa659/2af2d6d778764c94866ceee61a273f05 [2019-09-10 04:15:33,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:15:33,187 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:15:33,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:15:33,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:15:33,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:15:33,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:15:33" (1/1) ... [2019-09-10 04:15:33,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74340391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:15:33, skipping insertion in model container [2019-09-10 04:15:33,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:15:33" (1/1) ... [2019-09-10 04:15:33,204 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:15:33,263 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:15:33,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:15:33,638 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:15:33,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:15:33,745 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:15:33,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:15:33 WrapperNode [2019-09-10 04:15:33,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:15:33,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:15:33,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:15:33,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:15:33,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:15:33" (1/1) ... [2019-09-10 04:15:33,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:15:33" (1/1) ... [2019-09-10 04:15:33,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:15:33" (1/1) ... [2019-09-10 04:15:33,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:15:33" (1/1) ... [2019-09-10 04:15:33,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:15:33" (1/1) ... [2019-09-10 04:15:33,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:15:33" (1/1) ... [2019-09-10 04:15:33,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:15:33" (1/1) ... [2019-09-10 04:15:33,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:15:33,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:15:33,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:15:33,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:15:33,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:15:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:15:33,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:15:33,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:15:33,886 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:15:33,886 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:15:33,886 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:15:33,886 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:15:33,886 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:15:33,886 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:15:33,886 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:15:33,887 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:15:33,887 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:15:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:15:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:15:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:15:33,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:15:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:15:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:15:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:15:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:15:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:15:33,888 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:15:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:15:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:15:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:15:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:15:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:15:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:15:33,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:15:33,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:15:34,597 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:15:34,598 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:15:34,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:15:34 BoogieIcfgContainer [2019-09-10 04:15:34,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:15:34,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:15:34,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:15:34,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:15:34,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:15:33" (1/3) ... [2019-09-10 04:15:34,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103ba792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:15:34, skipping insertion in model container [2019-09-10 04:15:34,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:15:33" (2/3) ... [2019-09-10 04:15:34,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103ba792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:15:34, skipping insertion in model container [2019-09-10 04:15:34,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:15:34" (3/3) ... [2019-09-10 04:15:34,611 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:15:34,622 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:15:34,631 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:15:34,646 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:15:34,670 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:15:34,671 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:15:34,671 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:15:34,671 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:15:34,671 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:15:34,671 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:15:34,671 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:15:34,672 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:15:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-10 04:15:34,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 04:15:34,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:34,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:34,705 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:34,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:34,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1245616469, now seen corresponding path program 1 times [2019-09-10 04:15:34,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:34,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:34,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:34,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:34,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:15:35,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:15:35,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:15:35,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:35,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:15:35,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:15:35,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:15:35,171 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-09-10 04:15:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:35,325 INFO L93 Difference]: Finished difference Result 153 states and 233 transitions. [2019-09-10 04:15:35,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:15:35,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-09-10 04:15:35,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:35,351 INFO L225 Difference]: With dead ends: 153 [2019-09-10 04:15:35,351 INFO L226 Difference]: Without dead ends: 149 [2019-09-10 04:15:35,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:15:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-10 04:15:35,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-09-10 04:15:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-09-10 04:15:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 198 transitions. [2019-09-10 04:15:35,453 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 198 transitions. Word has length 62 [2019-09-10 04:15:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:35,454 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 198 transitions. [2019-09-10 04:15:35,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:15:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 198 transitions. [2019-09-10 04:15:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:15:35,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:35,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:35,488 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:35,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1850604190, now seen corresponding path program 1 times [2019-09-10 04:15:35,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:35,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:35,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:35,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:35,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:15:36,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:15:36,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:15:36,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:36,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:15:36,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:15:36,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:15:36,017 INFO L87 Difference]: Start difference. First operand 149 states and 198 transitions. Second operand 13 states. [2019-09-10 04:15:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:42,027 INFO L93 Difference]: Finished difference Result 1323 states and 1998 transitions. [2019-09-10 04:15:42,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 04:15:42,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-10 04:15:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:42,046 INFO L225 Difference]: With dead ends: 1323 [2019-09-10 04:15:42,046 INFO L226 Difference]: Without dead ends: 1323 [2019-09-10 04:15:42,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=618, Invalid=2034, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 04:15:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2019-09-10 04:15:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1108. [2019-09-10 04:15:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2019-09-10 04:15:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1637 transitions. [2019-09-10 04:15:42,205 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1637 transitions. Word has length 93 [2019-09-10 04:15:42,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:42,207 INFO L475 AbstractCegarLoop]: Abstraction has 1108 states and 1637 transitions. [2019-09-10 04:15:42,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:15:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1637 transitions. [2019-09-10 04:15:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 04:15:42,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:42,216 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:42,217 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:42,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1299803518, now seen corresponding path program 1 times [2019-09-10 04:15:42,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:42,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:42,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:42,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:42,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:15:42,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:15:42,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:15:42,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:42,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:15:42,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:15:42,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:15:42,401 INFO L87 Difference]: Start difference. First operand 1108 states and 1637 transitions. Second operand 11 states. [2019-09-10 04:15:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:42,560 INFO L93 Difference]: Finished difference Result 1262 states and 1887 transitions. [2019-09-10 04:15:42,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:15:42,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-09-10 04:15:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:42,569 INFO L225 Difference]: With dead ends: 1262 [2019-09-10 04:15:42,570 INFO L226 Difference]: Without dead ends: 1262 [2019-09-10 04:15:42,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:15:42,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-09-10 04:15:42,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1180. [2019-09-10 04:15:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-09-10 04:15:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1709 transitions. [2019-09-10 04:15:42,627 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1709 transitions. Word has length 94 [2019-09-10 04:15:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:42,628 INFO L475 AbstractCegarLoop]: Abstraction has 1180 states and 1709 transitions. [2019-09-10 04:15:42,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:15:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1709 transitions. [2019-09-10 04:15:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:15:42,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:42,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:42,631 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:42,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1310130058, now seen corresponding path program 1 times [2019-09-10 04:15:42,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:42,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:42,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:42,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:42,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:15:42,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:15:42,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:15:42,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:42,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:15:42,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:15:42,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:15:42,786 INFO L87 Difference]: Start difference. First operand 1180 states and 1709 transitions. Second operand 5 states. [2019-09-10 04:15:43,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:43,529 INFO L93 Difference]: Finished difference Result 3149 states and 4600 transitions. [2019-09-10 04:15:43,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:15:43,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 04:15:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:43,550 INFO L225 Difference]: With dead ends: 3149 [2019-09-10 04:15:43,550 INFO L226 Difference]: Without dead ends: 3149 [2019-09-10 04:15:43,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:15:43,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2019-09-10 04:15:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3106. [2019-09-10 04:15:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3106 states. [2019-09-10 04:15:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 4549 transitions. [2019-09-10 04:15:43,664 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 4549 transitions. Word has length 95 [2019-09-10 04:15:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:43,665 INFO L475 AbstractCegarLoop]: Abstraction has 3106 states and 4549 transitions. [2019-09-10 04:15:43,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:15:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 4549 transitions. [2019-09-10 04:15:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:15:43,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:43,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:43,670 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:43,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1927996876, now seen corresponding path program 1 times [2019-09-10 04:15:43,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:43,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:43,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:43,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:15:43,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:15:43,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:15:43,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:43,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:15:43,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:15:43,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:15:43,838 INFO L87 Difference]: Start difference. First operand 3106 states and 4549 transitions. Second operand 5 states. [2019-09-10 04:15:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:44,525 INFO L93 Difference]: Finished difference Result 4202 states and 6088 transitions. [2019-09-10 04:15:44,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:15:44,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-10 04:15:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:44,554 INFO L225 Difference]: With dead ends: 4202 [2019-09-10 04:15:44,554 INFO L226 Difference]: Without dead ends: 4202 [2019-09-10 04:15:44,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:15:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2019-09-10 04:15:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 4200. [2019-09-10 04:15:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4200 states. [2019-09-10 04:15:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4200 states to 4200 states and 6087 transitions. [2019-09-10 04:15:44,700 INFO L78 Accepts]: Start accepts. Automaton has 4200 states and 6087 transitions. Word has length 96 [2019-09-10 04:15:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:44,701 INFO L475 AbstractCegarLoop]: Abstraction has 4200 states and 6087 transitions. [2019-09-10 04:15:44,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:15:44,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4200 states and 6087 transitions. [2019-09-10 04:15:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:15:44,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:44,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:44,704 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:44,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:44,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1775175999, now seen corresponding path program 1 times [2019-09-10 04:15:44,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:44,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:44,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:44,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:44,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:15:44,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:15:44,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:15:44,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:44,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:15:44,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:15:44,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:15:44,816 INFO L87 Difference]: Start difference. First operand 4200 states and 6087 transitions. Second operand 9 states. [2019-09-10 04:15:45,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:45,688 INFO L93 Difference]: Finished difference Result 6552 states and 9573 transitions. [2019-09-10 04:15:45,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:15:45,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 04:15:45,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:45,723 INFO L225 Difference]: With dead ends: 6552 [2019-09-10 04:15:45,726 INFO L226 Difference]: Without dead ends: 6552 [2019-09-10 04:15:45,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:15:45,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2019-09-10 04:15:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 4224. [2019-09-10 04:15:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4224 states. [2019-09-10 04:15:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4224 states to 4224 states and 6120 transitions. [2019-09-10 04:15:45,913 INFO L78 Accepts]: Start accepts. Automaton has 4224 states and 6120 transitions. Word has length 96 [2019-09-10 04:15:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:45,913 INFO L475 AbstractCegarLoop]: Abstraction has 4224 states and 6120 transitions. [2019-09-10 04:15:45,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:15:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4224 states and 6120 transitions. [2019-09-10 04:15:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:15:45,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:45,919 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:45,919 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:45,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:45,919 INFO L82 PathProgramCache]: Analyzing trace with hash -922068117, now seen corresponding path program 1 times [2019-09-10 04:15:45,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:45,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:45,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:15:46,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:15:46,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:15:46,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:46,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:15:46,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:15:46,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:15:46,067 INFO L87 Difference]: Start difference. First operand 4224 states and 6120 transitions. Second operand 9 states. [2019-09-10 04:15:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:46,962 INFO L93 Difference]: Finished difference Result 5893 states and 8542 transitions. [2019-09-10 04:15:46,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:15:46,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 04:15:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:47,001 INFO L225 Difference]: With dead ends: 5893 [2019-09-10 04:15:47,002 INFO L226 Difference]: Without dead ends: 5887 [2019-09-10 04:15:47,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:15:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5887 states. [2019-09-10 04:15:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5887 to 4241. [2019-09-10 04:15:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4241 states. [2019-09-10 04:15:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4241 states to 4241 states and 6144 transitions. [2019-09-10 04:15:47,156 INFO L78 Accepts]: Start accepts. Automaton has 4241 states and 6144 transitions. Word has length 96 [2019-09-10 04:15:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:47,156 INFO L475 AbstractCegarLoop]: Abstraction has 4241 states and 6144 transitions. [2019-09-10 04:15:47,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:15:47,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4241 states and 6144 transitions. [2019-09-10 04:15:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:15:47,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:47,159 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:47,160 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:47,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1378419157, now seen corresponding path program 1 times [2019-09-10 04:15:47,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:47,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:47,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:47,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:15:47,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:15:47,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:15:47,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:47,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:15:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:15:47,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:15:47,341 INFO L87 Difference]: Start difference. First operand 4241 states and 6144 transitions. Second operand 9 states. [2019-09-10 04:15:48,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:48,210 INFO L93 Difference]: Finished difference Result 5211 states and 7492 transitions. [2019-09-10 04:15:48,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:15:48,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 04:15:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:48,237 INFO L225 Difference]: With dead ends: 5211 [2019-09-10 04:15:48,237 INFO L226 Difference]: Without dead ends: 5205 [2019-09-10 04:15:48,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:15:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2019-09-10 04:15:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 4258. [2019-09-10 04:15:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4258 states. [2019-09-10 04:15:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4258 states to 4258 states and 6168 transitions. [2019-09-10 04:15:48,364 INFO L78 Accepts]: Start accepts. Automaton has 4258 states and 6168 transitions. Word has length 96 [2019-09-10 04:15:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:48,364 INFO L475 AbstractCegarLoop]: Abstraction has 4258 states and 6168 transitions. [2019-09-10 04:15:48,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:15:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4258 states and 6168 transitions. [2019-09-10 04:15:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:15:48,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:48,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:48,367 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:48,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:48,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1891830763, now seen corresponding path program 1 times [2019-09-10 04:15:48,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:48,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:48,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:48,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:48,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:15:48,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:15:48,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:15:48,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:48,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:15:48,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:15:48,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:15:48,520 INFO L87 Difference]: Start difference. First operand 4258 states and 6168 transitions. Second operand 9 states. [2019-09-10 04:15:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:49,390 INFO L93 Difference]: Finished difference Result 4517 states and 6434 transitions. [2019-09-10 04:15:49,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:15:49,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 04:15:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:49,416 INFO L225 Difference]: With dead ends: 4517 [2019-09-10 04:15:49,417 INFO L226 Difference]: Without dead ends: 4511 [2019-09-10 04:15:49,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:15:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states. [2019-09-10 04:15:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 4275. [2019-09-10 04:15:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-09-10 04:15:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6192 transitions. [2019-09-10 04:15:49,532 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6192 transitions. Word has length 96 [2019-09-10 04:15:49,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:49,532 INFO L475 AbstractCegarLoop]: Abstraction has 4275 states and 6192 transitions. [2019-09-10 04:15:49,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:15:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6192 transitions. [2019-09-10 04:15:49,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 04:15:49,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:49,540 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:49,541 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:49,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:49,541 INFO L82 PathProgramCache]: Analyzing trace with hash 140940638, now seen corresponding path program 1 times [2019-09-10 04:15:49,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:49,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:49,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:49,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:49,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-10 04:15:49,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:15:49,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:15:49,659 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-09-10 04:15:49,662 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [221], [224], [227], [229], [234], [239], [240], [241], [244], [249], [251], [273], [275], [277], [289], [301], [303], [305], [306], [309], [331], [333], [363], [364], [367], [389], [391], [421], [422], [425], [447], [449], [479], [480], [481], [482], [485], [507], [509], [539], [540], [543], [545], [548], [550], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [572] [2019-09-10 04:15:49,745 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:15:49,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:15:49,937 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:15:50,407 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:15:50,409 INFO L272 AbstractInterpreter]: Visited 104 different actions 238 times. Merged at 15 different actions 36 times. Never widened. Performed 2841 root evaluator evaluations with a maximum evaluation depth of 7. Performed 2841 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 6 fixpoints after 3 different actions. Largest state had 128 variables. [2019-09-10 04:15:50,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:50,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:15:50,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:15:50,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:15:50,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:50,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:15:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:50,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:15:50,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:15:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-10 04:15:50,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:15:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 04:15:50,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:15:50,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:15:50,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:50,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:15:50,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:15:50,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:15:50,835 INFO L87 Difference]: Start difference. First operand 4275 states and 6192 transitions. Second operand 5 states. [2019-09-10 04:15:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:51,510 INFO L93 Difference]: Finished difference Result 7945 states and 11401 transitions. [2019-09-10 04:15:51,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:15:51,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-10 04:15:51,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:51,546 INFO L225 Difference]: With dead ends: 7945 [2019-09-10 04:15:51,546 INFO L226 Difference]: Without dead ends: 7945 [2019-09-10 04:15:51,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:15:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7945 states. [2019-09-10 04:15:51,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7945 to 7940. [2019-09-10 04:15:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7940 states. [2019-09-10 04:15:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7940 states to 7940 states and 11397 transitions. [2019-09-10 04:15:51,837 INFO L78 Accepts]: Start accepts. Automaton has 7940 states and 11397 transitions. Word has length 147 [2019-09-10 04:15:51,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:51,838 INFO L475 AbstractCegarLoop]: Abstraction has 7940 states and 11397 transitions. [2019-09-10 04:15:51,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:15:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 7940 states and 11397 transitions. [2019-09-10 04:15:51,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 04:15:51,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:51,846 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:51,847 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:51,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:51,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1505128413, now seen corresponding path program 1 times [2019-09-10 04:15:51,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:51,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:51,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 04:15:51,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:15:51,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:15:51,994 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2019-09-10 04:15:51,995 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [221], [224], [227], [229], [234], [239], [240], [241], [244], [249], [251], [273], [275], [277], [289], [301], [303], [305], [306], [309], [331], [333], [363], [364], [367], [389], [391], [421], [422], [425], [447], [449], [451], [463], [475], [477], [479], [480], [481], [482], [485], [507], [509], [539], [540], [543], [545], [548], [550], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [572] [2019-09-10 04:15:52,013 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:15:52,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:15:52,047 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:15:52,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:15:52,541 INFO L272 AbstractInterpreter]: Visited 108 different actions 344 times. Merged at 17 different actions 63 times. Never widened. Performed 4205 root evaluator evaluations with a maximum evaluation depth of 7. Performed 4205 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 12 fixpoints after 5 different actions. Largest state had 128 variables. [2019-09-10 04:15:52,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:52,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:15:52,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:15:52,542 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 04:15:52,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:52,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:15:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:52,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:15:52,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:15:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 04:15:52,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:15:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-10 04:15:52,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:15:52,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:15:52,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:52,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:15:52,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:15:52,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:15:52,958 INFO L87 Difference]: Start difference. First operand 7940 states and 11397 transitions. Second operand 5 states. [2019-09-10 04:15:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:53,560 INFO L93 Difference]: Finished difference Result 14776 states and 20979 transitions. [2019-09-10 04:15:53,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:15:53,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-09-10 04:15:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:53,617 INFO L225 Difference]: With dead ends: 14776 [2019-09-10 04:15:53,618 INFO L226 Difference]: Without dead ends: 14776 [2019-09-10 04:15:53,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 292 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:15:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14776 states. [2019-09-10 04:15:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14776 to 14771. [2019-09-10 04:15:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14771 states. [2019-09-10 04:15:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14771 states to 14771 states and 20975 transitions. [2019-09-10 04:15:54,020 INFO L78 Accepts]: Start accepts. Automaton has 14771 states and 20975 transitions. Word has length 148 [2019-09-10 04:15:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:54,021 INFO L475 AbstractCegarLoop]: Abstraction has 14771 states and 20975 transitions. [2019-09-10 04:15:54,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:15:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 14771 states and 20975 transitions. [2019-09-10 04:15:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 04:15:54,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:54,031 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:54,031 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:54,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:54,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1208108126, now seen corresponding path program 1 times [2019-09-10 04:15:54,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:54,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:54,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:54,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:54,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 04:15:54,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:15:54,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:15:54,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2019-09-10 04:15:54,132 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [221], [224], [227], [229], [234], [239], [240], [241], [244], [249], [251], [273], [275], [277], [289], [301], [303], [305], [306], [309], [331], [333], [363], [364], [367], [389], [391], [421], [422], [425], [447], [449], [451], [463], [475], [477], [479], [480], [481], [482], [485], [507], [509], [511], [523], [535], [537], [539], [540], [543], [545], [548], [550], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [572] [2019-09-10 04:15:54,135 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:15:54,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:15:54,163 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:15:54,870 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:15:54,871 INFO L272 AbstractInterpreter]: Visited 112 different actions 449 times. Merged at 19 different actions 92 times. Never widened. Performed 5628 root evaluator evaluations with a maximum evaluation depth of 7. Performed 5628 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 20 fixpoints after 6 different actions. Largest state had 128 variables. [2019-09-10 04:15:54,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:54,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:15:54,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:15:54,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:15:54,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:54,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:15:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:55,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:15:55,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:15:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 04:15:55,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:15:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:15:55,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:15:55,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:15:55,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:55,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:15:55,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:15:55,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:15:55,228 INFO L87 Difference]: Start difference. First operand 14771 states and 20975 transitions. Second operand 5 states. [2019-09-10 04:15:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:55,832 INFO L93 Difference]: Finished difference Result 27411 states and 38447 transitions. [2019-09-10 04:15:55,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:15:55,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-09-10 04:15:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:55,937 INFO L225 Difference]: With dead ends: 27411 [2019-09-10 04:15:55,937 INFO L226 Difference]: Without dead ends: 27411 [2019-09-10 04:15:55,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:15:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27411 states. [2019-09-10 04:15:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27411 to 27406. [2019-09-10 04:15:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27406 states. [2019-09-10 04:15:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27406 states to 27406 states and 38443 transitions. [2019-09-10 04:15:56,697 INFO L78 Accepts]: Start accepts. Automaton has 27406 states and 38443 transitions. Word has length 149 [2019-09-10 04:15:56,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:15:56,698 INFO L475 AbstractCegarLoop]: Abstraction has 27406 states and 38443 transitions. [2019-09-10 04:15:56,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:15:56,698 INFO L276 IsEmpty]: Start isEmpty. Operand 27406 states and 38443 transitions. [2019-09-10 04:15:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 04:15:56,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:15:56,710 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:15:56,711 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:15:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:56,711 INFO L82 PathProgramCache]: Analyzing trace with hash 301245131, now seen corresponding path program 1 times [2019-09-10 04:15:56,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:15:56,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:56,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:56,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:15:56,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:15:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 04:15:56,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:15:56,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:15:56,823 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2019-09-10 04:15:56,824 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [221], [224], [227], [229], [234], [239], [240], [241], [244], [249], [251], [273], [275], [277], [289], [301], [303], [305], [306], [309], [331], [333], [335], [347], [359], [361], [363], [364], [367], [389], [391], [421], [422], [425], [447], [449], [451], [463], [475], [477], [479], [480], [481], [482], [485], [507], [509], [511], [523], [535], [537], [539], [540], [543], [545], [548], [550], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [572] [2019-09-10 04:15:56,830 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:15:56,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:15:56,855 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:15:58,433 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:15:58,433 INFO L272 AbstractInterpreter]: Visited 116 different actions 520 times. Merged at 21 different actions 113 times. Never widened. Performed 6208 root evaluator evaluations with a maximum evaluation depth of 7. Performed 6208 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 28 fixpoints after 7 different actions. Largest state had 128 variables. [2019-09-10 04:15:58,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:15:58,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:15:58,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:15:58,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:15:58,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:15:58,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:15:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:15:58,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:15:58,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:15:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 04:15:58,645 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:15:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:15:58,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:15:58,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 04:15:58,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:15:58,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:15:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:15:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:15:58,769 INFO L87 Difference]: Start difference. First operand 27406 states and 38443 transitions. Second operand 5 states. [2019-09-10 04:15:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:15:59,578 INFO L93 Difference]: Finished difference Result 50576 states and 69970 transitions. [2019-09-10 04:15:59,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:15:59,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-10 04:15:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:15:59,775 INFO L225 Difference]: With dead ends: 50576 [2019-09-10 04:15:59,775 INFO L226 Difference]: Without dead ends: 50576 [2019-09-10 04:15:59,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:15:59,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50576 states. [2019-09-10 04:16:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50576 to 50571. [2019-09-10 04:16:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50571 states. [2019-09-10 04:16:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50571 states to 50571 states and 69966 transitions. [2019-09-10 04:16:01,047 INFO L78 Accepts]: Start accepts. Automaton has 50571 states and 69966 transitions. Word has length 150 [2019-09-10 04:16:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:16:01,048 INFO L475 AbstractCegarLoop]: Abstraction has 50571 states and 69966 transitions. [2019-09-10 04:16:01,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:16:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 50571 states and 69966 transitions. [2019-09-10 04:16:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 04:16:01,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:16:01,062 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:16:01,063 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:16:01,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:01,063 INFO L82 PathProgramCache]: Analyzing trace with hash 762532196, now seen corresponding path program 1 times [2019-09-10 04:16:01,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:16:01,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:01,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:01,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:16:01,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:16:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 04:16:01,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:01,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:16:01,367 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2019-09-10 04:16:01,368 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [221], [224], [227], [229], [234], [239], [240], [241], [244], [249], [251], [273], [275], [277], [289], [301], [303], [305], [306], [309], [331], [333], [335], [347], [359], [361], [363], [364], [367], [389], [391], [393], [405], [417], [419], [421], [422], [425], [447], [449], [451], [463], [475], [477], [479], [480], [481], [482], [485], [507], [509], [511], [523], [535], [537], [539], [540], [543], [545], [548], [550], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [572] [2019-09-10 04:16:01,372 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:16:01,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:16:01,402 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:16:02,577 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:16:02,578 INFO L272 AbstractInterpreter]: Visited 120 different actions 614 times. Merged at 23 different actions 146 times. Never widened. Performed 6960 root evaluator evaluations with a maximum evaluation depth of 7. Performed 6960 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 39 fixpoints after 7 different actions. Largest state had 128 variables. [2019-09-10 04:16:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:16:02,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:16:02,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:16:02,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:16:02,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:16:02,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:16:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:16:02,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 04:16:02,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:16:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 04:16:03,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:16:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 04:16:04,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 04:16:04,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 12] total 20 [2019-09-10 04:16:04,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:16:04,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:16:04,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:16:04,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-09-10 04:16:04,116 INFO L87 Difference]: Start difference. First operand 50571 states and 69966 transitions. Second operand 11 states. [2019-09-10 04:16:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:16:19,570 INFO L93 Difference]: Finished difference Result 1106602 states and 1503020 transitions. [2019-09-10 04:16:19,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 04:16:19,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2019-09-10 04:16:19,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:16:29,885 INFO L225 Difference]: With dead ends: 1106602 [2019-09-10 04:16:29,886 INFO L226 Difference]: Without dead ends: 1106602 [2019-09-10 04:16:29,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 278 SyntacticMatches, 17 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=502, Invalid=1220, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 04:16:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106602 states. [2019-09-10 04:17:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106602 to 1106158. [2019-09-10 04:17:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1106158 states. [2019-09-10 04:17:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106158 states to 1106158 states and 1502542 transitions. [2019-09-10 04:17:25,787 INFO L78 Accepts]: Start accepts. Automaton has 1106158 states and 1502542 transitions. Word has length 151 [2019-09-10 04:17:25,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:17:25,787 INFO L475 AbstractCegarLoop]: Abstraction has 1106158 states and 1502542 transitions. [2019-09-10 04:17:25,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:17:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1106158 states and 1502542 transitions. [2019-09-10 04:17:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 04:17:37,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:17:37,688 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:17:37,688 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:17:37,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:17:37,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1215951500, now seen corresponding path program 1 times [2019-09-10 04:17:37,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:17:37,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:17:37,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:17:37,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:17:37,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:17:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:17:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 04:17:38,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:17:38,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:17:38,067 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 153 with the following transitions: [2019-09-10 04:17:38,067 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [193], [194], [195], [197], [206], [212], [214], [221], [224], [227], [229], [234], [239], [240], [241], [244], [249], [251], [273], [275], [277], [289], [301], [303], [305], [306], [309], [331], [333], [335], [347], [359], [361], [363], [364], [367], [389], [391], [393], [405], [417], [419], [421], [422], [425], [447], [449], [451], [454], [457], [461], [477], [479], [480], [481], [482], [485], [507], [509], [511], [523], [535], [537], [539], [540], [543], [545], [548], [550], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [572] [2019-09-10 04:17:38,071 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:17:38,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:17:38,092 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:17:39,154 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:17:39,155 INFO L272 AbstractInterpreter]: Visited 121 different actions 865 times. Merged at 23 different actions 207 times. Never widened. Performed 9860 root evaluator evaluations with a maximum evaluation depth of 7. Performed 9860 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 55 fixpoints after 9 different actions. Largest state had 128 variables. [2019-09-10 04:17:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:17:39,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:17:39,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:17:39,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:17:39,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:17:39,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:17:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:17:39,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 04:17:39,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:17:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 04:17:39,515 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:17:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:17:39,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:17:39,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 6, 7] total 30 [2019-09-10 04:17:39,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:17:39,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 04:17:39,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 04:17:39,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2019-09-10 04:17:39,817 INFO L87 Difference]: Start difference. First operand 1106158 states and 1502542 transitions. Second operand 25 states. [2019-09-10 04:17:40,772 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-09-10 04:17:49,406 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 04:17:49,705 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 04:18:02,650 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-09-10 04:18:03,074 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-10 04:18:20,570 WARN L188 SmtUtils]: Spent 11.26 s on a formula simplification. DAG size of input: 43 DAG size of output: 42