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.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 03:08:38,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 03:08:38,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 03:08:38,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 03:08:38,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 03:08:38,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 03:08:38,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 03:08:38,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 03:08:38,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 03:08:38,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 03:08:38,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 03:08:38,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 03:08:38,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 03:08:38,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 03:08:38,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 03:08:38,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 03:08:38,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 03:08:38,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 03:08:38,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 03:08:38,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 03:08:38,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 03:08:38,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 03:08:38,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 03:08:38,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 03:08:38,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 03:08:38,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 03:08:38,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 03:08:38,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 03:08:38,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 03:08:38,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 03:08:38,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 03:08:38,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 03:08:38,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 03:08:38,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 03:08:38,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 03:08:38,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 03:08:38,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 03:08:38,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 03:08:38,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 03:08:38,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 03:08:38,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 03:08:38,110 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-10-03 03:08:38,125 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 03:08:38,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 03:08:38,126 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 03:08:38,126 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 03:08:38,127 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 03:08:38,127 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 03:08:38,127 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 03:08:38,128 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 03:08:38,128 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 03:08:38,128 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 03:08:38,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 03:08:38,129 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 03:08:38,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 03:08:38,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 03:08:38,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 03:08:38,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 03:08:38,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 03:08:38,130 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 03:08:38,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 03:08:38,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 03:08:38,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 03:08:38,131 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 03:08:38,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 03:08:38,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:08:38,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 03:08:38,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 03:08:38,132 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 03:08:38,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 03:08:38,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 03:08:38,133 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 03:08:38,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 03:08:38,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 03:08:38,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 03:08:38,179 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 03:08:38,179 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 03:08:38,180 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-03 03:08:38,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4793609/ccbed0173a314e34bf3110cc64b60303/FLAG1d19ba45b [2019-10-03 03:08:38,768 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 03:08:38,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-03 03:08:38,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4793609/ccbed0173a314e34bf3110cc64b60303/FLAG1d19ba45b [2019-10-03 03:08:39,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4793609/ccbed0173a314e34bf3110cc64b60303 [2019-10-03 03:08:39,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 03:08:39,119 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 03:08:39,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 03:08:39,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 03:08:39,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 03:08:39,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:08:39" (1/1) ... [2019-10-03 03:08:39,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d0606c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:39, skipping insertion in model container [2019-10-03 03:08:39,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:08:39" (1/1) ... [2019-10-03 03:08:39,135 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 03:08:39,197 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 03:08:39,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:08:39,610 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 03:08:39,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:08:39,710 INFO L192 MainTranslator]: Completed translation [2019-10-03 03:08:39,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:39 WrapperNode [2019-10-03 03:08:39,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 03:08:39,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 03:08:39,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 03:08:39,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 03:08:39,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:39" (1/1) ... [2019-10-03 03:08:39,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:39" (1/1) ... [2019-10-03 03:08:39,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:39" (1/1) ... [2019-10-03 03:08:39,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:39" (1/1) ... [2019-10-03 03:08:39,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:39" (1/1) ... [2019-10-03 03:08:39,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:39" (1/1) ... [2019-10-03 03:08:39,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:39" (1/1) ... [2019-10-03 03:08:39,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 03:08:39,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 03:08:39,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 03:08:39,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 03:08:39,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:39" (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-10-03 03:08:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 03:08:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 03:08:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-03 03:08:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-03 03:08:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-03 03:08:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-03 03:08:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-03 03:08:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-03 03:08:39,869 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-03 03:08:39,869 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-03 03:08:39,869 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-03 03:08:39,872 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-03 03:08:39,873 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-03 03:08:39,874 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 03:08:39,874 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-03 03:08:39,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 03:08:39,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 03:08:39,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-03 03:08:39,875 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-03 03:08:39,875 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-03 03:08:39,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 03:08:39,876 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-03 03:08:39,876 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-03 03:08:39,876 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-03 03:08:39,877 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-03 03:08:39,877 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-03 03:08:39,877 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-03 03:08:39,877 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-03 03:08:39,877 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-03 03:08:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-03 03:08:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-03 03:08:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-03 03:08:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-03 03:08:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 03:08:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 03:08:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 03:08:40,736 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 03:08:40,737 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-03 03:08:40,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:08:40 BoogieIcfgContainer [2019-10-03 03:08:40,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 03:08:40,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 03:08:40,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 03:08:40,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 03:08:40,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 03:08:39" (1/3) ... [2019-10-03 03:08:40,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db11cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:08:40, skipping insertion in model container [2019-10-03 03:08:40,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:08:39" (2/3) ... [2019-10-03 03:08:40,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db11cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:08:40, skipping insertion in model container [2019-10-03 03:08:40,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:08:40" (3/3) ... [2019-10-03 03:08:40,747 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-03 03:08:40,758 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 03:08:40,770 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 03:08:40,793 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 03:08:40,817 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 03:08:40,818 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 03:08:40,818 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 03:08:40,818 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 03:08:40,819 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 03:08:40,819 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 03:08:40,819 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 03:08:40,819 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 03:08:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2019-10-03 03:08:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 03:08:40,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:40,860 INFO L411 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-10-03 03:08:40,864 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:40,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:40,871 INFO L82 PathProgramCache]: Analyzing trace with hash -968101902, now seen corresponding path program 1 times [2019-10-03 03:08:40,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:40,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:40,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:40,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:40,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:41,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:41,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:41,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:41,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:41,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:41,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:41,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:41,266 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2019-10-03 03:08:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:41,420 INFO L93 Difference]: Finished difference Result 218 states and 326 transitions. [2019-10-03 03:08:41,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:08:41,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-03 03:08:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:41,457 INFO L225 Difference]: With dead ends: 218 [2019-10-03 03:08:41,458 INFO L226 Difference]: Without dead ends: 213 [2019-10-03 03:08:41,461 INFO L640 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-10-03 03:08:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-03 03:08:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-10-03 03:08:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-03 03:08:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 314 transitions. [2019-10-03 03:08:41,535 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 314 transitions. Word has length 21 [2019-10-03 03:08:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:41,536 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 314 transitions. [2019-10-03 03:08:41,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 314 transitions. [2019-10-03 03:08:41,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 03:08:41,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:41,539 INFO L411 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-10-03 03:08:41,539 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:41,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:41,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1316040493, now seen corresponding path program 1 times [2019-10-03 03:08:41,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:41,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:41,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:41,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:41,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:41,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:41,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:41,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:41,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:41,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:41,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:41,685 INFO L87 Difference]: Start difference. First operand 211 states and 314 transitions. Second operand 4 states. [2019-10-03 03:08:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:41,749 INFO L93 Difference]: Finished difference Result 227 states and 335 transitions. [2019-10-03 03:08:41,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:08:41,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-03 03:08:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:41,753 INFO L225 Difference]: With dead ends: 227 [2019-10-03 03:08:41,754 INFO L226 Difference]: Without dead ends: 227 [2019-10-03 03:08:41,755 INFO L640 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-10-03 03:08:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-03 03:08:41,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-10-03 03:08:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-10-03 03:08:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 330 transitions. [2019-10-03 03:08:41,780 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 330 transitions. Word has length 22 [2019-10-03 03:08:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:41,780 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 330 transitions. [2019-10-03 03:08:41,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2019-10-03 03:08:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 03:08:41,783 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:41,783 INFO L411 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-10-03 03:08:41,784 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:41,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:41,784 INFO L82 PathProgramCache]: Analyzing trace with hash 919864782, now seen corresponding path program 1 times [2019-10-03 03:08:41,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:41,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:41,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:41,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:41,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:41,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:41,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:08:41,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:41,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:08:41,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:08:41,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:08:41,869 INFO L87 Difference]: Start difference. First operand 224 states and 330 transitions. Second operand 3 states. [2019-10-03 03:08:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:41,891 INFO L93 Difference]: Finished difference Result 253 states and 375 transitions. [2019-10-03 03:08:41,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:08:41,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-03 03:08:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:41,895 INFO L225 Difference]: With dead ends: 253 [2019-10-03 03:08:41,895 INFO L226 Difference]: Without dead ends: 253 [2019-10-03 03:08:41,896 INFO L640 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-10-03 03:08:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-03 03:08:41,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2019-10-03 03:08:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-03 03:08:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 332 transitions. [2019-10-03 03:08:41,918 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 332 transitions. Word has length 30 [2019-10-03 03:08:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:41,918 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 332 transitions. [2019-10-03 03:08:41,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:08:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2019-10-03 03:08:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-03 03:08:41,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:41,921 INFO L411 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-10-03 03:08:41,922 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:41,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1667611779, now seen corresponding path program 1 times [2019-10-03 03:08:41,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:41,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:41,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:41,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:41,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:08:42,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:42,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:08:42,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:42,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:08:42,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:08:42,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:08:42,043 INFO L87 Difference]: Start difference. First operand 226 states and 332 transitions. Second operand 5 states. [2019-10-03 03:08:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:42,085 INFO L93 Difference]: Finished difference Result 234 states and 342 transitions. [2019-10-03 03:08:42,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:08:42,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-03 03:08:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:42,090 INFO L225 Difference]: With dead ends: 234 [2019-10-03 03:08:42,091 INFO L226 Difference]: Without dead ends: 234 [2019-10-03 03:08:42,091 INFO L640 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-10-03 03:08:42,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-03 03:08:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2019-10-03 03:08:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-03 03:08:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 336 transitions. [2019-10-03 03:08:42,124 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 336 transitions. Word has length 38 [2019-10-03 03:08:42,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:42,126 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 336 transitions. [2019-10-03 03:08:42,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:08:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 336 transitions. [2019-10-03 03:08:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 03:08:42,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:42,135 INFO L411 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-10-03 03:08:42,135 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:42,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:42,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1792772014, now seen corresponding path program 1 times [2019-10-03 03:08:42,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:42,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:42,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:42,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-10-03 03:08:42,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:42,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:42,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:42,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:42,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:42,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:42,205 INFO L87 Difference]: Start difference. First operand 230 states and 336 transitions. Second operand 4 states. [2019-10-03 03:08:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:42,234 INFO L93 Difference]: Finished difference Result 233 states and 338 transitions. [2019-10-03 03:08:42,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:08:42,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-10-03 03:08:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:42,238 INFO L225 Difference]: With dead ends: 233 [2019-10-03 03:08:42,238 INFO L226 Difference]: Without dead ends: 226 [2019-10-03 03:08:42,239 INFO L640 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-10-03 03:08:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-03 03:08:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-10-03 03:08:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-03 03:08:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2019-10-03 03:08:42,257 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 39 [2019-10-03 03:08:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:42,258 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2019-10-03 03:08:42,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2019-10-03 03:08:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-03 03:08:42,262 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:42,262 INFO L411 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-10-03 03:08:42,262 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:42,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:42,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1839866744, now seen corresponding path program 1 times [2019-10-03 03:08:42,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:42,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:42,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 03:08:42,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:42,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:42,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:42,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:42,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:42,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:42,353 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand 4 states. [2019-10-03 03:08:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:42,411 INFO L93 Difference]: Finished difference Result 245 states and 350 transitions. [2019-10-03 03:08:42,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:08:42,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-03 03:08:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:42,414 INFO L225 Difference]: With dead ends: 245 [2019-10-03 03:08:42,414 INFO L226 Difference]: Without dead ends: 245 [2019-10-03 03:08:42,415 INFO L640 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-10-03 03:08:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-03 03:08:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2019-10-03 03:08:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-03 03:08:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 346 transitions. [2019-10-03 03:08:42,427 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 346 transitions. Word has length 41 [2019-10-03 03:08:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:42,427 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 346 transitions. [2019-10-03 03:08:42,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 346 transitions. [2019-10-03 03:08:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-03 03:08:42,428 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:42,428 INFO L411 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-10-03 03:08:42,429 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:42,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash 968772057, now seen corresponding path program 1 times [2019-10-03 03:08:42,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:42,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:42,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 03:08:42,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:42,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:42,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:42,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:42,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:42,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:42,505 INFO L87 Difference]: Start difference. First operand 242 states and 346 transitions. Second operand 4 states. [2019-10-03 03:08:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:42,563 INFO L93 Difference]: Finished difference Result 251 states and 358 transitions. [2019-10-03 03:08:42,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:08:42,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-03 03:08:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:42,566 INFO L225 Difference]: With dead ends: 251 [2019-10-03 03:08:42,566 INFO L226 Difference]: Without dead ends: 251 [2019-10-03 03:08:42,566 INFO L640 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-10-03 03:08:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-03 03:08:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-10-03 03:08:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-03 03:08:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 354 transitions. [2019-10-03 03:08:42,578 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 354 transitions. Word has length 41 [2019-10-03 03:08:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:42,578 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 354 transitions. [2019-10-03 03:08:42,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 354 transitions. [2019-10-03 03:08:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:08:42,579 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:42,580 INFO L411 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-10-03 03:08:42,580 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:42,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:42,580 INFO L82 PathProgramCache]: Analyzing trace with hash -966374096, now seen corresponding path program 1 times [2019-10-03 03:08:42,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:42,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:42,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:08:42,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:42,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:08:42,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:42,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:08:42,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:08:42,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:08:42,676 INFO L87 Difference]: Start difference. First operand 249 states and 354 transitions. Second operand 5 states. [2019-10-03 03:08:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:42,706 INFO L93 Difference]: Finished difference Result 255 states and 360 transitions. [2019-10-03 03:08:42,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:08:42,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-03 03:08:42,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:42,709 INFO L225 Difference]: With dead ends: 255 [2019-10-03 03:08:42,709 INFO L226 Difference]: Without dead ends: 251 [2019-10-03 03:08:42,710 INFO L640 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-10-03 03:08:42,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-03 03:08:42,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-10-03 03:08:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-03 03:08:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 353 transitions. [2019-10-03 03:08:42,722 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 353 transitions. Word has length 59 [2019-10-03 03:08:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:42,723 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 353 transitions. [2019-10-03 03:08:42,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:08:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 353 transitions. [2019-10-03 03:08:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 03:08:42,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:42,724 INFO L411 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-10-03 03:08:42,725 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:42,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1964020213, now seen corresponding path program 1 times [2019-10-03 03:08:42,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:42,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:42,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 03:08:42,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:42,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:42,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:42,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:42,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:42,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:42,806 INFO L87 Difference]: Start difference. First operand 249 states and 353 transitions. Second operand 4 states. [2019-10-03 03:08:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:42,862 INFO L93 Difference]: Finished difference Result 270 states and 377 transitions. [2019-10-03 03:08:42,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:08:42,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-03 03:08:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:42,865 INFO L225 Difference]: With dead ends: 270 [2019-10-03 03:08:42,865 INFO L226 Difference]: Without dead ends: 270 [2019-10-03 03:08:42,865 INFO L640 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-10-03 03:08:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-10-03 03:08:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-10-03 03:08:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-03 03:08:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 374 transitions. [2019-10-03 03:08:42,876 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 374 transitions. Word has length 62 [2019-10-03 03:08:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:42,877 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 374 transitions. [2019-10-03 03:08:42,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 374 transitions. [2019-10-03 03:08:42,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 03:08:42,878 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:42,878 INFO L411 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-10-03 03:08:42,879 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:42,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:42,879 INFO L82 PathProgramCache]: Analyzing trace with hash -2021002903, now seen corresponding path program 1 times [2019-10-03 03:08:42,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:42,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:42,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:42,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-03 03:08:42,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:42,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:42,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:42,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:42,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:42,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:42,943 INFO L87 Difference]: Start difference. First operand 267 states and 374 transitions. Second operand 4 states. [2019-10-03 03:08:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:43,002 INFO L93 Difference]: Finished difference Result 261 states and 360 transitions. [2019-10-03 03:08:43,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:08:43,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-03 03:08:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:43,005 INFO L225 Difference]: With dead ends: 261 [2019-10-03 03:08:43,005 INFO L226 Difference]: Without dead ends: 261 [2019-10-03 03:08:43,005 INFO L640 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-10-03 03:08:43,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-10-03 03:08:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-10-03 03:08:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-10-03 03:08:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 360 transitions. [2019-10-03 03:08:43,020 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 360 transitions. Word has length 63 [2019-10-03 03:08:43,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:43,020 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 360 transitions. [2019-10-03 03:08:43,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:43,020 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 360 transitions. [2019-10-03 03:08:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-03 03:08:43,021 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:43,021 INFO L411 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-10-03 03:08:43,022 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:43,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:43,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1782318518, now seen corresponding path program 1 times [2019-10-03 03:08:43,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:43,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:43,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:43,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 03:08:43,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:43,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:08:43,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:43,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:08:43,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:08:43,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:08:43,102 INFO L87 Difference]: Start difference. First operand 261 states and 360 transitions. Second operand 5 states. [2019-10-03 03:08:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:43,125 INFO L93 Difference]: Finished difference Result 267 states and 365 transitions. [2019-10-03 03:08:43,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:08:43,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-10-03 03:08:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:43,128 INFO L225 Difference]: With dead ends: 267 [2019-10-03 03:08:43,128 INFO L226 Difference]: Without dead ends: 263 [2019-10-03 03:08:43,129 INFO L640 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-10-03 03:08:43,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-03 03:08:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2019-10-03 03:08:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-10-03 03:08:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 359 transitions. [2019-10-03 03:08:43,137 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 359 transitions. Word has length 82 [2019-10-03 03:08:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:43,138 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 359 transitions. [2019-10-03 03:08:43,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:08:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 359 transitions. [2019-10-03 03:08:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 03:08:43,139 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:43,139 INFO L411 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-10-03 03:08:43,140 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:43,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:43,140 INFO L82 PathProgramCache]: Analyzing trace with hash 77251503, now seen corresponding path program 1 times [2019-10-03 03:08:43,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:43,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:43,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:43,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:43,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-03 03:08:43,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:43,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:08:43,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:43,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:08:43,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:08:43,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:08:43,193 INFO L87 Difference]: Start difference. First operand 261 states and 359 transitions. Second operand 4 states. [2019-10-03 03:08:43,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:43,256 INFO L93 Difference]: Finished difference Result 259 states and 355 transitions. [2019-10-03 03:08:43,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:08:43,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-03 03:08:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:43,259 INFO L225 Difference]: With dead ends: 259 [2019-10-03 03:08:43,260 INFO L226 Difference]: Without dead ends: 259 [2019-10-03 03:08:43,260 INFO L640 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-10-03 03:08:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-03 03:08:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-10-03 03:08:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-03 03:08:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 355 transitions. [2019-10-03 03:08:43,269 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 355 transitions. Word has length 85 [2019-10-03 03:08:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:43,270 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 355 transitions. [2019-10-03 03:08:43,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:08:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2019-10-03 03:08:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-03 03:08:43,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:43,271 INFO L411 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-10-03 03:08:43,271 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:43,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:43,272 INFO L82 PathProgramCache]: Analyzing trace with hash -763139322, now seen corresponding path program 1 times [2019-10-03 03:08:43,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:43,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:43,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:43,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:43,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-03 03:08:43,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:43,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:08:43,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-10-03 03:08:43,331 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], [497], [537], [538], [539], [540], [541], [542], [543], [544], [551], [552], [553], [554], [555], [556], [559], [560], [561], [603], [607], [608], [609], [615] [2019-10-03 03:08:43,382 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:08:43,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:08:43,541 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:08:43,788 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 03:08:43,792 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-10-03 03:08:43,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:43,798 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 03:08:44,011 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 93.62% of their original sizes. [2019-10-03 03:08:44,012 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 03:08:45,004 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-10-03 03:08:45,004 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 03:08:45,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:08:45,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [4] total 37 [2019-10-03 03:08:45,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:45,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-03 03:08:45,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-03 03:08:45,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2019-10-03 03:08:45,008 INFO L87 Difference]: Start difference. First operand 259 states and 355 transitions. Second operand 35 states. [2019-10-03 03:08:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:56,979 INFO L93 Difference]: Finished difference Result 375 states and 494 transitions. [2019-10-03 03:08:56,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-03 03:08:56,979 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-10-03 03:08:56,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:56,982 INFO L225 Difference]: With dead ends: 375 [2019-10-03 03:08:56,982 INFO L226 Difference]: Without dead ends: 375 [2019-10-03 03:08:56,985 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=540, Invalid=5312, Unknown=0, NotChecked=0, Total=5852 [2019-10-03 03:08:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-03 03:08:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 307. [2019-10-03 03:08:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-03 03:08:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 405 transitions. [2019-10-03 03:08:57,003 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 405 transitions. Word has length 100 [2019-10-03 03:08:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:57,003 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 405 transitions. [2019-10-03 03:08:57,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-03 03:08:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 405 transitions. [2019-10-03 03:08:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-03 03:08:57,006 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:57,006 INFO L411 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-10-03 03:08:57,007 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:57,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:57,007 INFO L82 PathProgramCache]: Analyzing trace with hash -267545431, now seen corresponding path program 1 times [2019-10-03 03:08:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:57,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:57,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:57,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:57,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-03 03:08:57,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:08:57,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:08:57,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:57,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:08:57,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:08:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:08:57,094 INFO L87 Difference]: Start difference. First operand 307 states and 405 transitions. Second operand 5 states. [2019-10-03 03:08:57,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:08:57,111 INFO L93 Difference]: Finished difference Result 311 states and 408 transitions. [2019-10-03 03:08:57,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:08:57,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-10-03 03:08:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:08:57,113 INFO L225 Difference]: With dead ends: 311 [2019-10-03 03:08:57,114 INFO L226 Difference]: Without dead ends: 307 [2019-10-03 03:08:57,114 INFO L640 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-10-03 03:08:57,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-03 03:08:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-10-03 03:08:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-03 03:08:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 400 transitions. [2019-10-03 03:08:57,127 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 400 transitions. Word has length 144 [2019-10-03 03:08:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:08:57,127 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 400 transitions. [2019-10-03 03:08:57,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:08:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 400 transitions. [2019-10-03 03:08:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-03 03:08:57,133 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:08:57,133 INFO L411 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-10-03 03:08:57,133 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:08:57,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:57,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1981470506, now seen corresponding path program 1 times [2019-10-03 03:08:57,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:08:57,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:57,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:08:57,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:08:57,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:08:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:08:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-03 03:08:57,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:08:57,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:08:57,224 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-10-03 03:08:57,224 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], [497], [537], [538], [539], [540], [541], [542], [543], [544], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [603], [607], [608], [609], [615] [2019-10-03 03:08:57,232 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:08:57,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:08:57,249 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:08:57,339 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 03:08:57,339 INFO L272 AbstractInterpreter]: Visited 77 different actions 269 times. Merged at 21 different actions 64 times. Never widened. Performed 1254 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1254 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 1 different actions. Largest state had 89 variables. [2019-10-03 03:08:57,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:08:57,340 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 03:08:57,470 INFO L227 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 90.81% of their original sizes. [2019-10-03 03:08:57,470 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 03:08:58,736 INFO L420 sIntCurrentIteration]: We unified 152 AI predicates to 152 [2019-10-03 03:08:58,737 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 03:08:58,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:08:58,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [5] total 60 [2019-10-03 03:08:58,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:08:58,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-03 03:08:58,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-03 03:08:58,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2893, Unknown=0, NotChecked=0, Total=3192 [2019-10-03 03:08:58,740 INFO L87 Difference]: Start difference. First operand 307 states and 400 transitions. Second operand 57 states. [2019-10-03 03:09:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:21,122 INFO L93 Difference]: Finished difference Result 491 states and 661 transitions. [2019-10-03 03:09:21,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-03 03:09:21,123 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 153 [2019-10-03 03:09:21,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:21,127 INFO L225 Difference]: With dead ends: 491 [2019-10-03 03:09:21,127 INFO L226 Difference]: Without dead ends: 491 [2019-10-03 03:09:21,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2693 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=721, Invalid=8981, Unknown=0, NotChecked=0, Total=9702 [2019-10-03 03:09:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-03 03:09:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 462. [2019-10-03 03:09:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-10-03 03:09:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 619 transitions. [2019-10-03 03:09:21,148 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 619 transitions. Word has length 153 [2019-10-03 03:09:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:21,149 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 619 transitions. [2019-10-03 03:09:21,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-03 03:09:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 619 transitions. [2019-10-03 03:09:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-03 03:09:21,151 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:21,151 INFO L411 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-10-03 03:09:21,152 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:21,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:21,152 INFO L82 PathProgramCache]: Analyzing trace with hash -243298260, now seen corresponding path program 1 times [2019-10-03 03:09:21,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:21,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:21,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:21,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:21,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-03 03:09:21,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:21,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:21,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:21,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:21,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:21,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:21,250 INFO L87 Difference]: Start difference. First operand 462 states and 619 transitions. Second operand 4 states. [2019-10-03 03:09:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:21,283 INFO L93 Difference]: Finished difference Result 476 states and 631 transitions. [2019-10-03 03:09:21,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:21,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-10-03 03:09:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:21,288 INFO L225 Difference]: With dead ends: 476 [2019-10-03 03:09:21,288 INFO L226 Difference]: Without dead ends: 476 [2019-10-03 03:09:21,288 INFO L640 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-10-03 03:09:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-03 03:09:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 472. [2019-10-03 03:09:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-03 03:09:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 627 transitions. [2019-10-03 03:09:21,351 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 627 transitions. Word has length 173 [2019-10-03 03:09:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:21,352 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 627 transitions. [2019-10-03 03:09:21,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 627 transitions. [2019-10-03 03:09:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-03 03:09:21,360 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:21,360 INFO L411 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-10-03 03:09:21,361 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:21,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1314652604, now seen corresponding path program 1 times [2019-10-03 03:09:21,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:21,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:21,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:21,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:21,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-10-03 03:09:21,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:21,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:21,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:21,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:21,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:21,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:21,519 INFO L87 Difference]: Start difference. First operand 472 states and 627 transitions. Second operand 4 states. [2019-10-03 03:09:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:21,559 INFO L93 Difference]: Finished difference Result 470 states and 617 transitions. [2019-10-03 03:09:21,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:21,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-10-03 03:09:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:21,564 INFO L225 Difference]: With dead ends: 470 [2019-10-03 03:09:21,564 INFO L226 Difference]: Without dead ends: 470 [2019-10-03 03:09:21,564 INFO L640 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-10-03 03:09:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-03 03:09:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2019-10-03 03:09:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-10-03 03:09:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 617 transitions. [2019-10-03 03:09:21,577 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 617 transitions. Word has length 186 [2019-10-03 03:09:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:21,578 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 617 transitions. [2019-10-03 03:09:21,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 617 transitions. [2019-10-03 03:09:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-03 03:09:21,581 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:21,581 INFO L411 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] [2019-10-03 03:09:21,581 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:21,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash 507025156, now seen corresponding path program 1 times [2019-10-03 03:09:21,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:21,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:21,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:21,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-03 03:09:21,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:21,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:21,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:21,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:21,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:21,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:21,685 INFO L87 Difference]: Start difference. First operand 470 states and 617 transitions. Second operand 4 states. [2019-10-03 03:09:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:21,701 INFO L93 Difference]: Finished difference Result 374 states and 474 transitions. [2019-10-03 03:09:21,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:21,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-10-03 03:09:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:21,704 INFO L225 Difference]: With dead ends: 374 [2019-10-03 03:09:21,705 INFO L226 Difference]: Without dead ends: 374 [2019-10-03 03:09:21,705 INFO L640 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-10-03 03:09:21,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-10-03 03:09:21,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 369. [2019-10-03 03:09:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-10-03 03:09:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 466 transitions. [2019-10-03 03:09:21,716 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 466 transitions. Word has length 199 [2019-10-03 03:09:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:21,717 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 466 transitions. [2019-10-03 03:09:21,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 466 transitions. [2019-10-03 03:09:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-03 03:09:21,720 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:21,720 INFO L411 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-10-03 03:09:21,720 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:21,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:21,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1935753462, now seen corresponding path program 1 times [2019-10-03 03:09:21,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:21,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:21,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:21,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:21,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-03 03:09:21,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:21,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:21,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:21,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:21,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:21,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:21,816 INFO L87 Difference]: Start difference. First operand 369 states and 466 transitions. Second operand 4 states. [2019-10-03 03:09:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:22,132 INFO L93 Difference]: Finished difference Result 684 states and 893 transitions. [2019-10-03 03:09:22,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:22,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-10-03 03:09:22,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:22,141 INFO L225 Difference]: With dead ends: 684 [2019-10-03 03:09:22,141 INFO L226 Difference]: Without dead ends: 684 [2019-10-03 03:09:22,142 INFO L640 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-10-03 03:09:22,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-10-03 03:09:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 481. [2019-10-03 03:09:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-10-03 03:09:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 632 transitions. [2019-10-03 03:09:22,163 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 632 transitions. Word has length 201 [2019-10-03 03:09:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:22,163 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 632 transitions. [2019-10-03 03:09:22,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 632 transitions. [2019-10-03 03:09:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-03 03:09:22,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:22,167 INFO L411 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] [2019-10-03 03:09:22,168 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:22,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:22,168 INFO L82 PathProgramCache]: Analyzing trace with hash -833946183, now seen corresponding path program 1 times [2019-10-03 03:09:22,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:22,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:22,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:22,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-03 03:09:22,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:22,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:22,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:22,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:22,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:22,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:22,354 INFO L87 Difference]: Start difference. First operand 481 states and 632 transitions. Second operand 4 states. [2019-10-03 03:09:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:22,581 INFO L93 Difference]: Finished difference Result 819 states and 1100 transitions. [2019-10-03 03:09:22,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:22,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-10-03 03:09:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:22,587 INFO L225 Difference]: With dead ends: 819 [2019-10-03 03:09:22,587 INFO L226 Difference]: Without dead ends: 819 [2019-10-03 03:09:22,588 INFO L640 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-10-03 03:09:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-10-03 03:09:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 804. [2019-10-03 03:09:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-10-03 03:09:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1081 transitions. [2019-10-03 03:09:22,619 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1081 transitions. Word has length 236 [2019-10-03 03:09:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:22,619 INFO L475 AbstractCegarLoop]: Abstraction has 804 states and 1081 transitions. [2019-10-03 03:09:22,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1081 transitions. [2019-10-03 03:09:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-03 03:09:22,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:22,625 INFO L411 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-10-03 03:09:22,625 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:22,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash -758669803, now seen corresponding path program 1 times [2019-10-03 03:09:22,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:22,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:22,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:22,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:22,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-03 03:09:22,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:22,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:22,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:22,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:22,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:22,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:22,758 INFO L87 Difference]: Start difference. First operand 804 states and 1081 transitions. Second operand 4 states. [2019-10-03 03:09:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:22,981 INFO L93 Difference]: Finished difference Result 1474 states and 2014 transitions. [2019-10-03 03:09:22,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:22,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-10-03 03:09:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:22,994 INFO L225 Difference]: With dead ends: 1474 [2019-10-03 03:09:22,994 INFO L226 Difference]: Without dead ends: 1474 [2019-10-03 03:09:22,995 INFO L640 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-10-03 03:09:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-10-03 03:09:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1111. [2019-10-03 03:09:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-10-03 03:09:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1509 transitions. [2019-10-03 03:09:23,049 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1509 transitions. Word has length 237 [2019-10-03 03:09:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:23,050 INFO L475 AbstractCegarLoop]: Abstraction has 1111 states and 1509 transitions. [2019-10-03 03:09:23,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1509 transitions. [2019-10-03 03:09:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-03 03:09:23,060 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:23,060 INFO L411 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-10-03 03:09:23,060 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1887576620, now seen corresponding path program 1 times [2019-10-03 03:09:23,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:23,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:23,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:23,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:23,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-03 03:09:23,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:23,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:23,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:23,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:23,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:23,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:23,275 INFO L87 Difference]: Start difference. First operand 1111 states and 1509 transitions. Second operand 4 states. [2019-10-03 03:09:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:23,533 INFO L93 Difference]: Finished difference Result 2115 states and 2909 transitions. [2019-10-03 03:09:23,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:23,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-10-03 03:09:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:23,547 INFO L225 Difference]: With dead ends: 2115 [2019-10-03 03:09:23,547 INFO L226 Difference]: Without dead ends: 2115 [2019-10-03 03:09:23,548 INFO L640 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-10-03 03:09:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2019-10-03 03:09:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1401. [2019-10-03 03:09:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-10-03 03:09:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1915 transitions. [2019-10-03 03:09:23,617 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1915 transitions. Word has length 238 [2019-10-03 03:09:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:23,617 INFO L475 AbstractCegarLoop]: Abstraction has 1401 states and 1915 transitions. [2019-10-03 03:09:23,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1915 transitions. [2019-10-03 03:09:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-03 03:09:23,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:23,624 INFO L411 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-10-03 03:09:23,624 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash 163407378, now seen corresponding path program 1 times [2019-10-03 03:09:23,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:23,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:23,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:23,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:23,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-10-03 03:09:23,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:09:23,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:09:23,757 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2019-10-03 03:09:23,757 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [37], [38], [40], [44], [46], [50], [52], [56], [58], [62], [63], [64], [67], [70], [79], [80], [83], [86], [92], [95], [98], [104], [107], [110], [119], [120], [123], [128], [129], [136], [138], [141], [143], [147], [149], [152], [154], [158], [160], [163], [165], [169], [171], [174], [176], [180], [184], [188], [189], [190], [192], [201], [206], [208], [216], [221], [226], [231], [233], [235], [307], [310], [343], [346], [373], [375], [376], [377], [380], [382], [385], [387], [390], [395], [396], [400], [405], [407], [433], [434], [435], [436], [439], [441], [450], [453], [496], [497], [501], [506], [508], [534], [535], [536], [537], [538], [539], [540], [541], [542], [543], [544], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [573], [574], [585], [586], [595], [596], [605], [606], [607], [608], [609], [613], [614], [615], [616] [2019-10-03 03:09:23,762 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:09:23,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:09:23,776 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:09:23,927 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 03:09:23,928 INFO L272 AbstractInterpreter]: Visited 123 different actions 364 times. Merged at 24 different actions 82 times. Widened at 1 different actions 1 times. Performed 1848 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1848 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-10-03 03:09:23,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:23,928 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 03:09:24,158 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 84.42% of their original sizes. [2019-10-03 03:09:24,158 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 03:09:27,813 INFO L420 sIntCurrentIteration]: We unified 237 AI predicates to 237 [2019-10-03 03:09:27,813 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 03:09:27,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:09:27,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [77] imperfect sequences [7] total 82 [2019-10-03 03:09:27,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:27,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-03 03:09:27,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-03 03:09:27,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=5431, Unknown=0, NotChecked=0, Total=5852 [2019-10-03 03:09:27,817 INFO L87 Difference]: Start difference. First operand 1401 states and 1915 transitions. Second operand 77 states. [2019-10-03 03:09:38,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-03 03:09:38,672 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:708) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:637) 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-10-03 03:09:38,681 INFO L168 Benchmark]: Toolchain (without parser) took 59561.04 ms. Allocated memory was 132.6 MB in the beginning and 816.8 MB in the end (delta: 684.2 MB). Free memory was 83.5 MB in the beginning and 614.8 MB in the end (delta: -531.3 MB). Peak memory consumption was 152.9 MB. Max. memory is 7.1 GB. [2019-10-03 03:09:38,682 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.6 MB. Free memory was 102.8 MB in the beginning and 102.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 03:09:38,682 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.81 ms. Allocated memory was 132.6 MB in the beginning and 198.2 MB in the end (delta: 65.5 MB). Free memory was 83.3 MB in the beginning and 169.6 MB in the end (delta: -86.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-10-03 03:09:38,683 INFO L168 Benchmark]: Boogie Preprocessor took 94.34 ms. Allocated memory is still 198.2 MB. Free memory was 169.6 MB in the beginning and 166.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-03 03:09:38,684 INFO L168 Benchmark]: RCFGBuilder took 930.91 ms. Allocated memory is still 198.2 MB. Free memory was 166.9 MB in the beginning and 111.7 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB. [2019-10-03 03:09:38,685 INFO L168 Benchmark]: TraceAbstraction took 57938.48 ms. Allocated memory was 198.2 MB in the beginning and 816.8 MB in the end (delta: 618.7 MB). Free memory was 111.1 MB in the beginning and 614.8 MB in the end (delta: -503.7 MB). Peak memory consumption was 114.9 MB. Max. memory is 7.1 GB. [2019-10-03 03:09:38,693 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 132.6 MB. Free memory was 102.8 MB in the beginning and 102.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 592.81 ms. Allocated memory was 132.6 MB in the beginning and 198.2 MB in the end (delta: 65.5 MB). Free memory was 83.3 MB in the beginning and 169.6 MB in the end (delta: -86.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.34 ms. Allocated memory is still 198.2 MB. Free memory was 169.6 MB in the beginning and 166.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 930.91 ms. Allocated memory is still 198.2 MB. Free memory was 166.9 MB in the beginning and 111.7 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57938.48 ms. Allocated memory was 198.2 MB in the beginning and 816.8 MB in the end (delta: 618.7 MB). Free memory was 111.1 MB in the beginning and 614.8 MB in the end (delta: -503.7 MB). Peak memory consumption was 114.9 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...