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.7_overflow.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:46:43,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:46:43,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:46:43,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:46:43,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:46:43,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:46:43,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:46:43,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:46:43,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:46:43,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:46:43,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:46:43,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:46:43,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:46:43,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:46:43,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:46:43,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:46:43,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:46:43,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:46:43,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:46:43,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:46:43,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:46:43,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:46:43,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:46:43,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:46:43,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:46:43,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:46:43,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:46:43,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:46:43,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:46:43,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:46:43,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:46:43,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:46:43,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:46:43,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:46:43,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:46:43,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:46:43,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:46:43,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:46:43,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:46:43,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:46:43,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:46:43,189 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:46:43,211 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:46:43,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:46:43,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:46:43,212 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:46:43,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:46:43,214 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:46:43,214 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:46:43,214 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:46:43,214 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:46:43,215 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:46:43,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:46:43,217 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:46:43,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:46:43,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:46:43,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:46:43,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:46:43,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:46:43,218 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:46:43,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:46:43,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:46:43,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:46:43,219 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:46:43,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:46:43,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:46:43,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:46:43,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:46:43,220 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:46:43,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:46:43,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:46:43,221 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:46:43,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:46:43,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:46:43,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:46:43,292 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:46:43,292 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:46:43,293 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2019-09-10 04:46:43,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f6f424f3/f26dd17bae7e4cc7af841741eced7fc8/FLAG5497f915b [2019-09-10 04:46:43,881 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:46:43,882 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2019-09-10 04:46:43,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f6f424f3/f26dd17bae7e4cc7af841741eced7fc8/FLAG5497f915b [2019-09-10 04:46:44,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f6f424f3/f26dd17bae7e4cc7af841741eced7fc8 [2019-09-10 04:46:44,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:46:44,190 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:46:44,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:46:44,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:46:44,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:46:44,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:46:44" (1/1) ... [2019-09-10 04:46:44,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d19a501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:46:44, skipping insertion in model container [2019-09-10 04:46:44,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:46:44" (1/1) ... [2019-09-10 04:46:44,206 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:46:44,250 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:46:44,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:46:44,625 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:46:44,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:46:44,734 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:46:44,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:46:44 WrapperNode [2019-09-10 04:46:44,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:46:44,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:46:44,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:46:44,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:46:44,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:46:44" (1/1) ... [2019-09-10 04:46:44,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:46:44" (1/1) ... [2019-09-10 04:46:44,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:46:44" (1/1) ... [2019-09-10 04:46:44,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:46:44" (1/1) ... [2019-09-10 04:46:44,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:46:44" (1/1) ... [2019-09-10 04:46:44,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:46:44" (1/1) ... [2019-09-10 04:46:44,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:46:44" (1/1) ... [2019-09-10 04:46:44,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:46:44,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:46:44,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:46:44,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:46:44,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:46:44" (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:46:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:46:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:46:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:46:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:46:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:46:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:46:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:46:44,856 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-10 04:46:44,857 INFO L138 BoogieDeclarations]: Found implementation of procedure node7 [2019-09-10 04:46:44,857 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:46:44,857 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:46:44,857 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:46:44,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:46:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:46:44,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:46:44,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:46:44,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:46:44,858 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:46:44,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:46:44,858 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:46:44,859 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:46:44,859 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:46:44,859 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:46:44,859 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:46:44,859 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:46:44,859 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:46:44,859 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 04:46:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 04:46:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:46:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:46:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:46:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:46:44,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:46:45,689 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:46:45,689 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:46:45,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:46:45 BoogieIcfgContainer [2019-09-10 04:46:45,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:46:45,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:46:45,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:46:45,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:46:45,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:46:44" (1/3) ... [2019-09-10 04:46:45,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b63642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:46:45, skipping insertion in model container [2019-09-10 04:46:45,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:46:44" (2/3) ... [2019-09-10 04:46:45,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b63642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:46:45, skipping insertion in model container [2019-09-10 04:46:45,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:46:45" (3/3) ... [2019-09-10 04:46:45,704 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2019-09-10 04:46:45,714 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:46:45,722 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:46:45,739 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:46:45,766 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:46:45,766 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:46:45,766 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:46:45,766 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:46:45,766 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:46:45,767 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:46:45,767 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:46:45,767 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:46:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2019-09-10 04:46:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 04:46:45,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:46:45,808 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] [2019-09-10 04:46:45,810 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:46:45,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:46:45,815 INFO L82 PathProgramCache]: Analyzing trace with hash -413245806, now seen corresponding path program 1 times [2019-09-10 04:46:45,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:46:45,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:46:45,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:46:45,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:46:45,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:46:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:46:46,302 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:46:46,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:46:46,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:46:46,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:46:46,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:46:46,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:46:46,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:46:46,332 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 5 states. [2019-09-10 04:46:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:46:46,487 INFO L93 Difference]: Finished difference Result 163 states and 252 transitions. [2019-09-10 04:46:46,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:46:46,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 04:46:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:46:46,503 INFO L225 Difference]: With dead ends: 163 [2019-09-10 04:46:46,504 INFO L226 Difference]: Without dead ends: 159 [2019-09-10 04:46:46,505 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:46:46,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-09-10 04:46:46,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-09-10 04:46:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-10 04:46:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 199 transitions. [2019-09-10 04:46:46,554 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 199 transitions. Word has length 75 [2019-09-10 04:46:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:46:46,554 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 199 transitions. [2019-09-10 04:46:46,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:46:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 199 transitions. [2019-09-10 04:46:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 04:46:46,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:46:46,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:46,560 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:46:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:46:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash -350916994, now seen corresponding path program 1 times [2019-09-10 04:46:46,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:46:46,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:46:46,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:46:46,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:46:46,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:46:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:46:47,221 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:46:47,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:46:47,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 04:46:47,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:46:47,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 04:46:47,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 04:46:47,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-09-10 04:46:47,227 INFO L87 Difference]: Start difference. First operand 159 states and 199 transitions. Second operand 17 states. [2019-09-10 04:47:01,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:01,095 INFO L93 Difference]: Finished difference Result 2029 states and 3209 transitions. [2019-09-10 04:47:01,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 04:47:01,096 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 124 [2019-09-10 04:47:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:01,136 INFO L225 Difference]: With dead ends: 2029 [2019-09-10 04:47:01,137 INFO L226 Difference]: Without dead ends: 2029 [2019-09-10 04:47:01,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3673 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1998, Invalid=7122, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 04:47:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2019-09-10 04:47:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1049. [2019-09-10 04:47:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2019-09-10 04:47:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1497 transitions. [2019-09-10 04:47:01,363 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1497 transitions. Word has length 124 [2019-09-10 04:47:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:01,366 INFO L475 AbstractCegarLoop]: Abstraction has 1049 states and 1497 transitions. [2019-09-10 04:47:01,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 04:47:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1497 transitions. [2019-09-10 04:47:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:47:01,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:01,384 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:01,384 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:01,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:01,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1555525682, now seen corresponding path program 1 times [2019-09-10 04:47:01,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:01,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:01,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:01,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:01,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:01,525 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:47:01,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:01,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:47:01,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:01,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:47:01,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:47:01,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:47:01,527 INFO L87 Difference]: Start difference. First operand 1049 states and 1497 transitions. Second operand 3 states. [2019-09-10 04:47:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:01,576 INFO L93 Difference]: Finished difference Result 1974 states and 2824 transitions. [2019-09-10 04:47:01,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:47:01,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 04:47:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:01,591 INFO L225 Difference]: With dead ends: 1974 [2019-09-10 04:47:01,592 INFO L226 Difference]: Without dead ends: 1974 [2019-09-10 04:47:01,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:47:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-09-10 04:47:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1972. [2019-09-10 04:47:01,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1972 states. [2019-09-10 04:47:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2823 transitions. [2019-09-10 04:47:01,723 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 2823 transitions. Word has length 126 [2019-09-10 04:47:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:01,723 INFO L475 AbstractCegarLoop]: Abstraction has 1972 states and 2823 transitions. [2019-09-10 04:47:01,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:47:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2823 transitions. [2019-09-10 04:47:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:47:01,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:01,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:01,728 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1451739158, now seen corresponding path program 1 times [2019-09-10 04:47:01,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:01,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:01,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:01,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:01,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:01,900 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:47:01,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:01,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:01,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:01,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:01,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:01,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:01,902 INFO L87 Difference]: Start difference. First operand 1972 states and 2823 transitions. Second operand 5 states. [2019-09-10 04:47:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:02,482 INFO L93 Difference]: Finished difference Result 3744 states and 5358 transitions. [2019-09-10 04:47:02,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:02,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:47:02,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:02,506 INFO L225 Difference]: With dead ends: 3744 [2019-09-10 04:47:02,506 INFO L226 Difference]: Without dead ends: 3744 [2019-09-10 04:47:02,507 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:47:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2019-09-10 04:47:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3742. [2019-09-10 04:47:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-09-10 04:47:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 5357 transitions. [2019-09-10 04:47:02,661 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 5357 transitions. Word has length 126 [2019-09-10 04:47:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:02,661 INFO L475 AbstractCegarLoop]: Abstraction has 3742 states and 5357 transitions. [2019-09-10 04:47:02,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 5357 transitions. [2019-09-10 04:47:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:47:02,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:02,665 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:02,665 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:02,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:02,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1647482868, now seen corresponding path program 1 times [2019-09-10 04:47:02,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:02,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:02,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:02,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:02,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:02,812 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:47:02,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:02,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:02,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:02,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:02,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:02,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:02,814 INFO L87 Difference]: Start difference. First operand 3742 states and 5357 transitions. Second operand 5 states. [2019-09-10 04:47:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:03,444 INFO L93 Difference]: Finished difference Result 7170 states and 10208 transitions. [2019-09-10 04:47:03,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:03,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:47:03,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:03,486 INFO L225 Difference]: With dead ends: 7170 [2019-09-10 04:47:03,487 INFO L226 Difference]: Without dead ends: 7170 [2019-09-10 04:47:03,487 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:47:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-09-10 04:47:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7168. [2019-09-10 04:47:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7168 states. [2019-09-10 04:47:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 10207 transitions. [2019-09-10 04:47:03,755 INFO L78 Accepts]: Start accepts. Automaton has 7168 states and 10207 transitions. Word has length 126 [2019-09-10 04:47:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:03,755 INFO L475 AbstractCegarLoop]: Abstraction has 7168 states and 10207 transitions. [2019-09-10 04:47:03,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 7168 states and 10207 transitions. [2019-09-10 04:47:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:47:03,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:03,759 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:03,760 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:03,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:03,760 INFO L82 PathProgramCache]: Analyzing trace with hash 556504150, now seen corresponding path program 1 times [2019-09-10 04:47:03,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:03,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:03,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:03,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:03,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:03,957 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:47:03,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:03,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:03,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:03,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:03,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:03,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:03,959 INFO L87 Difference]: Start difference. First operand 7168 states and 10207 transitions. Second operand 5 states. [2019-09-10 04:47:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:04,618 INFO L93 Difference]: Finished difference Result 13746 states and 19456 transitions. [2019-09-10 04:47:04,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:04,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:47:04,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:04,713 INFO L225 Difference]: With dead ends: 13746 [2019-09-10 04:47:04,713 INFO L226 Difference]: Without dead ends: 13746 [2019-09-10 04:47:04,713 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:47:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13746 states. [2019-09-10 04:47:05,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13746 to 13744. [2019-09-10 04:47:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13744 states. [2019-09-10 04:47:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13744 states to 13744 states and 19455 transitions. [2019-09-10 04:47:05,289 INFO L78 Accepts]: Start accepts. Automaton has 13744 states and 19455 transitions. Word has length 126 [2019-09-10 04:47:05,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:05,290 INFO L475 AbstractCegarLoop]: Abstraction has 13744 states and 19455 transitions. [2019-09-10 04:47:05,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 13744 states and 19455 transitions. [2019-09-10 04:47:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:47:05,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:05,293 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:05,293 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:05,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:05,294 INFO L82 PathProgramCache]: Analyzing trace with hash -794671284, now seen corresponding path program 1 times [2019-09-10 04:47:05,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:05,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:05,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:05,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:05,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:05,453 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:47:05,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:05,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:05,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:05,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:05,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:05,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:05,455 INFO L87 Difference]: Start difference. First operand 13744 states and 19455 transitions. Second operand 5 states. [2019-09-10 04:47:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:06,110 INFO L93 Difference]: Finished difference Result 26370 states and 37072 transitions. [2019-09-10 04:47:06,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:06,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:47:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:06,259 INFO L225 Difference]: With dead ends: 26370 [2019-09-10 04:47:06,259 INFO L226 Difference]: Without dead ends: 26370 [2019-09-10 04:47:06,260 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:47:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26370 states. [2019-09-10 04:47:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26370 to 26368. [2019-09-10 04:47:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26368 states. [2019-09-10 04:47:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26368 states to 26368 states and 37071 transitions. [2019-09-10 04:47:07,497 INFO L78 Accepts]: Start accepts. Automaton has 26368 states and 37071 transitions. Word has length 126 [2019-09-10 04:47:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:07,498 INFO L475 AbstractCegarLoop]: Abstraction has 26368 states and 37071 transitions. [2019-09-10 04:47:07,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 26368 states and 37071 transitions. [2019-09-10 04:47:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:47:07,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:07,503 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:07,503 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:07,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:07,503 INFO L82 PathProgramCache]: Analyzing trace with hash 452837570, now seen corresponding path program 1 times [2019-09-10 04:47:07,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:07,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:07,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:07,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:07,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:07,662 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:47:07,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:07,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:07,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:07,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:07,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:07,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:07,664 INFO L87 Difference]: Start difference. First operand 26368 states and 37071 transitions. Second operand 5 states. [2019-09-10 04:47:08,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:08,379 INFO L93 Difference]: Finished difference Result 50466 states and 70464 transitions. [2019-09-10 04:47:08,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:08,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-10 04:47:08,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:08,748 INFO L225 Difference]: With dead ends: 50466 [2019-09-10 04:47:08,748 INFO L226 Difference]: Without dead ends: 50466 [2019-09-10 04:47:08,749 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:47:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50466 states. [2019-09-10 04:47:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50466 to 50464. [2019-09-10 04:47:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50464 states. [2019-09-10 04:47:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50464 states to 50464 states and 70463 transitions. [2019-09-10 04:47:10,343 INFO L78 Accepts]: Start accepts. Automaton has 50464 states and 70463 transitions. Word has length 126 [2019-09-10 04:47:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:10,344 INFO L475 AbstractCegarLoop]: Abstraction has 50464 states and 70463 transitions. [2019-09-10 04:47:10,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 50464 states and 70463 transitions. [2019-09-10 04:47:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:47:10,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:10,346 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:10,346 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:10,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1185390580, now seen corresponding path program 1 times [2019-09-10 04:47:10,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:10,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:10,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:10,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:10,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:10,835 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:47:10,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:10,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 04:47:10,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:10,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 04:47:10,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 04:47:10,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-09-10 04:47:10,837 INFO L87 Difference]: Start difference. First operand 50464 states and 70463 transitions. Second operand 17 states. [2019-09-10 04:47:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:25,568 INFO L93 Difference]: Finished difference Result 118396 states and 190477 transitions. [2019-09-10 04:47:25,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-10 04:47:25,568 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2019-09-10 04:47:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:26,105 INFO L225 Difference]: With dead ends: 118396 [2019-09-10 04:47:26,106 INFO L226 Difference]: Without dead ends: 118396 [2019-09-10 04:47:26,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3638 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2040, Invalid=7080, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 04:47:26,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118396 states. [2019-09-10 04:47:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118396 to 69728. [2019-09-10 04:47:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69728 states. [2019-09-10 04:47:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69728 states to 69728 states and 97631 transitions. [2019-09-10 04:47:29,274 INFO L78 Accepts]: Start accepts. Automaton has 69728 states and 97631 transitions. Word has length 126 [2019-09-10 04:47:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:29,275 INFO L475 AbstractCegarLoop]: Abstraction has 69728 states and 97631 transitions. [2019-09-10 04:47:29,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 04:47:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 69728 states and 97631 transitions. [2019-09-10 04:47:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:47:29,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:29,277 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:29,277 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:29,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:29,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1595147712, now seen corresponding path program 1 times [2019-09-10 04:47:29,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:29,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:29,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:29,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:29,400 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:47:29,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:29,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:47:29,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:29,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:47:29,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:47:29,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:47:29,402 INFO L87 Difference]: Start difference. First operand 69728 states and 97631 transitions. Second operand 9 states. [2019-09-10 04:47:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:30,582 INFO L93 Difference]: Finished difference Result 97625 states and 134343 transitions. [2019-09-10 04:47:30,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:47:30,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 126 [2019-09-10 04:47:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:30,928 INFO L225 Difference]: With dead ends: 97625 [2019-09-10 04:47:30,929 INFO L226 Difference]: Without dead ends: 97625 [2019-09-10 04:47:30,930 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:47:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97625 states. [2019-09-10 04:47:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97625 to 69791. [2019-09-10 04:47:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69791 states. [2019-09-10 04:47:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69791 states to 69791 states and 97709 transitions. [2019-09-10 04:47:34,444 INFO L78 Accepts]: Start accepts. Automaton has 69791 states and 97709 transitions. Word has length 126 [2019-09-10 04:47:34,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:34,444 INFO L475 AbstractCegarLoop]: Abstraction has 69791 states and 97709 transitions. [2019-09-10 04:47:34,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:47:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 69791 states and 97709 transitions. [2019-09-10 04:47:34,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:47:34,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:34,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:34,448 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:34,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:34,449 INFO L82 PathProgramCache]: Analyzing trace with hash -310265592, now seen corresponding path program 1 times [2019-09-10 04:47:34,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:34,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:34,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:34,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:34,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:34,590 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:47:34,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:34,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:47:34,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:34,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:47:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:47:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:47:34,592 INFO L87 Difference]: Start difference. First operand 69791 states and 97709 transitions. Second operand 9 states. [2019-09-10 04:47:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:36,172 INFO L93 Difference]: Finished difference Result 94509 states and 132124 transitions. [2019-09-10 04:47:36,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:47:36,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 126 [2019-09-10 04:47:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:36,492 INFO L225 Difference]: With dead ends: 94509 [2019-09-10 04:47:36,492 INFO L226 Difference]: Without dead ends: 94503 [2019-09-10 04:47:36,494 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:47:36,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94503 states. [2019-09-10 04:47:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94503 to 84124. [2019-09-10 04:47:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84124 states. [2019-09-10 04:47:38,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84124 states to 84124 states and 118019 transitions. [2019-09-10 04:47:38,531 INFO L78 Accepts]: Start accepts. Automaton has 84124 states and 118019 transitions. Word has length 126 [2019-09-10 04:47:38,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:38,532 INFO L475 AbstractCegarLoop]: Abstraction has 84124 states and 118019 transitions. [2019-09-10 04:47:38,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:47:38,532 INFO L276 IsEmpty]: Start isEmpty. Operand 84124 states and 118019 transitions. [2019-09-10 04:47:38,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:47:38,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:38,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:38,534 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:38,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:38,534 INFO L82 PathProgramCache]: Analyzing trace with hash -842811969, now seen corresponding path program 1 times [2019-09-10 04:47:38,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:38,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:38,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:38,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:38,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:38,678 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:47:38,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:38,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:38,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:38,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:38,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:38,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:38,681 INFO L87 Difference]: Start difference. First operand 84124 states and 118019 transitions. Second operand 5 states. [2019-09-10 04:47:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:39,624 INFO L93 Difference]: Finished difference Result 113754 states and 158917 transitions. [2019-09-10 04:47:39,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:39,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-09-10 04:47:39,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:40,019 INFO L225 Difference]: With dead ends: 113754 [2019-09-10 04:47:40,020 INFO L226 Difference]: Without dead ends: 113748 [2019-09-10 04:47:40,020 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:47:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113748 states. [2019-09-10 04:47:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113748 to 113742. [2019-09-10 04:47:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113742 states. [2019-09-10 04:47:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113742 states to 113742 states and 158907 transitions. [2019-09-10 04:47:42,363 INFO L78 Accepts]: Start accepts. Automaton has 113742 states and 158907 transitions. Word has length 127 [2019-09-10 04:47:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:42,364 INFO L475 AbstractCegarLoop]: Abstraction has 113742 states and 158907 transitions. [2019-09-10 04:47:42,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 113742 states and 158907 transitions. [2019-09-10 04:47:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:47:42,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:42,366 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:42,366 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:42,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:42,366 INFO L82 PathProgramCache]: Analyzing trace with hash 804612992, now seen corresponding path program 1 times [2019-09-10 04:47:42,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:42,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:42,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:42,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:42,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:42,506 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:47:42,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:42,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:47:42,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:42,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:47:42,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:47:42,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:47:42,507 INFO L87 Difference]: Start difference. First operand 113742 states and 158907 transitions. Second operand 11 states. [2019-09-10 04:47:45,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:45,460 INFO L93 Difference]: Finished difference Result 130819 states and 191556 transitions. [2019-09-10 04:47:45,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:47:45,460 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2019-09-10 04:47:45,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:45,781 INFO L225 Difference]: With dead ends: 130819 [2019-09-10 04:47:45,781 INFO L226 Difference]: Without dead ends: 130819 [2019-09-10 04:47:45,782 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:47:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130819 states. [2019-09-10 04:47:47,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130819 to 120078. [2019-09-10 04:47:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120078 states. [2019-09-10 04:47:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120078 states to 120078 states and 165403 transitions. [2019-09-10 04:47:47,935 INFO L78 Accepts]: Start accepts. Automaton has 120078 states and 165403 transitions. Word has length 127 [2019-09-10 04:47:47,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:47,935 INFO L475 AbstractCegarLoop]: Abstraction has 120078 states and 165403 transitions. [2019-09-10 04:47:47,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:47:47,935 INFO L276 IsEmpty]: Start isEmpty. Operand 120078 states and 165403 transitions. [2019-09-10 04:47:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:47:47,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:47,936 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:47,937 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:47,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:47,937 INFO L82 PathProgramCache]: Analyzing trace with hash -376867979, now seen corresponding path program 1 times [2019-09-10 04:47:47,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:47,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:47,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:48,068 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:47:48,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:47:48,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:47:48,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:47:48,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:47:48,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:47:48,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:47:48,070 INFO L87 Difference]: Start difference. First operand 120078 states and 165403 transitions. Second operand 5 states. [2019-09-10 04:47:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:48,980 INFO L93 Difference]: Finished difference Result 147213 states and 199154 transitions. [2019-09-10 04:47:48,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:47:48,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-09-10 04:47:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:49,280 INFO L225 Difference]: With dead ends: 147213 [2019-09-10 04:47:49,281 INFO L226 Difference]: Without dead ends: 147213 [2019-09-10 04:47:49,281 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:47:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147213 states. [2019-09-10 04:47:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147213 to 147208. [2019-09-10 04:47:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147208 states. [2019-09-10 04:47:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147208 states to 147208 states and 199150 transitions. [2019-09-10 04:47:51,982 INFO L78 Accepts]: Start accepts. Automaton has 147208 states and 199150 transitions. Word has length 127 [2019-09-10 04:47:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:47:51,982 INFO L475 AbstractCegarLoop]: Abstraction has 147208 states and 199150 transitions. [2019-09-10 04:47:51,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:47:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 147208 states and 199150 transitions. [2019-09-10 04:47:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 04:47:52,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:47:52,022 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:52,023 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:47:52,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:52,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1329221549, now seen corresponding path program 1 times [2019-09-10 04:47:52,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:47:52,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:52,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:47:52,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:47:52,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:47:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:47:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-10 04:47:52,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:47:52,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:47:52,130 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2019-09-10 04:47:52,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], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [301], [302], [303], [305], [314], [322], [324], [331], [334], [339], [342], [346], [359], [361], [362], [363], [386], [389], [393], [395], [396], [419], [422], [426], [428], [429], [432], [448], [450], [452], [455], [459], [461], [462], [465], [481], [483], [485], [488], [492], [494], [495], [496], [497], [500], [516], [518], [520], [523], [527], [529], [530], [533], [535], [538], [540], [541], [544], [560], [562], [564], [567], [571], [573], [574], [577], [580], [585], [588], [595], [597], [600], [604], [606], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [630], [631], [632] [2019-09-10 04:47:52,210 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:47:52,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:47:52,369 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:47:58,010 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:47:58,013 INFO L272 AbstractInterpreter]: Visited 147 different actions 1431 times. Merged at 22 different actions 304 times. Widened at 1 different actions 1 times. Performed 21844 root evaluator evaluations with a maximum evaluation depth of 7. Performed 21844 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 71 fixpoints after 7 different actions. Largest state had 153 variables. [2019-09-10 04:47:58,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:47:58,018 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:47:58,733 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 77.96% of their original sizes. [2019-09-10 04:47:58,734 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:48:06,575 INFO L420 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2019-09-10 04:48:06,575 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:48:06,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:48:06,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [86] imperfect sequences [5] total 89 [2019-09-10 04:48:06,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:48:06,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-09-10 04:48:06,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-09-10 04:48:06,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=678, Invalid=6632, Unknown=0, NotChecked=0, Total=7310 [2019-09-10 04:48:06,581 INFO L87 Difference]: Start difference. First operand 147208 states and 199150 transitions. Second operand 86 states. [2019-09-10 04:54:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:54:14,901 INFO L93 Difference]: Finished difference Result 184423 states and 263509 transitions. [2019-09-10 04:54:14,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 285 states. [2019-09-10 04:54:14,901 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 192 [2019-09-10 04:54:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:54:15,888 INFO L225 Difference]: With dead ends: 184423 [2019-09-10 04:54:15,888 INFO L226 Difference]: Without dead ends: 184423 [2019-09-10 04:54:15,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42290 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=8487, Invalid=106095, Unknown=0, NotChecked=0, Total=114582 [2019-09-10 04:54:16,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184423 states. [2019-09-10 04:54:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184423 to 161923. [2019-09-10 04:54:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161923 states. [2019-09-10 04:54:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161923 states to 161923 states and 217991 transitions. [2019-09-10 04:54:22,653 INFO L78 Accepts]: Start accepts. Automaton has 161923 states and 217991 transitions. Word has length 192 [2019-09-10 04:54:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:54:22,653 INFO L475 AbstractCegarLoop]: Abstraction has 161923 states and 217991 transitions. [2019-09-10 04:54:22,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-09-10 04:54:22,655 INFO L276 IsEmpty]: Start isEmpty. Operand 161923 states and 217991 transitions. [2019-09-10 04:54:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 04:54:22,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:54:22,711 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:22,712 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:54:22,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:54:22,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1951540649, now seen corresponding path program 1 times [2019-09-10 04:54:22,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:54:22,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:54:22,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:54:22,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:54:22,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:54:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:54:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 04:54:22,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:54:22,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:54:22,837 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 193 with the following transitions: [2019-09-10 04:54:22,839 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [301], [302], [303], [305], [314], [322], [324], [331], [334], [339], [342], [346], [359], [361], [362], [363], [366], [369], [374], [377], [384], [386], [389], [393], [395], [396], [419], [422], [426], [428], [429], [432], [448], [450], [452], [455], [459], [461], [462], [465], [481], [483], [485], [488], [492], [494], [495], [496], [497], [500], [516], [518], [520], [523], [527], [529], [530], [533], [535], [538], [540], [541], [544], [560], [562], [564], [567], [571], [573], [574], [577], [593], [595], [597], [600], [604], [606], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [626], [627], [628], [629], [630], [631], [632] [2019-09-10 04:54:22,848 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:54:22,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:54:22,873 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:54:27,376 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:54:27,376 INFO L272 AbstractInterpreter]: Visited 150 different actions 1868 times. Merged at 24 different actions 431 times. Widened at 1 different actions 1 times. Performed 27110 root evaluator evaluations with a maximum evaluation depth of 7. Performed 27110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 114 fixpoints after 10 different actions. Largest state had 153 variables. [2019-09-10 04:54:27,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:54:27,377 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:54:27,778 INFO L227 lantSequenceWeakener]: Weakened 58 states. On average, predicates are now at 83.24% of their original sizes. [2019-09-10 04:54:27,778 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:54:50,494 INFO L420 sIntCurrentIteration]: We unified 191 AI predicates to 191 [2019-09-10 04:54:50,494 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:54:50,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:54:50,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [106] imperfect sequences [5] total 109 [2019-09-10 04:54:50,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:54:50,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-09-10 04:54:50,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-09-10 04:54:50,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1288, Invalid=9842, Unknown=0, NotChecked=0, Total=11130 [2019-09-10 04:54:50,498 INFO L87 Difference]: Start difference. First operand 161923 states and 217991 transitions. Second operand 106 states.