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_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:54:17,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:54:17,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:54:17,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:54:17,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:54:17,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:54:17,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:54:17,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:54:17,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:54:17,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:54:17,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:54:17,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:54:17,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:54:17,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:54:17,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:54:17,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:54:17,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:54:17,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:54:17,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:54:17,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:54:17,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:54:17,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:54:17,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:54:17,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:54:17,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:54:17,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:54:17,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:54:17,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:54:17,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:54:17,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:54:17,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:54:17,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:54:17,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:54:17,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:54:17,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:54:17,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:54:17,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:54:17,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:54:17,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:54:17,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:54:17,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:54:17,581 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 03:54:17,595 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:54:17,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:54:17,596 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:54:17,596 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:54:17,596 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:54:17,597 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:54:17,597 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:54:17,597 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:54:17,597 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:54:17,597 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:54:17,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:54:17,598 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:54:17,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:54:17,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:54:17,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:54:17,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:54:17,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:54:17,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:54:17,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:54:17,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:54:17,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:54:17,601 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:54:17,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:54:17,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:54:17,601 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:54:17,601 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:54:17,602 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:54:17,602 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:54:17,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:54:17,602 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:54:17,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:54:17,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:54:17,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:54:17,648 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:54:17,649 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:54:17,650 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2019-09-10 03:54:17,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0139e7e8/4e370914d6bb43dea9f66a54146a5e87/FLAG08d8d5832 [2019-09-10 03:54:18,193 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:54:18,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2019-09-10 03:54:18,205 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0139e7e8/4e370914d6bb43dea9f66a54146a5e87/FLAG08d8d5832 [2019-09-10 03:54:18,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0139e7e8/4e370914d6bb43dea9f66a54146a5e87 [2019-09-10 03:54:18,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:54:18,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:54:18,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:54:18,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:54:18,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:54:18,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:54:18" (1/1) ... [2019-09-10 03:54:18,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5d63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:18, skipping insertion in model container [2019-09-10 03:54:18,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:54:18" (1/1) ... [2019-09-10 03:54:18,605 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:54:18,645 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:54:19,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:54:19,048 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:54:19,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:54:19,162 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:54:19,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:19 WrapperNode [2019-09-10 03:54:19,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:54:19,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:54:19,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:54:19,163 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:54:19,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:19" (1/1) ... [2019-09-10 03:54:19,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:19" (1/1) ... [2019-09-10 03:54:19,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:19" (1/1) ... [2019-09-10 03:54:19,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:19" (1/1) ... [2019-09-10 03:54:19,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:19" (1/1) ... [2019-09-10 03:54:19,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:19" (1/1) ... [2019-09-10 03:54:19,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:19" (1/1) ... [2019-09-10 03:54:19,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:54:19,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:54:19,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:54:19,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:54:19,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:19" (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 03:54:19,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:54:19,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:54:19,298 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-09-10 03:54:19,299 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-09-10 03:54:19,299 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-09-10 03:54:19,299 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-09-10 03:54:19,299 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-09-10 03:54:19,299 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 03:54:19,299 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 03:54:19,299 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-09-10 03:54:19,300 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-09-10 03:54:19,300 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-09-10 03:54:19,300 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-09-10 03:54:19,300 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:54:19,300 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 03:54:19,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:54:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 03:54:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 03:54:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 03:54:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 03:54:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 03:54:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 03:54:19,302 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-09-10 03:54:19,302 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-09-10 03:54:19,302 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-09-10 03:54:19,302 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-09-10 03:54:19,302 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-09-10 03:54:19,302 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 03:54:19,302 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 03:54:19,303 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-09-10 03:54:19,303 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-09-10 03:54:19,303 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-09-10 03:54:19,303 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-09-10 03:54:19,303 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:54:19,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:54:19,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:54:20,090 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:54:20,090 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-10 03:54:20,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:54:20 BoogieIcfgContainer [2019-09-10 03:54:20,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:54:20,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:54:20,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:54:20,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:54:20,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:54:18" (1/3) ... [2019-09-10 03:54:20,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@866344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:54:20, skipping insertion in model container [2019-09-10 03:54:20,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:19" (2/3) ... [2019-09-10 03:54:20,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@866344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:54:20, skipping insertion in model container [2019-09-10 03:54:20,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:54:20" (3/3) ... [2019-09-10 03:54:20,101 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2019-09-10 03:54:20,112 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:54:20,121 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:54:20,139 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:54:20,163 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:54:20,164 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:54:20,164 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:54:20,164 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:54:20,164 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:54:20,164 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:54:20,164 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:54:20,164 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:54:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states. [2019-09-10 03:54:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 03:54:20,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:20,201 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] [2019-09-10 03:54:20,203 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash -839663837, now seen corresponding path program 1 times [2019-09-10 03:54:20,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:20,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:20,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:20,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:54:20,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:20,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:20,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:20,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:20,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:20,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:20,552 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 4 states. [2019-09-10 03:54:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:20,724 INFO L93 Difference]: Finished difference Result 217 states and 324 transitions. [2019-09-10 03:54:20,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:20,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-10 03:54:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:20,743 INFO L225 Difference]: With dead ends: 217 [2019-09-10 03:54:20,744 INFO L226 Difference]: Without dead ends: 212 [2019-09-10 03:54:20,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-10 03:54:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2019-09-10 03:54:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 03:54:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 312 transitions. [2019-09-10 03:54:20,817 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 312 transitions. Word has length 21 [2019-09-10 03:54:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:20,817 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 312 transitions. [2019-09-10 03:54:20,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 312 transitions. [2019-09-10 03:54:20,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 03:54:20,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:20,821 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] [2019-09-10 03:54:20,821 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:20,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1544889538, now seen corresponding path program 1 times [2019-09-10 03:54:20,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:20,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:20,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:20,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:20,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:20,996 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 03:54:20,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:20,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:20,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:20,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:20,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:20,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:20,999 INFO L87 Difference]: Start difference. First operand 210 states and 312 transitions. Second operand 4 states. [2019-09-10 03:54:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:21,069 INFO L93 Difference]: Finished difference Result 226 states and 333 transitions. [2019-09-10 03:54:21,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:21,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-10 03:54:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:21,079 INFO L225 Difference]: With dead ends: 226 [2019-09-10 03:54:21,079 INFO L226 Difference]: Without dead ends: 226 [2019-09-10 03:54:21,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:21,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-10 03:54:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2019-09-10 03:54:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-09-10 03:54:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 328 transitions. [2019-09-10 03:54:21,136 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 328 transitions. Word has length 22 [2019-09-10 03:54:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:21,136 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 328 transitions. [2019-09-10 03:54:21,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 328 transitions. [2019-09-10 03:54:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 03:54:21,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:21,142 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 03:54:21,142 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:21,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2043974813, now seen corresponding path program 1 times [2019-09-10 03:54:21,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:21,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:21,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:21,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:21,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:54:21,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:21,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:54:21,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:21,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:54:21,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:54:21,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:54:21,211 INFO L87 Difference]: Start difference. First operand 223 states and 328 transitions. Second operand 3 states. [2019-09-10 03:54:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:21,234 INFO L93 Difference]: Finished difference Result 252 states and 373 transitions. [2019-09-10 03:54:21,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:54:21,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-10 03:54:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:21,239 INFO L225 Difference]: With dead ends: 252 [2019-09-10 03:54:21,239 INFO L226 Difference]: Without dead ends: 252 [2019-09-10 03:54:21,239 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 03:54:21,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-10 03:54:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 225. [2019-09-10 03:54:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-10 03:54:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 330 transitions. [2019-09-10 03:54:21,258 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 330 transitions. Word has length 30 [2019-09-10 03:54:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:21,259 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 330 transitions. [2019-09-10 03:54:21,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:54:21,259 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 330 transitions. [2019-09-10 03:54:21,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 03:54:21,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:21,261 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 03:54:21,261 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:21,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:21,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2005997524, now seen corresponding path program 1 times [2019-09-10 03:54:21,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:21,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:21,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:21,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:21,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:54:21,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:21,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:21,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:21,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:21,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:21,341 INFO L87 Difference]: Start difference. First operand 225 states and 330 transitions. Second operand 5 states. [2019-09-10 03:54:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:21,383 INFO L93 Difference]: Finished difference Result 233 states and 340 transitions. [2019-09-10 03:54:21,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:21,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-09-10 03:54:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:21,389 INFO L225 Difference]: With dead ends: 233 [2019-09-10 03:54:21,389 INFO L226 Difference]: Without dead ends: 233 [2019-09-10 03:54:21,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-10 03:54:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2019-09-10 03:54:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-10 03:54:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 334 transitions. [2019-09-10 03:54:21,419 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 334 transitions. Word has length 38 [2019-09-10 03:54:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:21,419 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 334 transitions. [2019-09-10 03:54:21,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 334 transitions. [2019-09-10 03:54:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 03:54:21,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:21,429 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] [2019-09-10 03:54:21,429 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:21,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:21,430 INFO L82 PathProgramCache]: Analyzing trace with hash -263864755, now seen corresponding path program 1 times [2019-09-10 03:54:21,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:21,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:21,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:21,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:21,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:21,528 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 03:54:21,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:21,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:21,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:21,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:21,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:21,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:21,531 INFO L87 Difference]: Start difference. First operand 229 states and 334 transitions. Second operand 4 states. [2019-09-10 03:54:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:21,554 INFO L93 Difference]: Finished difference Result 232 states and 336 transitions. [2019-09-10 03:54:21,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:21,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-09-10 03:54:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:21,558 INFO L225 Difference]: With dead ends: 232 [2019-09-10 03:54:21,558 INFO L226 Difference]: Without dead ends: 225 [2019-09-10 03:54:21,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-10 03:54:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-09-10 03:54:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-10 03:54:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 325 transitions. [2019-09-10 03:54:21,571 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 325 transitions. Word has length 39 [2019-09-10 03:54:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:21,571 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 325 transitions. [2019-09-10 03:54:21,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 325 transitions. [2019-09-10 03:54:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 03:54:21,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:21,573 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 03:54:21,573 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:21,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:21,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1394570489, now seen corresponding path program 1 times [2019-09-10 03:54:21,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:21,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:21,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:21,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:21,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:54:21,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:21,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:21,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:21,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:21,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:21,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:21,625 INFO L87 Difference]: Start difference. First operand 225 states and 325 transitions. Second operand 4 states. [2019-09-10 03:54:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:21,678 INFO L93 Difference]: Finished difference Result 244 states and 348 transitions. [2019-09-10 03:54:21,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:21,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-10 03:54:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:21,685 INFO L225 Difference]: With dead ends: 244 [2019-09-10 03:54:21,686 INFO L226 Difference]: Without dead ends: 244 [2019-09-10 03:54:21,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-09-10 03:54:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-09-10 03:54:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-09-10 03:54:21,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 344 transitions. [2019-09-10 03:54:21,703 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 344 transitions. Word has length 41 [2019-09-10 03:54:21,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:21,704 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 344 transitions. [2019-09-10 03:54:21,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:21,704 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 344 transitions. [2019-09-10 03:54:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 03:54:21,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:21,706 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 03:54:21,707 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:21,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:21,707 INFO L82 PathProgramCache]: Analyzing trace with hash 498130826, now seen corresponding path program 1 times [2019-09-10 03:54:21,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:21,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:21,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:21,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:21,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:54:21,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:21,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:21,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:21,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:21,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:21,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:21,780 INFO L87 Difference]: Start difference. First operand 241 states and 344 transitions. Second operand 4 states. [2019-09-10 03:54:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:21,831 INFO L93 Difference]: Finished difference Result 250 states and 356 transitions. [2019-09-10 03:54:21,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:21,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-10 03:54:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:21,834 INFO L225 Difference]: With dead ends: 250 [2019-09-10 03:54:21,834 INFO L226 Difference]: Without dead ends: 250 [2019-09-10 03:54:21,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:21,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-10 03:54:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-09-10 03:54:21,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-10 03:54:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 352 transitions. [2019-09-10 03:54:21,852 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 352 transitions. Word has length 41 [2019-09-10 03:54:21,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:21,854 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 352 transitions. [2019-09-10 03:54:21,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 352 transitions. [2019-09-10 03:54:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 03:54:21,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:21,857 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-10 03:54:21,857 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:21,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:21,858 INFO L82 PathProgramCache]: Analyzing trace with hash 201547255, now seen corresponding path program 1 times [2019-09-10 03:54:21,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:21,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:21,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:21,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:21,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 03:54:21,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:21,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:21,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:21,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:21,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:21,957 INFO L87 Difference]: Start difference. First operand 248 states and 352 transitions. Second operand 5 states. [2019-09-10 03:54:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:21,985 INFO L93 Difference]: Finished difference Result 254 states and 358 transitions. [2019-09-10 03:54:21,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:21,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 03:54:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:21,992 INFO L225 Difference]: With dead ends: 254 [2019-09-10 03:54:21,992 INFO L226 Difference]: Without dead ends: 250 [2019-09-10 03:54:21,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-10 03:54:22,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-09-10 03:54:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-10 03:54:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 351 transitions. [2019-09-10 03:54:22,008 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 351 transitions. Word has length 59 [2019-09-10 03:54:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:22,009 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 351 transitions. [2019-09-10 03:54:22,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 351 transitions. [2019-09-10 03:54:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 03:54:22,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:22,011 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-10 03:54:22,011 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:22,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1479878478, now seen corresponding path program 1 times [2019-09-10 03:54:22,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:22,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:22,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 03:54:22,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:22,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:22,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:22,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:22,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:22,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:22,115 INFO L87 Difference]: Start difference. First operand 248 states and 351 transitions. Second operand 4 states. [2019-09-10 03:54:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:22,178 INFO L93 Difference]: Finished difference Result 269 states and 375 transitions. [2019-09-10 03:54:22,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:22,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-10 03:54:22,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:22,181 INFO L225 Difference]: With dead ends: 269 [2019-09-10 03:54:22,181 INFO L226 Difference]: Without dead ends: 269 [2019-09-10 03:54:22,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-10 03:54:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-09-10 03:54:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-10 03:54:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 372 transitions. [2019-09-10 03:54:22,200 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 372 transitions. Word has length 62 [2019-09-10 03:54:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:22,202 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 372 transitions. [2019-09-10 03:54:22,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 372 transitions. [2019-09-10 03:54:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 03:54:22,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:22,206 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-10 03:54:22,207 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:22,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:22,215 INFO L82 PathProgramCache]: Analyzing trace with hash 726395952, now seen corresponding path program 1 times [2019-09-10 03:54:22,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:22,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 03:54:22,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:22,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:22,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:22,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:22,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:22,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:22,281 INFO L87 Difference]: Start difference. First operand 266 states and 372 transitions. Second operand 4 states. [2019-09-10 03:54:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:22,331 INFO L93 Difference]: Finished difference Result 260 states and 358 transitions. [2019-09-10 03:54:22,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:22,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-10 03:54:22,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:22,334 INFO L225 Difference]: With dead ends: 260 [2019-09-10 03:54:22,335 INFO L226 Difference]: Without dead ends: 260 [2019-09-10 03:54:22,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:22,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-10 03:54:22,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-09-10 03:54:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-10 03:54:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 358 transitions. [2019-09-10 03:54:22,355 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 358 transitions. Word has length 63 [2019-09-10 03:54:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:22,356 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 358 transitions. [2019-09-10 03:54:22,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 358 transitions. [2019-09-10 03:54:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 03:54:22,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:22,357 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2019-09-10 03:54:22,358 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:22,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:22,358 INFO L82 PathProgramCache]: Analyzing trace with hash -841683441, now seen corresponding path program 1 times [2019-09-10 03:54:22,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 03:54:22,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:22,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:22,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:22,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:22,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:22,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:22,444 INFO L87 Difference]: Start difference. First operand 260 states and 358 transitions. Second operand 5 states. [2019-09-10 03:54:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:22,469 INFO L93 Difference]: Finished difference Result 266 states and 363 transitions. [2019-09-10 03:54:22,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:22,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 03:54:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:22,472 INFO L225 Difference]: With dead ends: 266 [2019-09-10 03:54:22,473 INFO L226 Difference]: Without dead ends: 262 [2019-09-10 03:54:22,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-10 03:54:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-09-10 03:54:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-10 03:54:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 357 transitions. [2019-09-10 03:54:22,484 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 357 transitions. Word has length 82 [2019-09-10 03:54:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:22,486 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 357 transitions. [2019-09-10 03:54:22,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 357 transitions. [2019-09-10 03:54:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 03:54:22,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:22,491 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 03:54:22,492 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:22,492 INFO L82 PathProgramCache]: Analyzing trace with hash 635600950, now seen corresponding path program 1 times [2019-09-10 03:54:22,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:22,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:22,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-10 03:54:22,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:22,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:22,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:22,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:22,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:22,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:22,591 INFO L87 Difference]: Start difference. First operand 260 states and 357 transitions. Second operand 4 states. [2019-09-10 03:54:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:22,654 INFO L93 Difference]: Finished difference Result 258 states and 353 transitions. [2019-09-10 03:54:22,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:22,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-10 03:54:22,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:22,657 INFO L225 Difference]: With dead ends: 258 [2019-09-10 03:54:22,657 INFO L226 Difference]: Without dead ends: 258 [2019-09-10 03:54:22,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-10 03:54:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-09-10 03:54:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-10 03:54:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 353 transitions. [2019-09-10 03:54:22,667 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 353 transitions. Word has length 85 [2019-09-10 03:54:22,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:22,668 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 353 transitions. [2019-09-10 03:54:22,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 353 transitions. [2019-09-10 03:54:22,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 03:54:22,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:22,672 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:54:22,672 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:22,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:22,673 INFO L82 PathProgramCache]: Analyzing trace with hash -21283191, now seen corresponding path program 1 times [2019-09-10 03:54:22,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:22,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:22,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-10 03:54:22,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:54:22,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:54:22,737 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 03:54:22,739 INFO L207 CegarAbsIntRunner]: [38], [40], [44], [46], [50], [52], [56], [58], [62], [63], [80], [83], [86], [92], [95], [98], [104], [107], [110], [119], [129], [136], [138], [141], [143], [147], [149], [152], [154], [158], [160], [163], [165], [169], [171], [182], [184], [188], [189], [190], [192], [201], [377], [382], [387], [392], [434], [435], [436], [439], [441], [492], [532], [533], [534], [535], [536], [537], [538], [539], [546], [547], [548], [549], [550], [551], [554], [555], [556], [598], [602], [603], [604], [610] [2019-09-10 03:54:22,784 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:54:22,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:54:22,931 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:54:23,154 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:54:23,157 INFO L272 AbstractInterpreter]: Visited 56 different actions 205 times. Merged at 16 different actions 45 times. Never widened. Performed 959 root evaluator evaluations with a maximum evaluation depth of 5. Performed 959 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 1 different actions. Largest state had 89 variables. [2019-09-10 03:54:23,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:23,161 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:54:23,317 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 93.62% of their original sizes. [2019-09-10 03:54:23,317 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:54:24,065 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 03:54:24,065 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:54:24,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:54:24,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [4] total 37 [2019-09-10 03:54:24,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:24,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 03:54:24,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 03:54:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:54:24,068 INFO L87 Difference]: Start difference. First operand 258 states and 353 transitions. Second operand 35 states. [2019-09-10 03:54:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:35,159 INFO L93 Difference]: Finished difference Result 374 states and 492 transitions. [2019-09-10 03:54:35,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 03:54:35,160 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-09-10 03:54:35,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:35,167 INFO L225 Difference]: With dead ends: 374 [2019-09-10 03:54:35,168 INFO L226 Difference]: Without dead ends: 374 [2019-09-10 03:54:35,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=540, Invalid=5312, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 03:54:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-09-10 03:54:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 306. [2019-09-10 03:54:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-10 03:54:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 403 transitions. [2019-09-10 03:54:35,201 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 403 transitions. Word has length 100 [2019-09-10 03:54:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:35,202 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 403 transitions. [2019-09-10 03:54:35,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 03:54:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 403 transitions. [2019-09-10 03:54:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 03:54:35,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:35,207 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 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] [2019-09-10 03:54:35,207 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:35,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:35,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1994128386, now seen corresponding path program 1 times [2019-09-10 03:54:35,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:35,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:35,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:35,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:35,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-09-10 03:54:35,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:35,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:35,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:35,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:35,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:35,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:35,313 INFO L87 Difference]: Start difference. First operand 306 states and 403 transitions. Second operand 5 states. [2019-09-10 03:54:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:35,330 INFO L93 Difference]: Finished difference Result 310 states and 406 transitions. [2019-09-10 03:54:35,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:35,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 03:54:35,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:35,333 INFO L225 Difference]: With dead ends: 310 [2019-09-10 03:54:35,333 INFO L226 Difference]: Without dead ends: 306 [2019-09-10 03:54:35,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-10 03:54:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2019-09-10 03:54:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-10 03:54:35,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 398 transitions. [2019-09-10 03:54:35,343 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 398 transitions. Word has length 144 [2019-09-10 03:54:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:35,343 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 398 transitions. [2019-09-10 03:54:35,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 398 transitions. [2019-09-10 03:54:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 03:54:35,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:35,346 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2019-09-10 03:54:35,346 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:35,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:35,346 INFO L82 PathProgramCache]: Analyzing trace with hash -115467579, now seen corresponding path program 1 times [2019-09-10 03:54:35,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:35,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:35,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:35,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:35,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-09-10 03:54:35,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:54:35,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:54:35,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-09-10 03:54:35,421 INFO L207 CegarAbsIntRunner]: [38], [40], [44], [46], [50], [52], [56], [58], [62], [63], [64], [67], [70], [79], [80], [83], [86], [92], [95], [98], [104], [107], [110], [119], [129], [136], [138], [141], [143], [147], [149], [152], [154], [158], [160], [163], [165], [169], [171], [174], [176], [180], [182], [184], [188], [189], [190], [192], [201], [377], [382], [387], [392], [434], [435], [436], [439], [441], [492], [532], [533], [534], [535], [536], [537], [538], [539], [546], [547], [548], [549], [550], [551], [552], [553], [554], [555], [556], [598], [602], [603], [604], [610] [2019-09-10 03:54:35,427 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:54:35,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:54:35,442 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:54:35,535 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:54:35,535 INFO L272 AbstractInterpreter]: Visited 77 different actions 269 times. Merged at 21 different actions 64 times. Never widened. Performed 1295 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1295 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 1 different actions. Largest state had 89 variables. [2019-09-10 03:54:35,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:35,536 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:54:35,691 INFO L227 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 90.83% of their original sizes. [2019-09-10 03:54:35,692 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:54:37,005 INFO L420 sIntCurrentIteration]: We unified 152 AI predicates to 152 [2019-09-10 03:54:37,006 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:54:37,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:54:37,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [5] total 60 [2019-09-10 03:54:37,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:37,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 03:54:37,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 03:54:37,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2893, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 03:54:37,010 INFO L87 Difference]: Start difference. First operand 306 states and 398 transitions. Second operand 57 states. [2019-09-10 03:55:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:00,090 INFO L93 Difference]: Finished difference Result 489 states and 657 transitions. [2019-09-10 03:55:00,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-10 03:55:00,090 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 153 [2019-09-10 03:55:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:00,094 INFO L225 Difference]: With dead ends: 489 [2019-09-10 03:55:00,094 INFO L226 Difference]: Without dead ends: 489 [2019-09-10 03:55:00,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2693 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=721, Invalid=8981, Unknown=0, NotChecked=0, Total=9702 [2019-09-10 03:55:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-10 03:55:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 460. [2019-09-10 03:55:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-10 03:55:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 615 transitions. [2019-09-10 03:55:00,118 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 615 transitions. Word has length 153 [2019-09-10 03:55:00,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:00,119 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 615 transitions. [2019-09-10 03:55:00,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 03:55:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 615 transitions. [2019-09-10 03:55:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 03:55:00,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:00,121 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 03:55:00,122 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:00,122 INFO L82 PathProgramCache]: Analyzing trace with hash 328061885, now seen corresponding path program 1 times [2019-09-10 03:55:00,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:00,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:00,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:00,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:00,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-10 03:55:00,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:00,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:00,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:00,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:00,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:00,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:00,203 INFO L87 Difference]: Start difference. First operand 460 states and 615 transitions. Second operand 4 states. [2019-09-10 03:55:00,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:00,231 INFO L93 Difference]: Finished difference Result 474 states and 627 transitions. [2019-09-10 03:55:00,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:55:00,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-10 03:55:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:00,235 INFO L225 Difference]: With dead ends: 474 [2019-09-10 03:55:00,235 INFO L226 Difference]: Without dead ends: 474 [2019-09-10 03:55:00,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-10 03:55:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 470. [2019-09-10 03:55:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:55:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 623 transitions. [2019-09-10 03:55:00,249 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 623 transitions. Word has length 173 [2019-09-10 03:55:00,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:00,250 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 623 transitions. [2019-09-10 03:55:00,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 623 transitions. [2019-09-10 03:55:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 03:55:00,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:00,253 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 03:55:00,253 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:00,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:00,253 INFO L82 PathProgramCache]: Analyzing trace with hash -596532013, now seen corresponding path program 1 times [2019-09-10 03:55:00,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:00,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:00,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:00,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:00,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-09-10 03:55:00,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:00,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:00,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:00,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:00,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:00,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:00,339 INFO L87 Difference]: Start difference. First operand 470 states and 623 transitions. Second operand 4 states. [2019-09-10 03:55:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:00,362 INFO L93 Difference]: Finished difference Result 468 states and 613 transitions. [2019-09-10 03:55:00,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:55:00,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-09-10 03:55:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:00,365 INFO L225 Difference]: With dead ends: 468 [2019-09-10 03:55:00,365 INFO L226 Difference]: Without dead ends: 468 [2019-09-10 03:55:00,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-09-10 03:55:00,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2019-09-10 03:55:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-09-10 03:55:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 613 transitions. [2019-09-10 03:55:00,378 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 613 transitions. Word has length 186 [2019-09-10 03:55:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:00,379 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 613 transitions. [2019-09-10 03:55:00,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 613 transitions. [2019-09-10 03:55:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 03:55:00,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:00,381 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 03:55:00,382 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:00,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:00,382 INFO L82 PathProgramCache]: Analyzing trace with hash 403733103, now seen corresponding path program 1 times [2019-09-10 03:55:00,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:00,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:00,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:00,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:00,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-10 03:55:00,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:00,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:00,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:00,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:00,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:00,518 INFO L87 Difference]: Start difference. First operand 468 states and 613 transitions. Second operand 4 states. [2019-09-10 03:55:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:00,539 INFO L93 Difference]: Finished difference Result 372 states and 470 transitions. [2019-09-10 03:55:00,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:55:00,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-09-10 03:55:00,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:00,545 INFO L225 Difference]: With dead ends: 372 [2019-09-10 03:55:00,546 INFO L226 Difference]: Without dead ends: 372 [2019-09-10 03:55:00,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:00,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-10 03:55:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 367. [2019-09-10 03:55:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-10 03:55:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 462 transitions. [2019-09-10 03:55:00,560 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 462 transitions. Word has length 200 [2019-09-10 03:55:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:00,561 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 462 transitions. [2019-09-10 03:55:00,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 462 transitions. [2019-09-10 03:55:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 03:55:00,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:00,566 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 03:55:00,567 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:00,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1539691930, now seen corresponding path program 1 times [2019-09-10 03:55:00,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:00,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:00,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:00,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:00,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-10 03:55:00,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:00,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:00,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:00,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:00,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:00,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:00,709 INFO L87 Difference]: Start difference. First operand 367 states and 462 transitions. Second operand 4 states. [2019-09-10 03:55:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:01,072 INFO L93 Difference]: Finished difference Result 682 states and 889 transitions. [2019-09-10 03:55:01,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:55:01,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-09-10 03:55:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:01,077 INFO L225 Difference]: With dead ends: 682 [2019-09-10 03:55:01,077 INFO L226 Difference]: Without dead ends: 682 [2019-09-10 03:55:01,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-10 03:55:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 480. [2019-09-10 03:55:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-09-10 03:55:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 630 transitions. [2019-09-10 03:55:01,098 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 630 transitions. Word has length 200 [2019-09-10 03:55:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:01,099 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 630 transitions. [2019-09-10 03:55:01,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 630 transitions. [2019-09-10 03:55:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:55:01,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:01,103 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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] [2019-09-10 03:55:01,104 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:01,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:01,104 INFO L82 PathProgramCache]: Analyzing trace with hash -819200953, now seen corresponding path program 1 times [2019-09-10 03:55:01,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:01,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:01,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:01,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:01,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-10 03:55:01,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:01,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:01,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:01,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:01,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:01,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:01,255 INFO L87 Difference]: Start difference. First operand 480 states and 630 transitions. Second operand 4 states. [2019-09-10 03:55:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:01,479 INFO L93 Difference]: Finished difference Result 817 states and 1096 transitions. [2019-09-10 03:55:01,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:55:01,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-09-10 03:55:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:01,485 INFO L225 Difference]: With dead ends: 817 [2019-09-10 03:55:01,486 INFO L226 Difference]: Without dead ends: 817 [2019-09-10 03:55:01,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-09-10 03:55:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 802. [2019-09-10 03:55:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-09-10 03:55:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1077 transitions. [2019-09-10 03:55:01,527 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1077 transitions. Word has length 237 [2019-09-10 03:55:01,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:01,527 INFO L475 AbstractCegarLoop]: Abstraction has 802 states and 1077 transitions. [2019-09-10 03:55:01,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1077 transitions. [2019-09-10 03:55:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 03:55:01,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:01,533 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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] [2019-09-10 03:55:01,534 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:01,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:01,534 INFO L82 PathProgramCache]: Analyzing trace with hash -465664165, now seen corresponding path program 1 times [2019-09-10 03:55:01,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:01,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:01,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:01,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:01,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-10 03:55:01,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:01,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:01,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:01,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:01,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:01,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:01,684 INFO L87 Difference]: Start difference. First operand 802 states and 1077 transitions. Second operand 4 states. [2019-09-10 03:55:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:01,880 INFO L93 Difference]: Finished difference Result 1470 states and 2006 transitions. [2019-09-10 03:55:01,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:55:01,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-10 03:55:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:01,889 INFO L225 Difference]: With dead ends: 1470 [2019-09-10 03:55:01,889 INFO L226 Difference]: Without dead ends: 1470 [2019-09-10 03:55:01,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:01,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-09-10 03:55:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1108. [2019-09-10 03:55:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2019-09-10 03:55:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1503 transitions. [2019-09-10 03:55:01,941 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1503 transitions. Word has length 238 [2019-09-10 03:55:01,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:01,942 INFO L475 AbstractCegarLoop]: Abstraction has 1108 states and 1503 transitions. [2019-09-10 03:55:01,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1503 transitions. [2019-09-10 03:55:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 03:55:01,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:01,947 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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] [2019-09-10 03:55:01,947 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:01,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1558432926, now seen corresponding path program 1 times [2019-09-10 03:55:01,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:01,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:01,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:01,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:01,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-10 03:55:02,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:02,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:02,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:02,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:02,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:02,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:02,084 INFO L87 Difference]: Start difference. First operand 1108 states and 1503 transitions. Second operand 4 states. [2019-09-10 03:55:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:02,292 INFO L93 Difference]: Finished difference Result 2109 states and 2897 transitions. [2019-09-10 03:55:02,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:55:02,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-09-10 03:55:02,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:02,305 INFO L225 Difference]: With dead ends: 2109 [2019-09-10 03:55:02,305 INFO L226 Difference]: Without dead ends: 2109 [2019-09-10 03:55:02,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:02,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2019-09-10 03:55:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1397. [2019-09-10 03:55:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1397 states. [2019-09-10 03:55:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1907 transitions. [2019-09-10 03:55:02,368 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1907 transitions. Word has length 239 [2019-09-10 03:55:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:02,370 INFO L475 AbstractCegarLoop]: Abstraction has 1397 states and 1907 transitions. [2019-09-10 03:55:02,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1907 transitions. [2019-09-10 03:55:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 03:55:02,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:02,376 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 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] [2019-09-10 03:55:02,376 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:02,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:02,377 INFO L82 PathProgramCache]: Analyzing trace with hash 492551072, now seen corresponding path program 1 times [2019-09-10 03:55:02,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:02,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:02,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:02,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:02,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-09-10 03:55:02,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:55:02,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:55:02,509 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 240 with the following transitions: [2019-09-10 03:55:02,511 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [37], [38], [40], [44], [46], [50], [52], [56], [58], [62], [63], [64], [67], [70], [79], [80], [83], [86], [92], [95], [98], [104], [107], [110], [119], [120], [123], [128], [129], [136], [138], [141], [143], [147], [149], [152], [154], [158], [160], [163], [165], [169], [171], [174], [176], [180], [184], [188], [189], [190], [192], [201], [206], [208], [216], [221], [226], [231], [233], [235], [307], [310], [343], [346], [373], [375], [376], [377], [380], [382], [385], [387], [390], [395], [396], [400], [405], [407], [433], [434], [435], [436], [439], [441], [450], [453], [456], [491], [492], [496], [501], [503], [529], [530], [531], [532], [533], [534], [535], [536], [537], [538], [539], [546], [547], [548], [549], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [568], [569], [580], [581], [590], [591], [600], [601], [602], [603], [604], [608], [609], [610], [611] [2019-09-10 03:55:02,525 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:55:02,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:55:02,539 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:55:02,665 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:55:02,665 INFO L272 AbstractInterpreter]: Visited 124 different actions 344 times. Merged at 21 different actions 72 times. Never widened. Performed 1712 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1712 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 4 fixpoints after 2 different actions. Largest state had 90 variables. [2019-09-10 03:55:02,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:02,666 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:55:02,929 INFO L227 lantSequenceWeakener]: Weakened 209 states. On average, predicates are now at 84.36% of their original sizes. [2019-09-10 03:55:02,929 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:55:06,308 INFO L420 sIntCurrentIteration]: We unified 238 AI predicates to 238 [2019-09-10 03:55:06,308 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:55:06,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:55:06,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [77] imperfect sequences [7] total 82 [2019-09-10 03:55:06,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:06,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 03:55:06,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 03:55:06,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=5451, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 03:55:06,311 INFO L87 Difference]: Start difference. First operand 1397 states and 1907 transitions. Second operand 77 states. [2019-09-10 03:55:18,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-10 03:55:18,777 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: There is no value of variable ~nomsg~0. at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.lambda$0(SingletonVariableExpressionEvaluator.java:83) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunctionPerType(TypeUtils.java:114) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunction(TypeUtils.java:103) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:89) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:90) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalEvaluator.evaluate(NonrelationalEvaluator.java:81) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:297) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:156) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:696) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-10 03:55:18,784 INFO L168 Benchmark]: Toolchain (without parser) took 60196.70 ms. Allocated memory was 141.0 MB in the beginning and 721.9 MB in the end (delta: 580.9 MB). Free memory was 87.6 MB in the beginning and 131.4 MB in the end (delta: -43.9 MB). Peak memory consumption was 537.0 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:18,785 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:55:18,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.63 ms. Allocated memory was 141.0 MB in the beginning and 201.9 MB in the end (delta: 60.8 MB). Free memory was 87.4 MB in the beginning and 174.2 MB in the end (delta: -86.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:18,788 INFO L168 Benchmark]: Boogie Preprocessor took 62.10 ms. Allocated memory is still 201.9 MB. Free memory was 174.2 MB in the beginning and 171.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:18,789 INFO L168 Benchmark]: RCFGBuilder took 866.59 ms. Allocated memory is still 201.9 MB. Free memory was 170.8 MB in the beginning and 117.6 MB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:18,790 INFO L168 Benchmark]: TraceAbstraction took 58688.54 ms. Allocated memory was 201.9 MB in the beginning and 721.9 MB in the end (delta: 520.1 MB). Free memory was 117.0 MB in the beginning and 131.4 MB in the end (delta: -14.5 MB). Peak memory consumption was 505.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:18,794 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 574.63 ms. Allocated memory was 141.0 MB in the beginning and 201.9 MB in the end (delta: 60.8 MB). Free memory was 87.4 MB in the beginning and 174.2 MB in the end (delta: -86.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.10 ms. Allocated memory is still 201.9 MB. Free memory was 174.2 MB in the beginning and 171.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 866.59 ms. Allocated memory is still 201.9 MB. Free memory was 170.8 MB in the beginning and 117.6 MB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 58688.54 ms. Allocated memory was 201.9 MB in the beginning and 721.9 MB in the end (delta: 520.1 MB). Free memory was 117.0 MB in the beginning and 131.4 MB in the end (delta: -14.5 MB). Peak memory consumption was 505.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: There is no value of variable ~nomsg~0. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: There is no value of variable ~nomsg~0.: de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...