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.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:54:25,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:54:25,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:54:25,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:54:25,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:54:25,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:54:25,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:54:25,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:54:25,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:54:25,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:54:25,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:54:25,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:54:25,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:54:25,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:54:25,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:54:25,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:54:25,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:54:25,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:54:25,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:54:25,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:54:25,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:54:25,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:54:25,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:54:25,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:54:25,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:54:25,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:54:25,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:54:25,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:54:25,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:54:25,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:54:25,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:54:25,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:54:25,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:54:25,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:54:25,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:54:25,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:54:25,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:54:25,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:54:25,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:54:25,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:54:25,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:54:25,645 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:25,660 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:54:25,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:54:25,661 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:54:25,661 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:54:25,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:54:25,662 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:54:25,662 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:54:25,662 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:54:25,662 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:54:25,663 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:54:25,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:54:25,664 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:54:25,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:54:25,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:54:25,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:54:25,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:54:25,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:54:25,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:54:25,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:54:25,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:54:25,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:54:25,666 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:54:25,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:54:25,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:54:25,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:54:25,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:54:25,667 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:54:25,667 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:54:25,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:54:25,668 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:54:25,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:54:25,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:54:25,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:54:25,729 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:54:25,729 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:54:25,730 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c [2019-09-10 03:54:25,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb1981af/2e7517bb4f5f4b47bb3c4aba6253794f/FLAG5b152bc77 [2019-09-10 03:54:26,385 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:54:26,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c [2019-09-10 03:54:26,403 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb1981af/2e7517bb4f5f4b47bb3c4aba6253794f/FLAG5b152bc77 [2019-09-10 03:54:26,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb1981af/2e7517bb4f5f4b47bb3c4aba6253794f [2019-09-10 03:54:26,691 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:54:26,692 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:54:26,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:54:26,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:54:26,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:54:26,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:54:26" (1/1) ... [2019-09-10 03:54:26,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1677a6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:26, skipping insertion in model container [2019-09-10 03:54:26,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:54:26" (1/1) ... [2019-09-10 03:54:26,710 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:54:26,769 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:54:27,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:54:27,141 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:54:27,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:54:27,237 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:54:27,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:27 WrapperNode [2019-09-10 03:54:27,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:54:27,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:54:27,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:54:27,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:54:27,258 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:27" (1/1) ... [2019-09-10 03:54:27,260 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:27" (1/1) ... [2019-09-10 03:54:27,278 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:27" (1/1) ... [2019-09-10 03:54:27,278 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:27" (1/1) ... [2019-09-10 03:54:27,312 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:27" (1/1) ... [2019-09-10 03:54:27,329 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:27" (1/1) ... [2019-09-10 03:54:27,333 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:27" (1/1) ... [2019-09-10 03:54:27,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:54:27,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:54:27,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:54:27,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:54:27,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:27" (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:27,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:54:27,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:54:27,412 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-09-10 03:54:27,412 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-09-10 03:54:27,413 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-09-10 03:54:27,413 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-09-10 03:54:27,413 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-09-10 03:54:27,413 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 03:54:27,413 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 03:54:27,413 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-09-10 03:54:27,414 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-09-10 03:54:27,414 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-09-10 03:54:27,414 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-09-10 03:54:27,415 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:54:27,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 03:54:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:54:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 03:54:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 03:54:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 03:54:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 03:54:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 03:54:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 03:54:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-09-10 03:54:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-09-10 03:54:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-09-10 03:54:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-09-10 03:54:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-09-10 03:54:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 03:54:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 03:54:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-09-10 03:54:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-09-10 03:54:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-09-10 03:54:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-09-10 03:54:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:54:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:54:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:54:28,237 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:54:28,238 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-10 03:54:28,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:54:28 BoogieIcfgContainer [2019-09-10 03:54:28,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:54:28,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:54:28,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:54:28,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:54:28,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:54:26" (1/3) ... [2019-09-10 03:54:28,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f7d714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:54:28, skipping insertion in model container [2019-09-10 03:54:28,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:27" (2/3) ... [2019-09-10 03:54:28,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f7d714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:54:28, skipping insertion in model container [2019-09-10 03:54:28,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:54:28" (3/3) ... [2019-09-10 03:54:28,247 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c [2019-09-10 03:54:28,257 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:54:28,265 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:54:28,281 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:54:28,308 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:54:28,308 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:54:28,308 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:54:28,308 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:54:28,309 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:54:28,309 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:54:28,309 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:54:28,309 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:54:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states. [2019-09-10 03:54:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 03:54:28,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:28,342 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:28,345 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:28,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:28,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1122227580, now seen corresponding path program 1 times [2019-09-10 03:54:28,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:28,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:28,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:28,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:28,661 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:28,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:28,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:28,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:28,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:28,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:28,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:28,690 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 4 states. [2019-09-10 03:54:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:28,903 INFO L93 Difference]: Finished difference Result 219 states and 328 transitions. [2019-09-10 03:54:28,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:28,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-10 03:54:28,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:28,938 INFO L225 Difference]: With dead ends: 219 [2019-09-10 03:54:28,938 INFO L226 Difference]: Without dead ends: 214 [2019-09-10 03:54:28,944 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:28,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-10 03:54:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-09-10 03:54:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-10 03:54:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 316 transitions. [2019-09-10 03:54:29,086 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 316 transitions. Word has length 21 [2019-09-10 03:54:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:29,089 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 316 transitions. [2019-09-10 03:54:29,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 316 transitions. [2019-09-10 03:54:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 03:54:29,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:29,096 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:29,096 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:29,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:29,097 INFO L82 PathProgramCache]: Analyzing trace with hash 404804225, now seen corresponding path program 1 times [2019-09-10 03:54:29,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:29,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:29,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:29,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:29,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:29,202 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:29,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:29,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:29,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:29,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:29,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:29,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:29,208 INFO L87 Difference]: Start difference. First operand 212 states and 316 transitions. Second operand 4 states. [2019-09-10 03:54:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:29,281 INFO L93 Difference]: Finished difference Result 228 states and 337 transitions. [2019-09-10 03:54:29,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:29,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-10 03:54:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:29,285 INFO L225 Difference]: With dead ends: 228 [2019-09-10 03:54:29,285 INFO L226 Difference]: Without dead ends: 228 [2019-09-10 03:54:29,286 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:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-10 03:54:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2019-09-10 03:54:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-10 03:54:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 332 transitions. [2019-09-10 03:54:29,306 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 332 transitions. Word has length 22 [2019-09-10 03:54:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:29,306 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 332 transitions. [2019-09-10 03:54:29,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 332 transitions. [2019-09-10 03:54:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 03:54:29,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:29,309 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:29,309 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:29,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:29,310 INFO L82 PathProgramCache]: Analyzing trace with hash 429926204, now seen corresponding path program 1 times [2019-09-10 03:54:29,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:29,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:29,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:29,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:29,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:29,423 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:29,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:29,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:54:29,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:29,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:54:29,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:54:29,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:54:29,426 INFO L87 Difference]: Start difference. First operand 225 states and 332 transitions. Second operand 3 states. [2019-09-10 03:54:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:29,448 INFO L93 Difference]: Finished difference Result 254 states and 377 transitions. [2019-09-10 03:54:29,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:54:29,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-10 03:54:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:29,452 INFO L225 Difference]: With dead ends: 254 [2019-09-10 03:54:29,452 INFO L226 Difference]: Without dead ends: 254 [2019-09-10 03:54:29,453 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:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-10 03:54:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 227. [2019-09-10 03:54:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-10 03:54:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 334 transitions. [2019-09-10 03:54:29,471 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 334 transitions. Word has length 30 [2019-09-10 03:54:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:29,471 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 334 transitions. [2019-09-10 03:54:29,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:54:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 334 transitions. [2019-09-10 03:54:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 03:54:29,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:29,474 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:29,474 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:29,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:29,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1261548885, now seen corresponding path program 1 times [2019-09-10 03:54:29,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:29,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:29,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:29,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:29,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:29,551 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:29,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:29,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:29,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:29,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:29,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:29,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:29,553 INFO L87 Difference]: Start difference. First operand 227 states and 334 transitions. Second operand 5 states. [2019-09-10 03:54:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:29,588 INFO L93 Difference]: Finished difference Result 235 states and 344 transitions. [2019-09-10 03:54:29,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:29,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-09-10 03:54:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:29,591 INFO L225 Difference]: With dead ends: 235 [2019-09-10 03:54:29,592 INFO L226 Difference]: Without dead ends: 235 [2019-09-10 03:54:29,592 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:29,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-10 03:54:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 231. [2019-09-10 03:54:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-10 03:54:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 338 transitions. [2019-09-10 03:54:29,608 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 338 transitions. Word has length 38 [2019-09-10 03:54:29,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:29,609 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 338 transitions. [2019-09-10 03:54:29,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 338 transitions. [2019-09-10 03:54:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 03:54:29,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:29,611 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:29,612 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:29,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:29,612 INFO L82 PathProgramCache]: Analyzing trace with hash -191486888, now seen corresponding path program 1 times [2019-09-10 03:54:29,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:29,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:29,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:29,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:29,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:29,698 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:29,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:29,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:29,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:29,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:29,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:29,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:29,700 INFO L87 Difference]: Start difference. First operand 231 states and 338 transitions. Second operand 4 states. [2019-09-10 03:54:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:29,728 INFO L93 Difference]: Finished difference Result 234 states and 340 transitions. [2019-09-10 03:54:29,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:29,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-09-10 03:54:29,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:29,732 INFO L225 Difference]: With dead ends: 234 [2019-09-10 03:54:29,733 INFO L226 Difference]: Without dead ends: 227 [2019-09-10 03:54:29,733 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:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-10 03:54:29,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-09-10 03:54:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-10 03:54:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 329 transitions. [2019-09-10 03:54:29,754 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 329 transitions. Word has length 39 [2019-09-10 03:54:29,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:29,755 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 329 transitions. [2019-09-10 03:54:29,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 329 transitions. [2019-09-10 03:54:29,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 03:54:29,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:29,762 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:29,762 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:29,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1150756250, now seen corresponding path program 1 times [2019-09-10 03:54:29,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:29,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:29,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:29,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:29,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:29,850 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:29,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:29,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:29,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:29,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:29,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:29,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:29,853 INFO L87 Difference]: Start difference. First operand 227 states and 329 transitions. Second operand 4 states. [2019-09-10 03:54:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:29,913 INFO L93 Difference]: Finished difference Result 246 states and 352 transitions. [2019-09-10 03:54:29,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:29,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-10 03:54:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:29,920 INFO L225 Difference]: With dead ends: 246 [2019-09-10 03:54:29,921 INFO L226 Difference]: Without dead ends: 246 [2019-09-10 03:54:29,922 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:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-10 03:54:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2019-09-10 03:54:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-10 03:54:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 348 transitions. [2019-09-10 03:54:29,941 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 348 transitions. Word has length 41 [2019-09-10 03:54:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:29,941 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 348 transitions. [2019-09-10 03:54:29,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 348 transitions. [2019-09-10 03:54:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 03:54:29,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:29,943 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:29,943 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:29,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:29,944 INFO L82 PathProgramCache]: Analyzing trace with hash 674548075, now seen corresponding path program 1 times [2019-09-10 03:54:29,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:29,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:29,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:29,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:29,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:30,018 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:30,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:30,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:30,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:30,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:30,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:30,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:30,021 INFO L87 Difference]: Start difference. First operand 243 states and 348 transitions. Second operand 4 states. [2019-09-10 03:54:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:30,079 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2019-09-10 03:54:30,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:30,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-10 03:54:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:30,082 INFO L225 Difference]: With dead ends: 252 [2019-09-10 03:54:30,083 INFO L226 Difference]: Without dead ends: 252 [2019-09-10 03:54:30,084 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:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-10 03:54:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2019-09-10 03:54:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-10 03:54:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 356 transitions. [2019-09-10 03:54:30,103 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 356 transitions. Word has length 41 [2019-09-10 03:54:30,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:30,104 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 356 transitions. [2019-09-10 03:54:30,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 356 transitions. [2019-09-10 03:54:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 03:54:30,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:30,107 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:30,107 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:30,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:30,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1508886258, now seen corresponding path program 1 times [2019-09-10 03:54:30,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:30,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:30,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:30,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:30,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:30,195 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:30,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:30,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:30,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:30,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:30,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:30,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:30,199 INFO L87 Difference]: Start difference. First operand 250 states and 356 transitions. Second operand 5 states. [2019-09-10 03:54:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:30,222 INFO L93 Difference]: Finished difference Result 256 states and 362 transitions. [2019-09-10 03:54:30,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:30,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 03:54:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:30,225 INFO L225 Difference]: With dead ends: 256 [2019-09-10 03:54:30,225 INFO L226 Difference]: Without dead ends: 252 [2019-09-10 03:54:30,226 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:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-09-10 03:54:30,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2019-09-10 03:54:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-10 03:54:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 355 transitions. [2019-09-10 03:54:30,237 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 355 transitions. Word has length 59 [2019-09-10 03:54:30,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:30,238 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 355 transitions. [2019-09-10 03:54:30,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 355 transitions. [2019-09-10 03:54:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 03:54:30,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:30,240 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:30,240 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:30,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:30,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1749977001, now seen corresponding path program 1 times [2019-09-10 03:54:30,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:30,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:30,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:30,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:30,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:30,300 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:30,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:30,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:30,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:30,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:30,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:30,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:30,302 INFO L87 Difference]: Start difference. First operand 250 states and 355 transitions. Second operand 4 states. [2019-09-10 03:54:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:30,348 INFO L93 Difference]: Finished difference Result 271 states and 379 transitions. [2019-09-10 03:54:30,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:30,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-10 03:54:30,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:30,351 INFO L225 Difference]: With dead ends: 271 [2019-09-10 03:54:30,351 INFO L226 Difference]: Without dead ends: 271 [2019-09-10 03:54:30,351 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:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-10 03:54:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2019-09-10 03:54:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-10 03:54:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 376 transitions. [2019-09-10 03:54:30,362 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 376 transitions. Word has length 62 [2019-09-10 03:54:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:30,362 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 376 transitions. [2019-09-10 03:54:30,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:30,363 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 376 transitions. [2019-09-10 03:54:30,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 03:54:30,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:30,364 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:30,364 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:30,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:30,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1022914233, now seen corresponding path program 1 times [2019-09-10 03:54:30,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:30,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:30,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:30,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:30,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:30,414 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:30,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:30,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:30,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:30,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:30,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:30,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:30,415 INFO L87 Difference]: Start difference. First operand 268 states and 376 transitions. Second operand 4 states. [2019-09-10 03:54:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:30,461 INFO L93 Difference]: Finished difference Result 262 states and 362 transitions. [2019-09-10 03:54:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:30,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-10 03:54:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:30,464 INFO L225 Difference]: With dead ends: 262 [2019-09-10 03:54:30,464 INFO L226 Difference]: Without dead ends: 262 [2019-09-10 03:54:30,464 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:30,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-10 03:54:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2019-09-10 03:54:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-10 03:54:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 362 transitions. [2019-09-10 03:54:30,474 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 362 transitions. Word has length 63 [2019-09-10 03:54:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:30,475 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 362 transitions. [2019-09-10 03:54:30,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 362 transitions. [2019-09-10 03:54:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 03:54:30,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:30,476 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:30,476 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:30,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:30,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1495147032, now seen corresponding path program 1 times [2019-09-10 03:54:30,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:30,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:30,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:30,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:30,539 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:30,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:30,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:30,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:30,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:30,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:30,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:30,541 INFO L87 Difference]: Start difference. First operand 262 states and 362 transitions. Second operand 5 states. [2019-09-10 03:54:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:30,565 INFO L93 Difference]: Finished difference Result 268 states and 367 transitions. [2019-09-10 03:54:30,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:30,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 03:54:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:30,569 INFO L225 Difference]: With dead ends: 268 [2019-09-10 03:54:30,569 INFO L226 Difference]: Without dead ends: 264 [2019-09-10 03:54:30,570 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:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-10 03:54:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-09-10 03:54:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-10 03:54:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 361 transitions. [2019-09-10 03:54:30,579 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 361 transitions. Word has length 82 [2019-09-10 03:54:30,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:30,580 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 361 transitions. [2019-09-10 03:54:30,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 361 transitions. [2019-09-10 03:54:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 03:54:30,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:30,581 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:30,581 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:30,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1125219085, now seen corresponding path program 1 times [2019-09-10 03:54:30,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:30,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:30,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:30,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:30,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:30,656 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:30,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:30,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:30,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:30,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:30,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:30,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:30,659 INFO L87 Difference]: Start difference. First operand 262 states and 361 transitions. Second operand 4 states. [2019-09-10 03:54:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:30,715 INFO L93 Difference]: Finished difference Result 260 states and 357 transitions. [2019-09-10 03:54:30,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:30,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-10 03:54:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:30,717 INFO L225 Difference]: With dead ends: 260 [2019-09-10 03:54:30,717 INFO L226 Difference]: Without dead ends: 260 [2019-09-10 03:54:30,718 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:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-10 03:54:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-09-10 03:54:30,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-10 03:54:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 357 transitions. [2019-09-10 03:54:30,727 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 357 transitions. Word has length 85 [2019-09-10 03:54:30,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:30,727 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 357 transitions. [2019-09-10 03:54:30,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 357 transitions. [2019-09-10 03:54:30,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 03:54:30,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:30,731 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:30,732 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:30,733 INFO L82 PathProgramCache]: Analyzing trace with hash -794373220, now seen corresponding path program 1 times [2019-09-10 03:54:30,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:30,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:30,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:30,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:30,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:30,802 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:30,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:54:30,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:54:30,803 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 03:54:30,806 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], [503], [543], [544], [545], [546], [547], [548], [549], [550], [557], [558], [559], [560], [561], [562], [565], [566], [567], [609], [613], [614], [615], [621] [2019-09-10 03:54:30,880 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:54:30,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:54:31,092 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:54:31,360 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:54:31,364 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:31,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:31,369 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:54:31,520 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 93.62% of their original sizes. [2019-09-10 03:54:31,520 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:54:32,272 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 03:54:32,272 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:54:32,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:54:32,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [4] total 37 [2019-09-10 03:54:32,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:32,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 03:54:32,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 03:54:32,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:54:32,275 INFO L87 Difference]: Start difference. First operand 260 states and 357 transitions. Second operand 35 states. [2019-09-10 03:54:45,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:45,941 INFO L93 Difference]: Finished difference Result 376 states and 496 transitions. [2019-09-10 03:54:45,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 03:54:45,942 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-09-10 03:54:45,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:45,945 INFO L225 Difference]: With dead ends: 376 [2019-09-10 03:54:45,945 INFO L226 Difference]: Without dead ends: 376 [2019-09-10 03:54:45,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=540, Invalid=5312, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 03:54:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-10 03:54:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 308. [2019-09-10 03:54:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-10 03:54:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 407 transitions. [2019-09-10 03:54:45,960 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 407 transitions. Word has length 100 [2019-09-10 03:54:45,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:45,961 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 407 transitions. [2019-09-10 03:54:45,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 03:54:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 407 transitions. [2019-09-10 03:54:45,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 03:54:45,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:45,963 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:45,963 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:45,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1263567093, now seen corresponding path program 1 times [2019-09-10 03:54:45,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:45,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:45,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:45,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:45,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:46,036 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:46,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:46,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:46,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:46,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:46,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:46,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:46,038 INFO L87 Difference]: Start difference. First operand 308 states and 407 transitions. Second operand 5 states. [2019-09-10 03:54:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:46,054 INFO L93 Difference]: Finished difference Result 312 states and 410 transitions. [2019-09-10 03:54:46,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:46,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 03:54:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:46,057 INFO L225 Difference]: With dead ends: 312 [2019-09-10 03:54:46,058 INFO L226 Difference]: Without dead ends: 308 [2019-09-10 03:54:46,058 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:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-10 03:54:46,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2019-09-10 03:54:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-10 03:54:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 402 transitions. [2019-09-10 03:54:46,067 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 402 transitions. Word has length 144 [2019-09-10 03:54:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:46,068 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 402 transitions. [2019-09-10 03:54:46,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 402 transitions. [2019-09-10 03:54:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 03:54:46,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:46,070 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:46,070 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:46,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash 202828912, now seen corresponding path program 1 times [2019-09-10 03:54:46,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:46,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:46,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:46,151 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:46,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:54:46,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:54:46,152 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-09-10 03:54:46,153 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], [503], [543], [544], [545], [546], [547], [548], [549], [550], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [609], [613], [614], [615], [621] [2019-09-10 03:54:46,160 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:54:46,160 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:54:46,180 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:54:46,325 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:54:46,326 INFO L272 AbstractInterpreter]: Visited 77 different actions 290 times. Merged at 24 different actions 74 times. Widened at 1 different actions 1 times. Performed 1391 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1391 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 5 fixpoints after 2 different actions. Largest state had 89 variables. [2019-09-10 03:54:46,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:46,327 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:54:46,567 INFO L227 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 90.82% of their original sizes. [2019-09-10 03:54:46,567 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:54:48,076 INFO L420 sIntCurrentIteration]: We unified 152 AI predicates to 152 [2019-09-10 03:54:48,076 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:54:48,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:54:48,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [5] total 61 [2019-09-10 03:54:48,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:48,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 03:54:48,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 03:54:48,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2988, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 03:54:48,082 INFO L87 Difference]: Start difference. First operand 308 states and 402 transitions. Second operand 58 states. [2019-09-10 03:55:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:08,150 INFO L93 Difference]: Finished difference Result 493 states and 665 transitions. [2019-09-10 03:55:08,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-10 03:55:08,151 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 153 [2019-09-10 03:55:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:08,155 INFO L225 Difference]: With dead ends: 493 [2019-09-10 03:55:08,155 INFO L226 Difference]: Without dead ends: 493 [2019-09-10 03:55:08,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2717 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=760, Invalid=9140, Unknown=0, NotChecked=0, Total=9900 [2019-09-10 03:55:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-10 03:55:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 464. [2019-09-10 03:55:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-09-10 03:55:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 623 transitions. [2019-09-10 03:55:08,173 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 623 transitions. Word has length 153 [2019-09-10 03:55:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:08,174 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 623 transitions. [2019-09-10 03:55:08,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 03:55:08,174 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 623 transitions. [2019-09-10 03:55:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 03:55:08,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:08,176 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:08,177 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:08,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:08,177 INFO L82 PathProgramCache]: Analyzing trace with hash -928930434, now seen corresponding path program 1 times [2019-09-10 03:55:08,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:08,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:08,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:08,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:08,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:08,261 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:08,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:08,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:08,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:08,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:08,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:08,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:08,265 INFO L87 Difference]: Start difference. First operand 464 states and 623 transitions. Second operand 4 states. [2019-09-10 03:55:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:08,292 INFO L93 Difference]: Finished difference Result 478 states and 635 transitions. [2019-09-10 03:55:08,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:55:08,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-10 03:55:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:08,296 INFO L225 Difference]: With dead ends: 478 [2019-09-10 03:55:08,296 INFO L226 Difference]: Without dead ends: 478 [2019-09-10 03:55:08,297 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:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-10 03:55:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 474. [2019-09-10 03:55:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-09-10 03:55:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 631 transitions. [2019-09-10 03:55:08,315 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 631 transitions. Word has length 173 [2019-09-10 03:55:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:08,316 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 631 transitions. [2019-09-10 03:55:08,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 631 transitions. [2019-09-10 03:55:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 03:55:08,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:08,318 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:08,318 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:08,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:08,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1317403854, now seen corresponding path program 1 times [2019-09-10 03:55:08,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:08,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:08,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:08,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:08,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:08,421 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:08,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:08,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:08,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:08,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:08,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:08,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:08,423 INFO L87 Difference]: Start difference. First operand 474 states and 631 transitions. Second operand 4 states. [2019-09-10 03:55:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:08,451 INFO L93 Difference]: Finished difference Result 472 states and 621 transitions. [2019-09-10 03:55:08,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:55:08,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-09-10 03:55:08,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:08,455 INFO L225 Difference]: With dead ends: 472 [2019-09-10 03:55:08,455 INFO L226 Difference]: Without dead ends: 472 [2019-09-10 03:55:08,456 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:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-10 03:55:08,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-09-10 03:55:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-10 03:55:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 621 transitions. [2019-09-10 03:55:08,468 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 621 transitions. Word has length 186 [2019-09-10 03:55:08,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:08,469 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 621 transitions. [2019-09-10 03:55:08,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:08,469 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 621 transitions. [2019-09-10 03:55:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-10 03:55:08,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:08,472 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:08,472 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:08,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1844440708, now seen corresponding path program 1 times [2019-09-10 03:55:08,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:08,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:08,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:08,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:08,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:08,567 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:08,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:08,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:08,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:08,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:08,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:08,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:08,569 INFO L87 Difference]: Start difference. First operand 472 states and 621 transitions. Second operand 4 states. [2019-09-10 03:55:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:08,584 INFO L93 Difference]: Finished difference Result 376 states and 478 transitions. [2019-09-10 03:55:08,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:55:08,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-09-10 03:55:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:08,588 INFO L225 Difference]: With dead ends: 376 [2019-09-10 03:55:08,589 INFO L226 Difference]: Without dead ends: 376 [2019-09-10 03:55:08,590 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:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-10 03:55:08,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 370. [2019-09-10 03:55:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-10 03:55:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 468 transitions. [2019-09-10 03:55:08,599 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 468 transitions. Word has length 200 [2019-09-10 03:55:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:08,600 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 468 transitions. [2019-09-10 03:55:08,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 468 transitions. [2019-09-10 03:55:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 03:55:08,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:08,603 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, 1] [2019-09-10 03:55:08,603 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:08,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:08,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2095310794, now seen corresponding path program 1 times [2019-09-10 03:55:08,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:08,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:08,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:08,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:08,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:08,716 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:08,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:08,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:08,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:08,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:08,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:08,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:08,719 INFO L87 Difference]: Start difference. First operand 370 states and 468 transitions. Second operand 4 states. [2019-09-10 03:55:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:09,133 INFO L93 Difference]: Finished difference Result 685 states and 895 transitions. [2019-09-10 03:55:09,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:55:09,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-09-10 03:55:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:09,140 INFO L225 Difference]: With dead ends: 685 [2019-09-10 03:55:09,140 INFO L226 Difference]: Without dead ends: 685 [2019-09-10 03:55:09,141 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:09,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-10 03:55:09,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 482. [2019-09-10 03:55:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-09-10 03:55:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 634 transitions. [2019-09-10 03:55:09,172 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 634 transitions. Word has length 201 [2019-09-10 03:55:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:09,176 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 634 transitions. [2019-09-10 03:55:09,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 634 transitions. [2019-09-10 03:55:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:55:09,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:09,183 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:09,183 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:09,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:09,184 INFO L82 PathProgramCache]: Analyzing trace with hash 469138459, now seen corresponding path program 1 times [2019-09-10 03:55:09,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:09,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:09,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:09,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:09,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:09,327 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:09,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:09,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:09,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:09,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:09,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:09,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:09,329 INFO L87 Difference]: Start difference. First operand 482 states and 634 transitions. Second operand 4 states. [2019-09-10 03:55:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:09,519 INFO L93 Difference]: Finished difference Result 821 states and 1104 transitions. [2019-09-10 03:55:09,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:55:09,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-09-10 03:55:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:09,524 INFO L225 Difference]: With dead ends: 821 [2019-09-10 03:55:09,525 INFO L226 Difference]: Without dead ends: 821 [2019-09-10 03:55:09,525 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:09,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-09-10 03:55:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 806. [2019-09-10 03:55:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2019-09-10 03:55:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1085 transitions. [2019-09-10 03:55:09,554 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1085 transitions. Word has length 237 [2019-09-10 03:55:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:09,554 INFO L475 AbstractCegarLoop]: Abstraction has 806 states and 1085 transitions. [2019-09-10 03:55:09,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:09,555 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1085 transitions. [2019-09-10 03:55:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 03:55:09,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:09,561 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:09,561 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:09,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:09,562 INFO L82 PathProgramCache]: Analyzing trace with hash -538822693, now seen corresponding path program 1 times [2019-09-10 03:55:09,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:09,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:09,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:09,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:09,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:09,752 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:09,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:09,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:55:09,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:09,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:55:09,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:55:09,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:55:09,754 INFO L87 Difference]: Start difference. First operand 806 states and 1085 transitions. Second operand 4 states. [2019-09-10 03:55:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:09,939 INFO L93 Difference]: Finished difference Result 1478 states and 2022 transitions. [2019-09-10 03:55:09,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:55:09,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-10 03:55:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:09,947 INFO L225 Difference]: With dead ends: 1478 [2019-09-10 03:55:09,947 INFO L226 Difference]: Without dead ends: 1478 [2019-09-10 03:55:09,948 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:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2019-09-10 03:55:09,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1114. [2019-09-10 03:55:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-09-10 03:55:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1515 transitions. [2019-09-10 03:55:09,994 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1515 transitions. Word has length 238 [2019-09-10 03:55:09,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:09,995 INFO L475 AbstractCegarLoop]: Abstraction has 1114 states and 1515 transitions. [2019-09-10 03:55:09,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:55:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1515 transitions. [2019-09-10 03:55:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 03:55:10,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:10,000 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:10,001 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:10,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:10,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1229849693, now seen corresponding path program 1 times [2019-09-10 03:55:10,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:10,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:10,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:10,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:10,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:10,121 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:10,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:55:10,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:55:10,122 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 240 with the following transitions: [2019-09-10 03:55:10,124 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], [219], [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], [502], [503], [515], [518], [532], [535], [539], [540], [541], [542], [543], [544], [545], [546], [547], [548], [549], [550], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [577], [579], [580], [591], [592], [601], [602], [611], [612], [613], [614], [615], [619], [620], [621], [622] [2019-09-10 03:55:10,135 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:55:10,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:55:10,150 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:55:10,258 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:55:10,258 INFO L272 AbstractInterpreter]: Visited 124 different actions 364 times. Merged at 24 different actions 80 times. Widened at 1 different actions 1 times. Performed 1800 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1800 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 5 fixpoints after 3 different actions. Largest state had 90 variables. [2019-09-10 03:55:10,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:10,259 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:55:10,442 INFO L227 lantSequenceWeakener]: Weakened 209 states. On average, predicates are now at 84.14% of their original sizes. [2019-09-10 03:55:10,442 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:55:13,985 INFO L420 sIntCurrentIteration]: We unified 238 AI predicates to 238 [2019-09-10 03:55:13,985 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:55:13,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:55:13,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [81] imperfect sequences [7] total 86 [2019-09-10 03:55:13,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:13,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-10 03:55:13,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-10 03:55:13,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=6027, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 03:55:13,990 INFO L87 Difference]: Start difference. First operand 1114 states and 1515 transitions. Second operand 81 states. [2019-09-10 03:55:26,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 03:55:26,010 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:26,017 INFO L168 Benchmark]: Toolchain (without parser) took 59323.31 ms. Allocated memory was 133.7 MB in the beginning and 762.8 MB in the end (delta: 629.1 MB). Free memory was 87.4 MB in the beginning and 172.3 MB in the end (delta: -84.9 MB). Peak memory consumption was 544.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:26,018 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 107.1 MB in the beginning and 106.8 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:26,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 547.32 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 87.2 MB in the beginning and 169.8 MB in the end (delta: -82.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:26,019 INFO L168 Benchmark]: Boogie Preprocessor took 101.75 ms. Allocated memory is still 199.8 MB. Free memory was 169.8 MB in the beginning and 166.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:26,020 INFO L168 Benchmark]: RCFGBuilder took 895.97 ms. Allocated memory is still 199.8 MB. Free memory was 166.4 MB in the beginning and 112.3 MB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:26,021 INFO L168 Benchmark]: TraceAbstraction took 57774.09 ms. Allocated memory was 199.8 MB in the beginning and 762.8 MB in the end (delta: 563.1 MB). Free memory was 112.3 MB in the beginning and 172.3 MB in the end (delta: -60.0 MB). Peak memory consumption was 503.1 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:26,025 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 133.7 MB. Free memory was 107.1 MB in the beginning and 106.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 547.32 ms. Allocated memory was 133.7 MB in the beginning and 199.8 MB in the end (delta: 66.1 MB). Free memory was 87.2 MB in the beginning and 169.8 MB in the end (delta: -82.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.75 ms. Allocated memory is still 199.8 MB. Free memory was 169.8 MB in the beginning and 166.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 895.97 ms. Allocated memory is still 199.8 MB. Free memory was 166.4 MB in the beginning and 112.3 MB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57774.09 ms. Allocated memory was 199.8 MB in the beginning and 762.8 MB in the end (delta: 563.1 MB). Free memory was 112.3 MB in the beginning and 172.3 MB in the end (delta: -60.0 MB). Peak memory consumption was 503.1 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...