/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/pthread-divine/ring_2w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 11:22:41,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 11:22:41,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 11:22:41,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 11:22:41,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 11:22:41,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 11:22:41,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 11:22:41,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 11:22:41,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 11:22:41,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 11:22:41,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 11:22:41,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 11:22:41,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 11:22:41,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 11:22:41,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 11:22:41,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 11:22:41,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 11:22:41,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 11:22:41,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 11:22:41,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 11:22:41,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 11:22:41,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 11:22:41,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 11:22:41,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 11:22:41,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 11:22:41,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 11:22:41,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 11:22:41,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 11:22:41,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 11:22:41,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 11:22:41,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 11:22:41,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 11:22:41,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 11:22:41,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 11:22:41,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 11:22:41,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 11:22:41,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 11:22:41,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 11:22:41,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 11:22:41,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 11:22:41,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 11:22:41,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 11:22:41,256 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 11:22:41,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 11:22:41,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 11:22:41,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 11:22:41,261 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 11:22:41,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 11:22:41,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 11:22:41,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 11:22:41,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 11:22:41,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 11:22:41,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 11:22:41,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 11:22:41,264 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 11:22:41,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 11:22:41,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 11:22:41,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 11:22:41,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 11:22:41,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 11:22:41,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 11:22:41,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 11:22:41,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 11:22:41,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 11:22:41,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 11:22:41,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 11:22:41,268 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 11:22:41,268 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 11:22:41,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 11:22:41,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 11:22:41,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 11:22:41,712 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 11:22:41,712 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 11:22:41,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/ring_2w1r-2.i [2020-12-22 11:22:41,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42ea5e80a/29232e67fdac4d04abfe956f01f0d195/FLAGc664d8d61 [2020-12-22 11:22:42,523 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 11:22:42,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i [2020-12-22 11:22:42,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42ea5e80a/29232e67fdac4d04abfe956f01f0d195/FLAGc664d8d61 [2020-12-22 11:22:42,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42ea5e80a/29232e67fdac4d04abfe956f01f0d195 [2020-12-22 11:22:42,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 11:22:42,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 11:22:42,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 11:22:42,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 11:22:42,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 11:22:42,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:22:42" (1/1) ... [2020-12-22 11:22:42,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794aa9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:42, skipping insertion in model container [2020-12-22 11:22:42,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:22:42" (1/1) ... [2020-12-22 11:22:42,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 11:22:42,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 11:22:42,985 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-22 11:22:43,336 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39095,39108] [2020-12-22 11:22:43,342 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39180,39193] [2020-12-22 11:22:43,343 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39232,39245] [2020-12-22 11:22:43,460 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49285,49298] [2020-12-22 11:22:43,461 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49334,49347] [2020-12-22 11:22:43,463 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49462,49475] [2020-12-22 11:22:43,465 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49520,49533] [2020-12-22 11:22:43,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 11:22:43,480 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 11:22:43,494 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-22 11:22:43,523 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39095,39108] [2020-12-22 11:22:43,524 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39180,39193] [2020-12-22 11:22:43,525 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39232,39245] [2020-12-22 11:22:43,538 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49285,49298] [2020-12-22 11:22:43,539 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49334,49347] [2020-12-22 11:22:43,541 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49462,49475] [2020-12-22 11:22:43,542 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49520,49533] [2020-12-22 11:22:43,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 11:22:43,806 INFO L208 MainTranslator]: Completed translation [2020-12-22 11:22:43,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:43 WrapperNode [2020-12-22 11:22:43,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 11:22:43,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 11:22:43,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 11:22:43,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 11:22:43,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:43" (1/1) ... [2020-12-22 11:22:43,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:43" (1/1) ... [2020-12-22 11:22:43,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 11:22:43,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 11:22:43,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 11:22:43,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 11:22:43,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:43" (1/1) ... [2020-12-22 11:22:43,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:43" (1/1) ... [2020-12-22 11:22:43,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:43" (1/1) ... [2020-12-22 11:22:43,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:43" (1/1) ... [2020-12-22 11:22:43,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:43" (1/1) ... [2020-12-22 11:22:43,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:43" (1/1) ... [2020-12-22 11:22:43,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:43" (1/1) ... [2020-12-22 11:22:43,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 11:22:43,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 11:22:43,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 11:22:43,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 11:22:43,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:43" (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 [2020-12-22 11:22:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2020-12-22 11:22:44,070 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2020-12-22 11:22:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2020-12-22 11:22:44,070 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2020-12-22 11:22:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 11:22:44,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 11:22:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-22 11:22:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 11:22:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 11:22:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 11:22:44,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 11:22:44,074 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-22 11:22:44,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 11:22:44,867 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2020-12-22 11:22:44,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:22:44 BoogieIcfgContainer [2020-12-22 11:22:44,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 11:22:44,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 11:22:44,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 11:22:44,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 11:22:44,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 11:22:42" (1/3) ... [2020-12-22 11:22:44,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cff0ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:22:44, skipping insertion in model container [2020-12-22 11:22:44,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:43" (2/3) ... [2020-12-22 11:22:44,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cff0ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:22:44, skipping insertion in model container [2020-12-22 11:22:44,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:22:44" (3/3) ... [2020-12-22 11:22:44,880 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2020-12-22 11:22:44,888 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-22 11:22:44,888 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 11:22:44,894 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-12-22 11:22:44,895 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-22 11:22:44,959 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,960 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,960 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,960 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,961 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,961 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,961 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,961 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,962 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,962 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,962 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,962 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,962 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,963 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,963 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,963 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,964 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,964 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,964 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,964 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,965 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,965 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,965 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,965 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,966 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,966 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,966 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,966 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,967 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,967 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,967 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,967 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,968 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,968 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,968 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,968 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,969 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,969 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,969 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,969 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,970 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,970 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,970 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,970 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,971 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,972 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,972 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,972 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,972 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,973 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,973 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,973 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,973 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,974 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,974 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,974 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,974 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,974 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,975 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,975 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,975 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,975 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,976 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,976 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,976 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,976 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,977 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,977 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,977 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,977 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,978 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,978 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,978 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,978 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,978 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,979 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,979 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,979 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,979 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,979 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,980 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,980 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,980 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,980 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,981 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,981 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,981 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,981 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,982 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,982 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,982 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,982 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,982 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,983 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,983 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,983 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,983 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,983 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,984 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,984 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,984 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,984 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,985 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,985 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,986 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,986 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,986 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,986 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,987 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,987 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,987 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,987 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,988 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,988 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,988 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,988 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,988 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,989 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,989 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,989 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,990 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,990 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,990 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,990 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,991 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,991 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,991 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,991 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,992 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,992 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,992 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,992 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,992 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,993 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,993 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,993 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,993 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,994 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,994 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,994 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,994 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,994 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,995 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,995 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,995 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,995 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,995 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,996 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,996 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,996 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,996 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,997 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,997 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,997 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,997 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,997 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,998 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,998 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,998 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,998 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,999 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,999 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,999 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,999 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:44,999 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,000 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,000 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,000 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,000 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,000 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,001 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,001 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,001 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,001 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,002 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,002 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,002 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,002 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,002 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,003 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,003 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,003 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,003 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,004 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,004 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,004 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,005 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,005 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,005 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,005 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,006 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,006 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,006 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,006 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,007 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,007 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,007 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,007 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,007 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,008 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,008 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,008 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,008 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,008 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,009 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,009 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,009 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,009 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,010 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,010 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,010 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,011 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,011 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,011 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,011 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,012 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,012 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,012 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,012 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,012 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,013 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,013 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,013 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,013 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,013 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,014 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,014 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,014 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,014 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,014 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,015 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,015 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,015 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,015 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,015 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,016 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,016 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,016 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,016 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,017 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,017 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,017 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,017 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,018 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,018 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,018 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,018 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,018 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,019 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,019 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,019 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,019 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,019 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,020 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,020 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,020 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,020 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,021 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,021 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,021 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,021 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,021 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,022 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,022 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,022 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,022 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,023 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,023 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,023 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,023 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,024 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,024 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,024 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,024 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,024 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,024 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,025 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,025 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,025 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,025 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,025 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,026 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,026 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,026 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,026 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,027 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,027 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,027 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,027 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,027 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,027 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,028 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,028 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,028 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,029 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,029 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,029 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,029 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,030 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,030 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,030 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,030 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,030 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,031 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,031 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,031 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,031 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,031 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,031 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,032 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,032 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,032 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,032 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,032 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,033 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,033 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,033 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,033 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,033 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,034 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,034 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,034 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,034 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,034 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,035 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,035 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,035 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,035 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,035 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,036 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,036 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,036 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,036 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,036 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,037 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,037 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,037 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,037 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,037 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,037 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,038 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,038 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,038 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,038 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,038 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,039 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,039 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,039 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,039 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,039 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,040 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,040 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,040 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,040 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,040 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,041 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,041 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,041 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,041 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,041 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,042 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,042 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,042 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,042 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,042 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,043 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,043 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,043 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,043 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,043 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,044 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,044 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,044 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,044 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,044 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,045 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,045 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,045 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,045 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,045 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,046 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,046 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,046 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,046 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,046 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,047 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,047 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,047 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,047 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,047 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,048 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,048 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,048 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,048 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,048 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,049 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,049 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,049 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,049 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,049 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,050 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,050 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,050 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,050 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,050 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,051 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,051 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,051 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,051 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,051 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,051 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,052 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,052 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,052 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,052 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,052 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,053 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,053 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,053 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,054 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,054 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,054 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,054 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,054 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,081 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,081 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,084 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,084 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,085 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,085 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,085 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,085 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,086 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,086 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,086 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,086 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,086 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,086 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,087 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,087 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,087 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,087 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,087 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,088 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,088 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,088 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,088 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,088 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,089 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,089 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,089 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,089 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,089 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,089 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,090 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,090 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,090 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,090 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,090 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,091 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,091 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,097 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,098 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,098 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,098 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,098 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,098 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,099 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,099 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,099 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,099 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,099 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,099 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,100 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,100 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,100 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,100 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,100 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,100 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:45,110 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-12-22 11:22:45,134 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-12-22 11:22:45,158 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 11:22:45,159 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 11:22:45,159 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 11:22:45,159 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 11:22:45,159 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 11:22:45,159 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 11:22:45,159 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 11:22:45,159 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 11:22:45,177 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-22 11:22:45,179 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 200 transitions, 422 flow [2020-12-22 11:22:45,184 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 200 transitions, 422 flow [2020-12-22 11:22:45,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 188 places, 200 transitions, 422 flow [2020-12-22 11:22:45,277 INFO L129 PetriNetUnfolder]: 18/200 cut-off events. [2020-12-22 11:22:45,277 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-12-22 11:22:45,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 200 events. 18/200 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2020-12-22 11:22:45,312 INFO L116 LiptonReduction]: Number of co-enabled transitions 15102 [2020-12-22 11:22:50,992 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-22 11:22:51,113 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-12-22 11:22:51,238 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-22 11:22:51,350 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-12-22 11:22:52,467 WARN L197 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2020-12-22 11:22:52,622 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-12-22 11:22:52,958 WARN L197 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2020-12-22 11:22:53,155 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-12-22 11:22:53,499 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-12-22 11:22:53,733 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-12-22 11:22:53,942 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-12-22 11:22:54,142 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-12-22 11:22:54,167 INFO L131 LiptonReduction]: Checked pairs total: 29380 [2020-12-22 11:22:54,168 INFO L133 LiptonReduction]: Total number of compositions: 172 [2020-12-22 11:22:54,179 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 64 transitions, 150 flow [2020-12-22 11:22:54,341 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2096 states. [2020-12-22 11:22:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states. [2020-12-22 11:22:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-22 11:22:54,376 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:54,377 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:22:54,379 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:54,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:54,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1939241903, now seen corresponding path program 1 times [2020-12-22 11:22:54,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:54,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277657147] [2020-12-22 11:22:54,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:55,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277657147] [2020-12-22 11:22:55,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:55,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 11:22:55,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422794276] [2020-12-22 11:22:55,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 11:22:55,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:55,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 11:22:55,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:22:55,152 INFO L87 Difference]: Start difference. First operand 2096 states. Second operand 7 states. [2020-12-22 11:22:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:22:55,670 INFO L93 Difference]: Finished difference Result 2085 states and 6715 transitions. [2020-12-22 11:22:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 11:22:55,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-12-22 11:22:55,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:22:55,717 INFO L225 Difference]: With dead ends: 2085 [2020-12-22 11:22:55,717 INFO L226 Difference]: Without dead ends: 1969 [2020-12-22 11:22:55,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-12-22 11:22:55,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2020-12-22 11:22:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2020-12-22 11:22:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2020-12-22 11:22:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 6383 transitions. [2020-12-22 11:22:55,933 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 6383 transitions. Word has length 17 [2020-12-22 11:22:55,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:22:55,934 INFO L481 AbstractCegarLoop]: Abstraction has 1969 states and 6383 transitions. [2020-12-22 11:22:55,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 11:22:55,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 6383 transitions. [2020-12-22 11:22:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 11:22:55,939 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:55,939 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:22:55,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 11:22:55,940 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:55,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:55,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1330449573, now seen corresponding path program 1 times [2020-12-22 11:22:55,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:55,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239561690] [2020-12-22 11:22:55,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:56,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239561690] [2020-12-22 11:22:56,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:56,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 11:22:56,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858956984] [2020-12-22 11:22:56,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 11:22:56,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:56,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 11:22:56,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-22 11:22:56,192 INFO L87 Difference]: Start difference. First operand 1969 states and 6383 transitions. Second operand 8 states. [2020-12-22 11:22:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:22:56,930 INFO L93 Difference]: Finished difference Result 3414 states and 11077 transitions. [2020-12-22 11:22:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 11:22:56,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-22 11:22:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:22:56,960 INFO L225 Difference]: With dead ends: 3414 [2020-12-22 11:22:56,960 INFO L226 Difference]: Without dead ends: 3234 [2020-12-22 11:22:56,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:22:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3234 states. [2020-12-22 11:22:57,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3234 to 2506. [2020-12-22 11:22:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-12-22 11:22:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 8138 transitions. [2020-12-22 11:22:57,122 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 8138 transitions. Word has length 18 [2020-12-22 11:22:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:22:57,123 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 8138 transitions. [2020-12-22 11:22:57,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 11:22:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 8138 transitions. [2020-12-22 11:22:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 11:22:57,127 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:57,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:22:57,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 11:22:57,128 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:57,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:57,134 INFO L82 PathProgramCache]: Analyzing trace with hash 588258613, now seen corresponding path program 2 times [2020-12-22 11:22:57,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:57,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375245990] [2020-12-22 11:22:57,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:57,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375245990] [2020-12-22 11:22:57,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:57,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 11:22:57,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586763605] [2020-12-22 11:22:57,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 11:22:57,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:57,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 11:22:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-22 11:22:57,312 INFO L87 Difference]: Start difference. First operand 2506 states and 8138 transitions. Second operand 8 states. [2020-12-22 11:22:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:22:58,050 INFO L93 Difference]: Finished difference Result 3423 states and 11147 transitions. [2020-12-22 11:22:58,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 11:22:58,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-22 11:22:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:22:58,079 INFO L225 Difference]: With dead ends: 3423 [2020-12-22 11:22:58,079 INFO L226 Difference]: Without dead ends: 3247 [2020-12-22 11:22:58,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:22:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2020-12-22 11:22:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2545. [2020-12-22 11:22:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2545 states. [2020-12-22 11:22:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 8321 transitions. [2020-12-22 11:22:58,193 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 8321 transitions. Word has length 18 [2020-12-22 11:22:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:22:58,193 INFO L481 AbstractCegarLoop]: Abstraction has 2545 states and 8321 transitions. [2020-12-22 11:22:58,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 11:22:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 8321 transitions. [2020-12-22 11:22:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 11:22:58,250 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:58,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:22:58,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 11:22:58,251 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:58,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:58,252 INFO L82 PathProgramCache]: Analyzing trace with hash 848973395, now seen corresponding path program 3 times [2020-12-22 11:22:58,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:58,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723489560] [2020-12-22 11:22:58,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:58,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723489560] [2020-12-22 11:22:58,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:58,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 11:22:58,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349841051] [2020-12-22 11:22:58,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 11:22:58,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 11:22:58,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 11:22:58,482 INFO L87 Difference]: Start difference. First operand 2545 states and 8321 transitions. Second operand 8 states. [2020-12-22 11:22:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:22:59,124 INFO L93 Difference]: Finished difference Result 2651 states and 8539 transitions. [2020-12-22 11:22:59,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:22:59,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-22 11:22:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:22:59,148 INFO L225 Difference]: With dead ends: 2651 [2020-12-22 11:22:59,149 INFO L226 Difference]: Without dead ends: 2510 [2020-12-22 11:22:59,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-12-22 11:22:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2020-12-22 11:22:59,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2461. [2020-12-22 11:22:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2020-12-22 11:22:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 8022 transitions. [2020-12-22 11:22:59,251 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 8022 transitions. Word has length 18 [2020-12-22 11:22:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:22:59,251 INFO L481 AbstractCegarLoop]: Abstraction has 2461 states and 8022 transitions. [2020-12-22 11:22:59,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 11:22:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 8022 transitions. [2020-12-22 11:22:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:22:59,258 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:59,258 INFO L422 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] [2020-12-22 11:22:59,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 11:22:59,259 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:59,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:59,259 INFO L82 PathProgramCache]: Analyzing trace with hash 197324648, now seen corresponding path program 1 times [2020-12-22 11:22:59,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:59,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475630723] [2020-12-22 11:22:59,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:59,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475630723] [2020-12-22 11:22:59,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:59,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:22:59,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797317581] [2020-12-22 11:22:59,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 11:22:59,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:59,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 11:22:59,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-12-22 11:22:59,763 INFO L87 Difference]: Start difference. First operand 2461 states and 8022 transitions. Second operand 14 states. [2020-12-22 11:23:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:01,985 INFO L93 Difference]: Finished difference Result 3016 states and 9709 transitions. [2020-12-22 11:23:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:23:01,986 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-22 11:23:01,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:02,008 INFO L225 Difference]: With dead ends: 3016 [2020-12-22 11:23:02,009 INFO L226 Difference]: Without dead ends: 2941 [2020-12-22 11:23:02,009 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2020-12-22 11:23:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-12-22 11:23:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2832. [2020-12-22 11:23:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2832 states. [2020-12-22 11:23:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 9248 transitions. [2020-12-22 11:23:02,106 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 9248 transitions. Word has length 25 [2020-12-22 11:23:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:02,107 INFO L481 AbstractCegarLoop]: Abstraction has 2832 states and 9248 transitions. [2020-12-22 11:23:02,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 11:23:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 9248 transitions. [2020-12-22 11:23:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:02,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:02,114 INFO L422 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] [2020-12-22 11:23:02,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 11:23:02,115 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:02,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:02,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1068686744, now seen corresponding path program 2 times [2020-12-22 11:23:02,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:02,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240946837] [2020-12-22 11:23:02,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:02,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240946837] [2020-12-22 11:23:02,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:02,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:23:02,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768629996] [2020-12-22 11:23:02,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:23:02,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:02,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:23:02,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:23:02,481 INFO L87 Difference]: Start difference. First operand 2832 states and 9248 transitions. Second operand 13 states. [2020-12-22 11:23:04,085 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2020-12-22 11:23:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:04,614 INFO L93 Difference]: Finished difference Result 3121 states and 10026 transitions. [2020-12-22 11:23:04,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:23:04,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:23:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:04,633 INFO L225 Difference]: With dead ends: 3121 [2020-12-22 11:23:04,633 INFO L226 Difference]: Without dead ends: 3032 [2020-12-22 11:23:04,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:23:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2020-12-22 11:23:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2951. [2020-12-22 11:23:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2951 states. [2020-12-22 11:23:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 9622 transitions. [2020-12-22 11:23:04,730 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 9622 transitions. Word has length 25 [2020-12-22 11:23:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:04,731 INFO L481 AbstractCegarLoop]: Abstraction has 2951 states and 9622 transitions. [2020-12-22 11:23:04,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:23:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 9622 transitions. [2020-12-22 11:23:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:04,738 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:04,738 INFO L422 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] [2020-12-22 11:23:04,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 11:23:04,739 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:04,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash -602227060, now seen corresponding path program 1 times [2020-12-22 11:23:04,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:04,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721612050] [2020-12-22 11:23:04,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:05,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721612050] [2020-12-22 11:23:05,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:05,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:23:05,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757421743] [2020-12-22 11:23:05,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 11:23:05,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:05,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 11:23:05,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-12-22 11:23:05,105 INFO L87 Difference]: Start difference. First operand 2951 states and 9622 transitions. Second operand 14 states. [2020-12-22 11:23:07,389 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-12-22 11:23:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:07,954 INFO L93 Difference]: Finished difference Result 4860 states and 15550 transitions. [2020-12-22 11:23:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-22 11:23:07,955 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-22 11:23:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:07,976 INFO L225 Difference]: With dead ends: 4860 [2020-12-22 11:23:07,976 INFO L226 Difference]: Without dead ends: 4771 [2020-12-22 11:23:07,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=265, Invalid=605, Unknown=0, NotChecked=0, Total=870 [2020-12-22 11:23:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4771 states. [2020-12-22 11:23:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4771 to 3761. [2020-12-22 11:23:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3761 states. [2020-12-22 11:23:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 12282 transitions. [2020-12-22 11:23:08,110 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 12282 transitions. Word has length 25 [2020-12-22 11:23:08,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:08,112 INFO L481 AbstractCegarLoop]: Abstraction has 3761 states and 12282 transitions. [2020-12-22 11:23:08,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 11:23:08,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 12282 transitions. [2020-12-22 11:23:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:08,121 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:08,122 INFO L422 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] [2020-12-22 11:23:08,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 11:23:08,122 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:08,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:08,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1437674924, now seen corresponding path program 3 times [2020-12-22 11:23:08,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:08,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759456549] [2020-12-22 11:23:08,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:08,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759456549] [2020-12-22 11:23:08,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:08,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:23:08,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792751634] [2020-12-22 11:23:08,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 11:23:08,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:08,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 11:23:08,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-12-22 11:23:08,478 INFO L87 Difference]: Start difference. First operand 3761 states and 12282 transitions. Second operand 14 states. [2020-12-22 11:23:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:10,592 INFO L93 Difference]: Finished difference Result 4452 states and 14292 transitions. [2020-12-22 11:23:10,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:23:10,593 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-22 11:23:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:10,609 INFO L225 Difference]: With dead ends: 4452 [2020-12-22 11:23:10,609 INFO L226 Difference]: Without dead ends: 4377 [2020-12-22 11:23:10,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:23:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4377 states. [2020-12-22 11:23:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4377 to 4267. [2020-12-22 11:23:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4267 states. [2020-12-22 11:23:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 13884 transitions. [2020-12-22 11:23:10,748 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 13884 transitions. Word has length 25 [2020-12-22 11:23:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:10,749 INFO L481 AbstractCegarLoop]: Abstraction has 4267 states and 13884 transitions. [2020-12-22 11:23:10,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 11:23:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 13884 transitions. [2020-12-22 11:23:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:10,760 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:10,760 INFO L422 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] [2020-12-22 11:23:10,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 11:23:10,761 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:10,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:10,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1985930276, now seen corresponding path program 4 times [2020-12-22 11:23:10,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:10,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004384864] [2020-12-22 11:23:10,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:11,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004384864] [2020-12-22 11:23:11,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:11,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:23:11,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184936267] [2020-12-22 11:23:11,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:23:11,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:11,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:23:11,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:23:11,110 INFO L87 Difference]: Start difference. First operand 4267 states and 13884 transitions. Second operand 13 states. [2020-12-22 11:23:13,283 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-12-22 11:23:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:13,882 INFO L93 Difference]: Finished difference Result 5096 states and 16292 transitions. [2020-12-22 11:23:13,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-22 11:23:13,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:23:13,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:13,900 INFO L225 Difference]: With dead ends: 5096 [2020-12-22 11:23:13,901 INFO L226 Difference]: Without dead ends: 5007 [2020-12-22 11:23:13,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=214, Invalid=488, Unknown=0, NotChecked=0, Total=702 [2020-12-22 11:23:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5007 states. [2020-12-22 11:23:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5007 to 3641. [2020-12-22 11:23:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2020-12-22 11:23:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 11792 transitions. [2020-12-22 11:23:14,037 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 11792 transitions. Word has length 25 [2020-12-22 11:23:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:14,038 INFO L481 AbstractCegarLoop]: Abstraction has 3641 states and 11792 transitions. [2020-12-22 11:23:14,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:23:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 11792 transitions. [2020-12-22 11:23:14,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:14,048 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:14,048 INFO L422 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] [2020-12-22 11:23:14,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 11:23:14,048 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:14,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash -802072470, now seen corresponding path program 5 times [2020-12-22 11:23:14,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:14,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197749204] [2020-12-22 11:23:14,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:14,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197749204] [2020-12-22 11:23:14,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:14,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:23:14,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313258176] [2020-12-22 11:23:14,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 11:23:14,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:14,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 11:23:14,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-12-22 11:23:14,426 INFO L87 Difference]: Start difference. First operand 3641 states and 11792 transitions. Second operand 14 states. [2020-12-22 11:23:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:16,719 INFO L93 Difference]: Finished difference Result 4102 states and 13192 transitions. [2020-12-22 11:23:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 11:23:16,720 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-22 11:23:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:16,731 INFO L225 Difference]: With dead ends: 4102 [2020-12-22 11:23:16,731 INFO L226 Difference]: Without dead ends: 4027 [2020-12-22 11:23:16,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2020-12-22 11:23:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4027 states. [2020-12-22 11:23:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4027 to 3895. [2020-12-22 11:23:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3895 states. [2020-12-22 11:23:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 12596 transitions. [2020-12-22 11:23:16,863 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 12596 transitions. Word has length 25 [2020-12-22 11:23:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:16,863 INFO L481 AbstractCegarLoop]: Abstraction has 3895 states and 12596 transitions. [2020-12-22 11:23:16,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 11:23:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 12596 transitions. [2020-12-22 11:23:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:16,875 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:16,875 INFO L422 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] [2020-12-22 11:23:16,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 11:23:16,876 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:16,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:16,876 INFO L82 PathProgramCache]: Analyzing trace with hash 69289626, now seen corresponding path program 6 times [2020-12-22 11:23:16,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:16,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124575749] [2020-12-22 11:23:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:17,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124575749] [2020-12-22 11:23:17,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:17,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:23:17,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271139648] [2020-12-22 11:23:17,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:23:17,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:17,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:23:17,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:23:17,201 INFO L87 Difference]: Start difference. First operand 3895 states and 12596 transitions. Second operand 13 states. [2020-12-22 11:23:19,459 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-12-22 11:23:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:20,046 INFO L93 Difference]: Finished difference Result 4734 states and 15154 transitions. [2020-12-22 11:23:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-22 11:23:20,047 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:23:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:20,058 INFO L225 Difference]: With dead ends: 4734 [2020-12-22 11:23:20,058 INFO L226 Difference]: Without dead ends: 4645 [2020-12-22 11:23:20,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2020-12-22 11:23:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2020-12-22 11:23:20,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 3401. [2020-12-22 11:23:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2020-12-22 11:23:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 11032 transitions. [2020-12-22 11:23:20,198 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 11032 transitions. Word has length 25 [2020-12-22 11:23:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:20,199 INFO L481 AbstractCegarLoop]: Abstraction has 3401 states and 11032 transitions. [2020-12-22 11:23:20,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:23:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 11032 transitions. [2020-12-22 11:23:20,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:20,212 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:20,213 INFO L422 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] [2020-12-22 11:23:20,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 11:23:20,213 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:20,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:20,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1779182558, now seen corresponding path program 7 times [2020-12-22 11:23:20,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:20,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586260866] [2020-12-22 11:23:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:20,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586260866] [2020-12-22 11:23:20,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:20,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:23:20,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22680600] [2020-12-22 11:23:20,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 11:23:20,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:20,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 11:23:20,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-12-22 11:23:20,562 INFO L87 Difference]: Start difference. First operand 3401 states and 11032 transitions. Second operand 14 states. [2020-12-22 11:23:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:22,315 INFO L93 Difference]: Finished difference Result 3490 states and 11127 transitions. [2020-12-22 11:23:22,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 11:23:22,316 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-22 11:23:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:22,323 INFO L225 Difference]: With dead ends: 3490 [2020-12-22 11:23:22,323 INFO L226 Difference]: Without dead ends: 3415 [2020-12-22 11:23:22,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2020-12-22 11:23:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2020-12-22 11:23:22,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 3295. [2020-12-22 11:23:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3295 states. [2020-12-22 11:23:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 3295 states and 10569 transitions. [2020-12-22 11:23:22,470 INFO L78 Accepts]: Start accepts. Automaton has 3295 states and 10569 transitions. Word has length 25 [2020-12-22 11:23:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:22,470 INFO L481 AbstractCegarLoop]: Abstraction has 3295 states and 10569 transitions. [2020-12-22 11:23:22,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 11:23:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3295 states and 10569 transitions. [2020-12-22 11:23:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:22,477 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:22,477 INFO L422 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] [2020-12-22 11:23:22,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 11:23:22,478 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash -907820462, now seen corresponding path program 8 times [2020-12-22 11:23:22,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:22,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137921995] [2020-12-22 11:23:22,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:22,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137921995] [2020-12-22 11:23:22,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:22,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:23:22,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163491907] [2020-12-22 11:23:22,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:23:22,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:22,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:23:22,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:23:22,819 INFO L87 Difference]: Start difference. First operand 3295 states and 10569 transitions. Second operand 13 states. [2020-12-22 11:23:24,987 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-12-22 11:23:25,227 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-12-22 11:23:25,408 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2020-12-22 11:23:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:26,027 INFO L93 Difference]: Finished difference Result 4168 states and 13231 transitions. [2020-12-22 11:23:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-22 11:23:26,027 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:23:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:26,041 INFO L225 Difference]: With dead ends: 4168 [2020-12-22 11:23:26,041 INFO L226 Difference]: Without dead ends: 4079 [2020-12-22 11:23:26,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2020-12-22 11:23:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4079 states. [2020-12-22 11:23:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4079 to 3175. [2020-12-22 11:23:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3175 states. [2020-12-22 11:23:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 10189 transitions. [2020-12-22 11:23:26,132 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 10189 transitions. Word has length 25 [2020-12-22 11:23:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:26,132 INFO L481 AbstractCegarLoop]: Abstraction has 3175 states and 10189 transitions. [2020-12-22 11:23:26,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:23:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 10189 transitions. [2020-12-22 11:23:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:26,138 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:26,139 INFO L422 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] [2020-12-22 11:23:26,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 11:23:26,139 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:26,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:26,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1462145462, now seen corresponding path program 2 times [2020-12-22 11:23:26,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:26,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269126459] [2020-12-22 11:23:26,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:26,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269126459] [2020-12-22 11:23:26,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:26,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:23:26,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724132621] [2020-12-22 11:23:26,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 11:23:26,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:26,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 11:23:26,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-12-22 11:23:26,501 INFO L87 Difference]: Start difference. First operand 3175 states and 10189 transitions. Second operand 14 states. [2020-12-22 11:23:27,738 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2020-12-22 11:23:29,248 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-12-22 11:23:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:29,829 INFO L93 Difference]: Finished difference Result 4584 states and 14507 transitions. [2020-12-22 11:23:29,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-22 11:23:29,830 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-22 11:23:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:29,838 INFO L225 Difference]: With dead ends: 4584 [2020-12-22 11:23:29,838 INFO L226 Difference]: Without dead ends: 4495 [2020-12-22 11:23:29,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2020-12-22 11:23:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2020-12-22 11:23:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 3175. [2020-12-22 11:23:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3175 states. [2020-12-22 11:23:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 10189 transitions. [2020-12-22 11:23:29,934 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 10189 transitions. Word has length 25 [2020-12-22 11:23:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:29,934 INFO L481 AbstractCegarLoop]: Abstraction has 3175 states and 10189 transitions. [2020-12-22 11:23:29,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 11:23:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 10189 transitions. [2020-12-22 11:23:29,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:29,940 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:29,941 INFO L422 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] [2020-12-22 11:23:29,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 11:23:29,941 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:29,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:29,942 INFO L82 PathProgramCache]: Analyzing trace with hash -839111096, now seen corresponding path program 3 times [2020-12-22 11:23:29,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:29,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726575732] [2020-12-22 11:23:29,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:30,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726575732] [2020-12-22 11:23:30,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:30,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:23:30,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955028312] [2020-12-22 11:23:30,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 11:23:30,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:30,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 11:23:30,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-12-22 11:23:30,291 INFO L87 Difference]: Start difference. First operand 3175 states and 10189 transitions. Second operand 14 states. [2020-12-22 11:23:30,949 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2020-12-22 11:23:31,682 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2020-12-22 11:23:32,683 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-12-22 11:23:32,872 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-12-22 11:23:33,067 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2020-12-22 11:23:33,350 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2020-12-22 11:23:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:33,959 INFO L93 Difference]: Finished difference Result 4384 states and 13907 transitions. [2020-12-22 11:23:33,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-22 11:23:33,962 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-22 11:23:33,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:33,973 INFO L225 Difference]: With dead ends: 4384 [2020-12-22 11:23:33,973 INFO L226 Difference]: Without dead ends: 4295 [2020-12-22 11:23:33,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2020-12-22 11:23:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4295 states. [2020-12-22 11:23:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4295 to 3245. [2020-12-22 11:23:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3245 states. [2020-12-22 11:23:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 3245 states and 10469 transitions. [2020-12-22 11:23:34,113 INFO L78 Accepts]: Start accepts. Automaton has 3245 states and 10469 transitions. Word has length 25 [2020-12-22 11:23:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:34,114 INFO L481 AbstractCegarLoop]: Abstraction has 3245 states and 10469 transitions. [2020-12-22 11:23:34,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 11:23:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3245 states and 10469 transitions. [2020-12-22 11:23:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:34,128 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:34,128 INFO L422 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] [2020-12-22 11:23:34,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 11:23:34,129 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:34,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1696407784, now seen corresponding path program 4 times [2020-12-22 11:23:34,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:34,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927499024] [2020-12-22 11:23:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:34,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927499024] [2020-12-22 11:23:34,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:34,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:23:34,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268029981] [2020-12-22 11:23:34,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:23:34,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:34,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:23:34,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:23:34,695 INFO L87 Difference]: Start difference. First operand 3245 states and 10469 transitions. Second operand 15 states. [2020-12-22 11:23:36,166 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2020-12-22 11:23:36,390 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2020-12-22 11:23:38,058 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-12-22 11:23:38,224 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2020-12-22 11:23:38,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:38,956 INFO L93 Difference]: Finished difference Result 4244 states and 13342 transitions. [2020-12-22 11:23:38,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-22 11:23:38,956 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2020-12-22 11:23:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:38,964 INFO L225 Difference]: With dead ends: 4244 [2020-12-22 11:23:38,964 INFO L226 Difference]: Without dead ends: 4155 [2020-12-22 11:23:38,964 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=338, Invalid=852, Unknown=0, NotChecked=0, Total=1190 [2020-12-22 11:23:38,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2020-12-22 11:23:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 3199. [2020-12-22 11:23:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3199 states. [2020-12-22 11:23:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 3199 states and 10176 transitions. [2020-12-22 11:23:39,050 INFO L78 Accepts]: Start accepts. Automaton has 3199 states and 10176 transitions. Word has length 25 [2020-12-22 11:23:39,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:39,050 INFO L481 AbstractCegarLoop]: Abstraction has 3199 states and 10176 transitions. [2020-12-22 11:23:39,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:23:39,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 10176 transitions. [2020-12-22 11:23:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:39,058 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:39,058 INFO L422 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] [2020-12-22 11:23:39,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 11:23:39,058 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:39,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:39,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2038283772, now seen corresponding path program 5 times [2020-12-22 11:23:39,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:39,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743055519] [2020-12-22 11:23:39,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:39,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743055519] [2020-12-22 11:23:39,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:39,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:23:39,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231727027] [2020-12-22 11:23:39,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 11:23:39,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:39,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 11:23:39,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-12-22 11:23:39,381 INFO L87 Difference]: Start difference. First operand 3199 states and 10176 transitions. Second operand 14 states. [2020-12-22 11:23:41,176 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-12-22 11:23:41,374 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2020-12-22 11:23:41,651 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2020-12-22 11:23:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:42,262 INFO L93 Difference]: Finished difference Result 4048 states and 12704 transitions. [2020-12-22 11:23:42,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-22 11:23:42,263 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-22 11:23:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:42,270 INFO L225 Difference]: With dead ends: 4048 [2020-12-22 11:23:42,270 INFO L226 Difference]: Without dead ends: 3959 [2020-12-22 11:23:42,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2020-12-22 11:23:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3959 states. [2020-12-22 11:23:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3959 to 2769. [2020-12-22 11:23:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2769 states. [2020-12-22 11:23:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2769 states to 2769 states and 8836 transitions. [2020-12-22 11:23:42,344 INFO L78 Accepts]: Start accepts. Automaton has 2769 states and 8836 transitions. Word has length 25 [2020-12-22 11:23:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:42,344 INFO L481 AbstractCegarLoop]: Abstraction has 2769 states and 8836 transitions. [2020-12-22 11:23:42,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 11:23:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 8836 transitions. [2020-12-22 11:23:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:23:42,350 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:42,350 INFO L422 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] [2020-12-22 11:23:42,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 11:23:42,351 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:42,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:42,351 INFO L82 PathProgramCache]: Analyzing trace with hash -144703769, now seen corresponding path program 1 times [2020-12-22 11:23:42,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:42,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714361734] [2020-12-22 11:23:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:42,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714361734] [2020-12-22 11:23:42,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:42,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:23:42,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834549768] [2020-12-22 11:23:42,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:23:42,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:42,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:23:42,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:23:42,975 INFO L87 Difference]: Start difference. First operand 2769 states and 8836 transitions. Second operand 15 states. [2020-12-22 11:23:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:45,558 INFO L93 Difference]: Finished difference Result 4789 states and 15539 transitions. [2020-12-22 11:23:45,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:23:45,559 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:23:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:45,570 INFO L225 Difference]: With dead ends: 4789 [2020-12-22 11:23:45,570 INFO L226 Difference]: Without dead ends: 4789 [2020-12-22 11:23:45,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:23:45,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2020-12-22 11:23:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 3949. [2020-12-22 11:23:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3949 states. [2020-12-22 11:23:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 12664 transitions. [2020-12-22 11:23:45,672 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 12664 transitions. Word has length 27 [2020-12-22 11:23:45,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:45,672 INFO L481 AbstractCegarLoop]: Abstraction has 3949 states and 12664 transitions. [2020-12-22 11:23:45,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:23:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 12664 transitions. [2020-12-22 11:23:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:23:45,680 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:45,680 INFO L422 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] [2020-12-22 11:23:45,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 11:23:45,680 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:45,681 INFO L82 PathProgramCache]: Analyzing trace with hash -144703768, now seen corresponding path program 1 times [2020-12-22 11:23:45,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:45,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102688116] [2020-12-22 11:23:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:46,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102688116] [2020-12-22 11:23:46,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:46,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:23:46,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914593521] [2020-12-22 11:23:46,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:23:46,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:46,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:23:46,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:23:46,329 INFO L87 Difference]: Start difference. First operand 3949 states and 12664 transitions. Second operand 15 states. [2020-12-22 11:23:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:48,642 INFO L93 Difference]: Finished difference Result 4789 states and 15419 transitions. [2020-12-22 11:23:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:23:48,643 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:23:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:48,656 INFO L225 Difference]: With dead ends: 4789 [2020-12-22 11:23:48,656 INFO L226 Difference]: Without dead ends: 4789 [2020-12-22 11:23:48,656 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:23:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2020-12-22 11:23:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 3949. [2020-12-22 11:23:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3949 states. [2020-12-22 11:23:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 12589 transitions. [2020-12-22 11:23:48,771 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 12589 transitions. Word has length 27 [2020-12-22 11:23:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:48,772 INFO L481 AbstractCegarLoop]: Abstraction has 3949 states and 12589 transitions. [2020-12-22 11:23:48,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:23:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 12589 transitions. [2020-12-22 11:23:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:23:48,779 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:48,780 INFO L422 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] [2020-12-22 11:23:48,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 11:23:48,780 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:48,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1191722114, now seen corresponding path program 1 times [2020-12-22 11:23:48,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:48,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293214688] [2020-12-22 11:23:48,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:49,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293214688] [2020-12-22 11:23:49,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:49,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:23:49,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252821477] [2020-12-22 11:23:49,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 11:23:49,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:49,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 11:23:49,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-22 11:23:49,353 INFO L87 Difference]: Start difference. First operand 3949 states and 12589 transitions. Second operand 16 states. [2020-12-22 11:23:50,376 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-22 11:23:50,646 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2020-12-22 11:23:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:52,510 INFO L93 Difference]: Finished difference Result 6639 states and 21302 transitions. [2020-12-22 11:23:52,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:23:52,511 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-22 11:23:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:52,565 INFO L225 Difference]: With dead ends: 6639 [2020-12-22 11:23:52,565 INFO L226 Difference]: Without dead ends: 6639 [2020-12-22 11:23:52,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2020-12-22 11:23:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6639 states. [2020-12-22 11:23:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6639 to 5439. [2020-12-22 11:23:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5439 states. [2020-12-22 11:23:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 17347 transitions. [2020-12-22 11:23:52,701 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 17347 transitions. Word has length 27 [2020-12-22 11:23:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:52,701 INFO L481 AbstractCegarLoop]: Abstraction has 5439 states and 17347 transitions. [2020-12-22 11:23:52,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 11:23:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 17347 transitions. [2020-12-22 11:23:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:23:52,714 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:52,714 INFO L422 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] [2020-12-22 11:23:52,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-22 11:23:52,715 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:52,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1191722115, now seen corresponding path program 1 times [2020-12-22 11:23:52,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:52,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922745283] [2020-12-22 11:23:52,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:53,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922745283] [2020-12-22 11:23:53,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:53,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:23:53,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188913537] [2020-12-22 11:23:53,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 11:23:53,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:53,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 11:23:53,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-22 11:23:53,273 INFO L87 Difference]: Start difference. First operand 5439 states and 17347 transitions. Second operand 16 states. [2020-12-22 11:23:53,992 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2020-12-22 11:23:54,350 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-22 11:23:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:56,520 INFO L93 Difference]: Finished difference Result 6639 states and 21182 transitions. [2020-12-22 11:23:56,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:23:56,521 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-22 11:23:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:56,533 INFO L225 Difference]: With dead ends: 6639 [2020-12-22 11:23:56,533 INFO L226 Difference]: Without dead ends: 6639 [2020-12-22 11:23:56,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2020-12-22 11:23:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6639 states. [2020-12-22 11:23:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6639 to 4837. [2020-12-22 11:23:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4837 states. [2020-12-22 11:23:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4837 states to 4837 states and 15293 transitions. [2020-12-22 11:23:56,658 INFO L78 Accepts]: Start accepts. Automaton has 4837 states and 15293 transitions. Word has length 27 [2020-12-22 11:23:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:56,659 INFO L481 AbstractCegarLoop]: Abstraction has 4837 states and 15293 transitions. [2020-12-22 11:23:56,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 11:23:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4837 states and 15293 transitions. [2020-12-22 11:23:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:23:56,670 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:56,670 INFO L422 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] [2020-12-22 11:23:56,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-22 11:23:56,671 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:56,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2125970475, now seen corresponding path program 2 times [2020-12-22 11:23:56,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:56,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316228309] [2020-12-22 11:23:56,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:57,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316228309] [2020-12-22 11:23:57,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:57,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:23:57,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964580187] [2020-12-22 11:23:57,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:23:57,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:57,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:23:57,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:23:57,261 INFO L87 Difference]: Start difference. First operand 4837 states and 15293 transitions. Second operand 15 states. [2020-12-22 11:24:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:00,011 INFO L93 Difference]: Finished difference Result 6871 states and 22038 transitions. [2020-12-22 11:24:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:24:00,012 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:24:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:00,025 INFO L225 Difference]: With dead ends: 6871 [2020-12-22 11:24:00,025 INFO L226 Difference]: Without dead ends: 6871 [2020-12-22 11:24:00,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:24:00,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6871 states. [2020-12-22 11:24:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6871 to 6031. [2020-12-22 11:24:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6031 states. [2020-12-22 11:24:00,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6031 states to 6031 states and 19163 transitions. [2020-12-22 11:24:00,136 INFO L78 Accepts]: Start accepts. Automaton has 6031 states and 19163 transitions. Word has length 27 [2020-12-22 11:24:00,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:00,136 INFO L481 AbstractCegarLoop]: Abstraction has 6031 states and 19163 transitions. [2020-12-22 11:24:00,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:24:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6031 states and 19163 transitions. [2020-12-22 11:24:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:00,149 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:00,149 INFO L422 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] [2020-12-22 11:24:00,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-22 11:24:00,149 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:00,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2125970476, now seen corresponding path program 2 times [2020-12-22 11:24:00,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:00,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100670968] [2020-12-22 11:24:00,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:00,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100670968] [2020-12-22 11:24:00,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:00,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:24:00,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677676806] [2020-12-22 11:24:00,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:24:00,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:00,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:24:00,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:24:00,806 INFO L87 Difference]: Start difference. First operand 6031 states and 19163 transitions. Second operand 15 states. [2020-12-22 11:24:01,361 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-12-22 11:24:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:03,780 INFO L93 Difference]: Finished difference Result 6871 states and 21918 transitions. [2020-12-22 11:24:03,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:24:03,781 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:24:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:03,794 INFO L225 Difference]: With dead ends: 6871 [2020-12-22 11:24:03,794 INFO L226 Difference]: Without dead ends: 6871 [2020-12-22 11:24:03,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:24:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6871 states. [2020-12-22 11:24:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6871 to 4601. [2020-12-22 11:24:03,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4601 states. [2020-12-22 11:24:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 14585 transitions. [2020-12-22 11:24:03,881 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 14585 transitions. Word has length 27 [2020-12-22 11:24:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:03,882 INFO L481 AbstractCegarLoop]: Abstraction has 4601 states and 14585 transitions. [2020-12-22 11:24:03,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:24:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 14585 transitions. [2020-12-22 11:24:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:03,892 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:03,892 INFO L422 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] [2020-12-22 11:24:03,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-22 11:24:03,892 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:03,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:03,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1507340137, now seen corresponding path program 3 times [2020-12-22 11:24:03,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:03,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403370452] [2020-12-22 11:24:03,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:04,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403370452] [2020-12-22 11:24:04,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:04,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:24:04,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95296499] [2020-12-22 11:24:04,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:24:04,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:04,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:24:04,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:24:04,547 INFO L87 Difference]: Start difference. First operand 4601 states and 14585 transitions. Second operand 15 states. [2020-12-22 11:24:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:07,350 INFO L93 Difference]: Finished difference Result 6631 states and 21318 transitions. [2020-12-22 11:24:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:24:07,351 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:24:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:07,363 INFO L225 Difference]: With dead ends: 6631 [2020-12-22 11:24:07,363 INFO L226 Difference]: Without dead ends: 6631 [2020-12-22 11:24:07,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:24:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6631 states. [2020-12-22 11:24:07,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6631 to 5551. [2020-12-22 11:24:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5551 states. [2020-12-22 11:24:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5551 states to 5551 states and 17723 transitions. [2020-12-22 11:24:07,471 INFO L78 Accepts]: Start accepts. Automaton has 5551 states and 17723 transitions. Word has length 27 [2020-12-22 11:24:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:07,472 INFO L481 AbstractCegarLoop]: Abstraction has 5551 states and 17723 transitions. [2020-12-22 11:24:07,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:24:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5551 states and 17723 transitions. [2020-12-22 11:24:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:07,479 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:07,479 INFO L422 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] [2020-12-22 11:24:07,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-22 11:24:07,479 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:07,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:07,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1507340138, now seen corresponding path program 3 times [2020-12-22 11:24:07,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:07,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638382075] [2020-12-22 11:24:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:08,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638382075] [2020-12-22 11:24:08,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:08,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:24:08,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860223953] [2020-12-22 11:24:08,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:24:08,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:08,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:24:08,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:24:08,247 INFO L87 Difference]: Start difference. First operand 5551 states and 17723 transitions. Second operand 15 states. [2020-12-22 11:24:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:11,066 INFO L93 Difference]: Finished difference Result 6631 states and 21198 transitions. [2020-12-22 11:24:11,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:24:11,067 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:24:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:11,082 INFO L225 Difference]: With dead ends: 6631 [2020-12-22 11:24:11,082 INFO L226 Difference]: Without dead ends: 6631 [2020-12-22 11:24:11,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:24:11,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6631 states. [2020-12-22 11:24:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6631 to 4241. [2020-12-22 11:24:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4241 states. [2020-12-22 11:24:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4241 states to 4241 states and 13505 transitions. [2020-12-22 11:24:11,167 INFO L78 Accepts]: Start accepts. Automaton has 4241 states and 13505 transitions. Word has length 27 [2020-12-22 11:24:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:11,167 INFO L481 AbstractCegarLoop]: Abstraction has 4241 states and 13505 transitions. [2020-12-22 11:24:11,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:24:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4241 states and 13505 transitions. [2020-12-22 11:24:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:11,175 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:11,175 INFO L422 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] [2020-12-22 11:24:11,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-22 11:24:11,175 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:11,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1192583903, now seen corresponding path program 4 times [2020-12-22 11:24:11,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:11,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201126861] [2020-12-22 11:24:11,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:11,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201126861] [2020-12-22 11:24:11,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:11,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:24:11,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547716897] [2020-12-22 11:24:11,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:24:11,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:11,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:24:11,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:24:11,954 INFO L87 Difference]: Start difference. First operand 4241 states and 13505 transitions. Second operand 15 states. [2020-12-22 11:24:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:14,980 INFO L93 Difference]: Finished difference Result 5911 states and 19158 transitions. [2020-12-22 11:24:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:24:14,980 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:24:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:14,992 INFO L225 Difference]: With dead ends: 5911 [2020-12-22 11:24:14,992 INFO L226 Difference]: Without dead ends: 5911 [2020-12-22 11:24:14,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:24:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5911 states. [2020-12-22 11:24:15,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5911 to 5071. [2020-12-22 11:24:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5071 states. [2020-12-22 11:24:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 16283 transitions. [2020-12-22 11:24:15,086 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 16283 transitions. Word has length 27 [2020-12-22 11:24:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:15,087 INFO L481 AbstractCegarLoop]: Abstraction has 5071 states and 16283 transitions. [2020-12-22 11:24:15,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:24:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 16283 transitions. [2020-12-22 11:24:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:15,093 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:15,093 INFO L422 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] [2020-12-22 11:24:15,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-22 11:24:15,093 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:15,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:15,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1192583902, now seen corresponding path program 4 times [2020-12-22 11:24:15,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:15,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774045262] [2020-12-22 11:24:15,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:15,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774045262] [2020-12-22 11:24:15,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:15,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:24:15,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342013945] [2020-12-22 11:24:15,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:24:15,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:15,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:24:15,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:24:15,907 INFO L87 Difference]: Start difference. First operand 5071 states and 16283 transitions. Second operand 15 states. [2020-12-22 11:24:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:18,881 INFO L93 Difference]: Finished difference Result 5911 states and 19038 transitions. [2020-12-22 11:24:18,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:24:18,886 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:24:18,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:18,897 INFO L225 Difference]: With dead ends: 5911 [2020-12-22 11:24:18,897 INFO L226 Difference]: Without dead ends: 5911 [2020-12-22 11:24:18,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:24:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5911 states. [2020-12-22 11:24:18,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5911 to 4121. [2020-12-22 11:24:18,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2020-12-22 11:24:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 13145 transitions. [2020-12-22 11:24:18,973 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 13145 transitions. Word has length 27 [2020-12-22 11:24:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:18,973 INFO L481 AbstractCegarLoop]: Abstraction has 4121 states and 13145 transitions. [2020-12-22 11:24:18,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:24:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 13145 transitions. [2020-12-22 11:24:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:18,978 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:18,978 INFO L422 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] [2020-12-22 11:24:18,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-22 11:24:18,978 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:18,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1121877513, now seen corresponding path program 5 times [2020-12-22 11:24:18,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:18,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638566871] [2020-12-22 11:24:18,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:19,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638566871] [2020-12-22 11:24:19,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:19,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:24:19,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688851253] [2020-12-22 11:24:19,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:24:19,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:19,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:24:19,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:24:19,608 INFO L87 Difference]: Start difference. First operand 4121 states and 13145 transitions. Second operand 15 states. [2020-12-22 11:24:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:22,768 INFO L93 Difference]: Finished difference Result 5651 states and 18358 transitions. [2020-12-22 11:24:22,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:24:22,769 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:24:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:22,780 INFO L225 Difference]: With dead ends: 5651 [2020-12-22 11:24:22,780 INFO L226 Difference]: Without dead ends: 5651 [2020-12-22 11:24:22,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:24:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2020-12-22 11:24:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 4811. [2020-12-22 11:24:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4811 states. [2020-12-22 11:24:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4811 states to 4811 states and 15483 transitions. [2020-12-22 11:24:22,876 INFO L78 Accepts]: Start accepts. Automaton has 4811 states and 15483 transitions. Word has length 27 [2020-12-22 11:24:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:22,877 INFO L481 AbstractCegarLoop]: Abstraction has 4811 states and 15483 transitions. [2020-12-22 11:24:22,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:24:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4811 states and 15483 transitions. [2020-12-22 11:24:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:22,883 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:22,883 INFO L422 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] [2020-12-22 11:24:22,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-22 11:24:22,884 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:22,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:22,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1121877514, now seen corresponding path program 5 times [2020-12-22 11:24:22,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:22,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704769741] [2020-12-22 11:24:22,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:23,368 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 21 [2020-12-22 11:24:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:23,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704769741] [2020-12-22 11:24:23,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:23,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:24:23,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660462687] [2020-12-22 11:24:23,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:24:23,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:23,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:24:23,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:24:23,689 INFO L87 Difference]: Start difference. First operand 4811 states and 15483 transitions. Second operand 15 states. [2020-12-22 11:24:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:26,897 INFO L93 Difference]: Finished difference Result 5651 states and 18238 transitions. [2020-12-22 11:24:26,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:24:26,900 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:24:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:26,911 INFO L225 Difference]: With dead ends: 5651 [2020-12-22 11:24:26,911 INFO L226 Difference]: Without dead ends: 5651 [2020-12-22 11:24:26,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:24:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2020-12-22 11:24:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 3981. [2020-12-22 11:24:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3981 states. [2020-12-22 11:24:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 12705 transitions. [2020-12-22 11:24:26,998 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 12705 transitions. Word has length 27 [2020-12-22 11:24:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:26,999 INFO L481 AbstractCegarLoop]: Abstraction has 3981 states and 12705 transitions. [2020-12-22 11:24:26,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:24:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 12705 transitions. [2020-12-22 11:24:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:27,005 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:27,005 INFO L422 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] [2020-12-22 11:24:27,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-22 11:24:27,005 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash -948485079, now seen corresponding path program 6 times [2020-12-22 11:24:27,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:27,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469669966] [2020-12-22 11:24:27,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:27,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469669966] [2020-12-22 11:24:27,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:27,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:24:27,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216253373] [2020-12-22 11:24:27,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:24:27,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:27,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:24:27,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:24:27,639 INFO L87 Difference]: Start difference. First operand 3981 states and 12705 transitions. Second operand 15 states. [2020-12-22 11:24:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:30,771 INFO L93 Difference]: Finished difference Result 7034 states and 22897 transitions. [2020-12-22 11:24:30,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:24:30,772 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:24:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:30,786 INFO L225 Difference]: With dead ends: 7034 [2020-12-22 11:24:30,786 INFO L226 Difference]: Without dead ends: 7034 [2020-12-22 11:24:30,787 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2020-12-22 11:24:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7034 states. [2020-12-22 11:24:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7034 to 4716. [2020-12-22 11:24:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2020-12-22 11:24:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 15188 transitions. [2020-12-22 11:24:30,890 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 15188 transitions. Word has length 27 [2020-12-22 11:24:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:30,890 INFO L481 AbstractCegarLoop]: Abstraction has 4716 states and 15188 transitions. [2020-12-22 11:24:30,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:24:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 15188 transitions. [2020-12-22 11:24:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:30,896 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:30,896 INFO L422 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] [2020-12-22 11:24:30,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-22 11:24:30,896 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:30,897 INFO L82 PathProgramCache]: Analyzing trace with hash -948485078, now seen corresponding path program 6 times [2020-12-22 11:24:30,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:30,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722920809] [2020-12-22 11:24:30,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:31,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722920809] [2020-12-22 11:24:31,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:31,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:24:31,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297370991] [2020-12-22 11:24:31,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:24:31,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:31,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:24:31,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:24:31,478 INFO L87 Difference]: Start difference. First operand 4716 states and 15188 transitions. Second operand 15 states. [2020-12-22 11:24:34,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:34,975 INFO L93 Difference]: Finished difference Result 7034 states and 22777 transitions. [2020-12-22 11:24:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:24:34,977 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:24:34,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:34,991 INFO L225 Difference]: With dead ends: 7034 [2020-12-22 11:24:34,991 INFO L226 Difference]: Without dead ends: 7034 [2020-12-22 11:24:34,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2020-12-22 11:24:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7034 states. [2020-12-22 11:24:35,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7034 to 4026. [2020-12-22 11:24:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4026 states. [2020-12-22 11:24:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4026 states to 4026 states and 12850 transitions. [2020-12-22 11:24:35,078 INFO L78 Accepts]: Start accepts. Automaton has 4026 states and 12850 transitions. Word has length 27 [2020-12-22 11:24:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:35,078 INFO L481 AbstractCegarLoop]: Abstraction has 4026 states and 12850 transitions. [2020-12-22 11:24:35,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:24:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4026 states and 12850 transitions. [2020-12-22 11:24:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:35,082 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:35,082 INFO L422 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] [2020-12-22 11:24:35,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-22 11:24:35,082 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:35,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:35,083 INFO L82 PathProgramCache]: Analyzing trace with hash 778825004, now seen corresponding path program 2 times [2020-12-22 11:24:35,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:35,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186692298] [2020-12-22 11:24:35,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:35,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186692298] [2020-12-22 11:24:35,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:35,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:24:35,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296688061] [2020-12-22 11:24:35,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 11:24:35,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:35,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 11:24:35,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-22 11:24:35,741 INFO L87 Difference]: Start difference. First operand 4026 states and 12850 transitions. Second operand 16 states. [2020-12-22 11:24:36,388 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2020-12-22 11:24:36,626 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2020-12-22 11:24:37,044 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-22 11:24:37,368 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2020-12-22 11:24:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:39,821 INFO L93 Difference]: Finished difference Result 6170 states and 19925 transitions. [2020-12-22 11:24:39,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:24:39,822 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-22 11:24:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:39,835 INFO L225 Difference]: With dead ends: 6170 [2020-12-22 11:24:39,835 INFO L226 Difference]: Without dead ends: 6170 [2020-12-22 11:24:39,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2020-12-22 11:24:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states. [2020-12-22 11:24:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6170 to 5090. [2020-12-22 11:24:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5090 states. [2020-12-22 11:24:39,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5090 states to 5090 states and 16330 transitions. [2020-12-22 11:24:39,930 INFO L78 Accepts]: Start accepts. Automaton has 5090 states and 16330 transitions. Word has length 27 [2020-12-22 11:24:39,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:39,931 INFO L481 AbstractCegarLoop]: Abstraction has 5090 states and 16330 transitions. [2020-12-22 11:24:39,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 11:24:39,931 INFO L276 IsEmpty]: Start isEmpty. Operand 5090 states and 16330 transitions. [2020-12-22 11:24:39,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:39,938 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:39,938 INFO L422 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] [2020-12-22 11:24:39,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-22 11:24:39,938 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:39,939 INFO L82 PathProgramCache]: Analyzing trace with hash 778825005, now seen corresponding path program 2 times [2020-12-22 11:24:39,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:39,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310417] [2020-12-22 11:24:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:40,383 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2020-12-22 11:24:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:40,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310417] [2020-12-22 11:24:40,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:40,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:24:40,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422033998] [2020-12-22 11:24:40,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 11:24:40,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:40,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 11:24:40,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-22 11:24:40,607 INFO L87 Difference]: Start difference. First operand 5090 states and 16330 transitions. Second operand 16 states. [2020-12-22 11:24:41,251 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2020-12-22 11:24:41,485 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2020-12-22 11:24:41,894 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-22 11:24:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:44,618 INFO L93 Difference]: Finished difference Result 6170 states and 19805 transitions. [2020-12-22 11:24:44,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:24:44,619 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-22 11:24:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:44,632 INFO L225 Difference]: With dead ends: 6170 [2020-12-22 11:24:44,632 INFO L226 Difference]: Without dead ends: 6170 [2020-12-22 11:24:44,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2020-12-22 11:24:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states. [2020-12-22 11:24:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6170 to 3960. [2020-12-22 11:24:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2020-12-22 11:24:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 12652 transitions. [2020-12-22 11:24:44,770 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 12652 transitions. Word has length 27 [2020-12-22 11:24:44,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:44,771 INFO L481 AbstractCegarLoop]: Abstraction has 3960 states and 12652 transitions. [2020-12-22 11:24:44,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 11:24:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 12652 transitions. [2020-12-22 11:24:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:44,776 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:44,776 INFO L422 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] [2020-12-22 11:24:44,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-22 11:24:44,777 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:44,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:44,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1179430206, now seen corresponding path program 3 times [2020-12-22 11:24:44,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:44,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484382360] [2020-12-22 11:24:44,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:45,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484382360] [2020-12-22 11:24:45,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:45,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:24:45,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375857261] [2020-12-22 11:24:45,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 11:24:45,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:45,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 11:24:45,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-22 11:24:45,546 INFO L87 Difference]: Start difference. First operand 3960 states and 12652 transitions. Second operand 16 states. [2020-12-22 11:24:46,222 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-12-22 11:24:46,486 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2020-12-22 11:24:46,894 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2020-12-22 11:24:47,241 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-12-22 11:24:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:49,784 INFO L93 Difference]: Finished difference Result 6050 states and 19445 transitions. [2020-12-22 11:24:49,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:24:49,785 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-22 11:24:49,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:49,795 INFO L225 Difference]: With dead ends: 6050 [2020-12-22 11:24:49,795 INFO L226 Difference]: Without dead ends: 6050 [2020-12-22 11:24:49,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2020-12-22 11:24:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-12-22 11:24:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3960. [2020-12-22 11:24:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2020-12-22 11:24:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 12652 transitions. [2020-12-22 11:24:49,865 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 12652 transitions. Word has length 27 [2020-12-22 11:24:49,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:49,865 INFO L481 AbstractCegarLoop]: Abstraction has 3960 states and 12652 transitions. [2020-12-22 11:24:49,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 11:24:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 12652 transitions. [2020-12-22 11:24:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:49,869 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:49,869 INFO L422 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] [2020-12-22 11:24:49,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-22 11:24:49,869 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:49,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:49,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1728350242, now seen corresponding path program 4 times [2020-12-22 11:24:49,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:49,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710084419] [2020-12-22 11:24:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:50,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710084419] [2020-12-22 11:24:50,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:50,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:24:50,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268243300] [2020-12-22 11:24:50,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 11:24:50,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:50,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 11:24:50,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-22 11:24:50,529 INFO L87 Difference]: Start difference. First operand 3960 states and 12652 transitions. Second operand 16 states. [2020-12-22 11:24:51,721 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-22 11:24:52,018 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2020-12-22 11:24:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:54,315 INFO L93 Difference]: Finished difference Result 5690 states and 18485 transitions. [2020-12-22 11:24:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:24:54,317 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-22 11:24:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:54,328 INFO L225 Difference]: With dead ends: 5690 [2020-12-22 11:24:54,328 INFO L226 Difference]: Without dead ends: 5690 [2020-12-22 11:24:54,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2020-12-22 11:24:54,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2020-12-22 11:24:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 4850. [2020-12-22 11:24:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4850 states. [2020-12-22 11:24:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 15610 transitions. [2020-12-22 11:24:54,414 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 15610 transitions. Word has length 27 [2020-12-22 11:24:54,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:54,415 INFO L481 AbstractCegarLoop]: Abstraction has 4850 states and 15610 transitions. [2020-12-22 11:24:54,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 11:24:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 15610 transitions. [2020-12-22 11:24:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:54,424 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:54,424 INFO L422 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] [2020-12-22 11:24:54,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-22 11:24:54,424 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:54,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:54,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1728350241, now seen corresponding path program 3 times [2020-12-22 11:24:54,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:54,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765731601] [2020-12-22 11:24:54,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:55,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765731601] [2020-12-22 11:24:55,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:55,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:24:55,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273300333] [2020-12-22 11:24:55,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 11:24:55,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:55,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 11:24:55,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-22 11:24:55,202 INFO L87 Difference]: Start difference. First operand 4850 states and 15610 transitions. Second operand 16 states. [2020-12-22 11:24:55,865 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-12-22 11:24:56,203 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2020-12-22 11:24:56,484 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2020-12-22 11:24:56,817 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2020-12-22 11:24:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:59,155 INFO L93 Difference]: Finished difference Result 5690 states and 18365 transitions. [2020-12-22 11:24:59,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:24:59,156 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-22 11:24:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:59,167 INFO L225 Difference]: With dead ends: 5690 [2020-12-22 11:24:59,167 INFO L226 Difference]: Without dead ends: 5690 [2020-12-22 11:24:59,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2020-12-22 11:24:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2020-12-22 11:24:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 3960. [2020-12-22 11:24:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2020-12-22 11:24:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 12652 transitions. [2020-12-22 11:24:59,240 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 12652 transitions. Word has length 27 [2020-12-22 11:24:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:59,240 INFO L481 AbstractCegarLoop]: Abstraction has 3960 states and 12652 transitions. [2020-12-22 11:24:59,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 11:24:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 12652 transitions. [2020-12-22 11:24:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:59,244 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:59,244 INFO L422 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] [2020-12-22 11:24:59,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-22 11:24:59,245 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1445894704, now seen corresponding path program 5 times [2020-12-22 11:24:59,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:59,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880235084] [2020-12-22 11:24:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:59,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880235084] [2020-12-22 11:24:59,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:59,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:24:59,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834441204] [2020-12-22 11:24:59,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 11:24:59,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:59,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 11:24:59,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-22 11:24:59,871 INFO L87 Difference]: Start difference. First operand 3960 states and 12652 transitions. Second operand 16 states. [2020-12-22 11:25:00,760 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-12-22 11:25:01,025 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2020-12-22 11:25:01,318 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2020-12-22 11:25:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:03,720 INFO L93 Difference]: Finished difference Result 5630 states and 18305 transitions. [2020-12-22 11:25:03,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:25:03,721 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-22 11:25:03,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:03,731 INFO L225 Difference]: With dead ends: 5630 [2020-12-22 11:25:03,731 INFO L226 Difference]: Without dead ends: 5630 [2020-12-22 11:25:03,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2020-12-22 11:25:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2020-12-22 11:25:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4790. [2020-12-22 11:25:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4790 states. [2020-12-22 11:25:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 15430 transitions. [2020-12-22 11:25:03,843 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 15430 transitions. Word has length 27 [2020-12-22 11:25:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:03,843 INFO L481 AbstractCegarLoop]: Abstraction has 4790 states and 15430 transitions. [2020-12-22 11:25:03,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 11:25:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 15430 transitions. [2020-12-22 11:25:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:03,849 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:03,849 INFO L422 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] [2020-12-22 11:25:03,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-22 11:25:03,849 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:03,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1445894703, now seen corresponding path program 4 times [2020-12-22 11:25:03,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:03,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781590833] [2020-12-22 11:25:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:04,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781590833] [2020-12-22 11:25:04,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:04,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:25:04,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459776589] [2020-12-22 11:25:04,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 11:25:04,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:04,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 11:25:04,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-22 11:25:04,598 INFO L87 Difference]: Start difference. First operand 4790 states and 15430 transitions. Second operand 16 states. [2020-12-22 11:25:05,038 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2020-12-22 11:25:05,257 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-12-22 11:25:05,616 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2020-12-22 11:25:05,923 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2020-12-22 11:25:06,222 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2020-12-22 11:25:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:08,473 INFO L93 Difference]: Finished difference Result 5630 states and 18185 transitions. [2020-12-22 11:25:08,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:25:08,474 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-22 11:25:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:08,484 INFO L225 Difference]: With dead ends: 5630 [2020-12-22 11:25:08,485 INFO L226 Difference]: Without dead ends: 5630 [2020-12-22 11:25:08,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2020-12-22 11:25:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2020-12-22 11:25:08,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 3960. [2020-12-22 11:25:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2020-12-22 11:25:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 12652 transitions. [2020-12-22 11:25:08,554 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 12652 transitions. Word has length 27 [2020-12-22 11:25:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:08,555 INFO L481 AbstractCegarLoop]: Abstraction has 3960 states and 12652 transitions. [2020-12-22 11:25:08,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 11:25:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 12652 transitions. [2020-12-22 11:25:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:08,560 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:08,560 INFO L422 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] [2020-12-22 11:25:08,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-22 11:25:08,560 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:08,561 INFO L82 PathProgramCache]: Analyzing trace with hash -774061944, now seen corresponding path program 6 times [2020-12-22 11:25:08,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:08,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252989768] [2020-12-22 11:25:08,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:09,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252989768] [2020-12-22 11:25:09,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:09,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:25:09,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541524730] [2020-12-22 11:25:09,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 11:25:09,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:09,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 11:25:09,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-22 11:25:09,208 INFO L87 Difference]: Start difference. First operand 3960 states and 12652 transitions. Second operand 16 states. [2020-12-22 11:25:09,864 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2020-12-22 11:25:10,196 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-12-22 11:25:10,730 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-12-22 11:25:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:13,461 INFO L93 Difference]: Finished difference Result 7643 states and 25009 transitions. [2020-12-22 11:25:13,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-22 11:25:13,462 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-22 11:25:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:13,477 INFO L225 Difference]: With dead ends: 7643 [2020-12-22 11:25:13,478 INFO L226 Difference]: Without dead ends: 7643 [2020-12-22 11:25:13,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2020-12-22 11:25:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7643 states. [2020-12-22 11:25:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7643 to 4695. [2020-12-22 11:25:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4695 states. [2020-12-22 11:25:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 15135 transitions. [2020-12-22 11:25:13,577 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 15135 transitions. Word has length 27 [2020-12-22 11:25:13,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:13,577 INFO L481 AbstractCegarLoop]: Abstraction has 4695 states and 15135 transitions. [2020-12-22 11:25:13,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 11:25:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 15135 transitions. [2020-12-22 11:25:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:13,583 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:13,583 INFO L422 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] [2020-12-22 11:25:13,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-22 11:25:13,583 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:13,583 INFO L82 PathProgramCache]: Analyzing trace with hash -774061943, now seen corresponding path program 5 times [2020-12-22 11:25:13,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:13,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950272206] [2020-12-22 11:25:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:14,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950272206] [2020-12-22 11:25:14,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:14,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:25:14,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060652763] [2020-12-22 11:25:14,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 11:25:14,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:14,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 11:25:14,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-22 11:25:14,257 INFO L87 Difference]: Start difference. First operand 4695 states and 15135 transitions. Second operand 16 states. [2020-12-22 11:25:14,710 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2020-12-22 11:25:14,921 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-12-22 11:25:15,289 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2020-12-22 11:25:15,569 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2020-12-22 11:25:15,867 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-12-22 11:25:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:18,572 INFO L93 Difference]: Finished difference Result 7643 states and 24889 transitions. [2020-12-22 11:25:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-22 11:25:18,573 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-22 11:25:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:18,590 INFO L225 Difference]: With dead ends: 7643 [2020-12-22 11:25:18,590 INFO L226 Difference]: Without dead ends: 7643 [2020-12-22 11:25:18,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2020-12-22 11:25:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7643 states. [2020-12-22 11:25:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7643 to 3966. [2020-12-22 11:25:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3966 states. [2020-12-22 11:25:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 12671 transitions. [2020-12-22 11:25:18,680 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 12671 transitions. Word has length 27 [2020-12-22 11:25:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:18,680 INFO L481 AbstractCegarLoop]: Abstraction has 3966 states and 12671 transitions. [2020-12-22 11:25:18,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 11:25:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 12671 transitions. [2020-12-22 11:25:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:18,685 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:18,685 INFO L422 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] [2020-12-22 11:25:18,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-22 11:25:18,685 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:18,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:18,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1169258132, now seen corresponding path program 7 times [2020-12-22 11:25:18,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:18,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783512030] [2020-12-22 11:25:18,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:19,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783512030] [2020-12-22 11:25:19,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:19,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:25:19,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591566398] [2020-12-22 11:25:19,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 11:25:19,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:19,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 11:25:19,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-22 11:25:19,314 INFO L87 Difference]: Start difference. First operand 3966 states and 12671 transitions. Second operand 16 states. [2020-12-22 11:25:19,948 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2020-12-22 11:25:20,234 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2020-12-22 11:25:20,725 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2020-12-22 11:25:21,057 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2020-12-22 11:25:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:23,458 INFO L93 Difference]: Finished difference Result 5496 states and 17884 transitions. [2020-12-22 11:25:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:25:23,460 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-22 11:25:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:23,470 INFO L225 Difference]: With dead ends: 5496 [2020-12-22 11:25:23,470 INFO L226 Difference]: Without dead ends: 5496 [2020-12-22 11:25:23,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2020-12-22 11:25:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2020-12-22 11:25:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 4656. [2020-12-22 11:25:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4656 states. [2020-12-22 11:25:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4656 states to 4656 states and 15009 transitions. [2020-12-22 11:25:23,545 INFO L78 Accepts]: Start accepts. Automaton has 4656 states and 15009 transitions. Word has length 27 [2020-12-22 11:25:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:23,545 INFO L481 AbstractCegarLoop]: Abstraction has 4656 states and 15009 transitions. [2020-12-22 11:25:23,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 11:25:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4656 states and 15009 transitions. [2020-12-22 11:25:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:23,552 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:23,552 INFO L422 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] [2020-12-22 11:25:23,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-22 11:25:23,552 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:23,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1169258133, now seen corresponding path program 6 times [2020-12-22 11:25:23,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:23,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466010164] [2020-12-22 11:25:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:24,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466010164] [2020-12-22 11:25:24,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:24,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-22 11:25:24,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776117695] [2020-12-22 11:25:24,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 11:25:24,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:24,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 11:25:24,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-22 11:25:24,252 INFO L87 Difference]: Start difference. First operand 4656 states and 15009 transitions. Second operand 16 states. [2020-12-22 11:25:25,002 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2020-12-22 11:25:25,266 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2020-12-22 11:25:25,724 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2020-12-22 11:25:26,091 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2020-12-22 11:25:28,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:28,479 INFO L93 Difference]: Finished difference Result 5496 states and 17764 transitions. [2020-12-22 11:25:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:25:28,481 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-22 11:25:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:28,493 INFO L225 Difference]: With dead ends: 5496 [2020-12-22 11:25:28,493 INFO L226 Difference]: Without dead ends: 5496 [2020-12-22 11:25:28,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2020-12-22 11:25:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2020-12-22 11:25:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 3466. [2020-12-22 11:25:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3466 states. [2020-12-22 11:25:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 11151 transitions. [2020-12-22 11:25:28,559 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 11151 transitions. Word has length 27 [2020-12-22 11:25:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:28,559 INFO L481 AbstractCegarLoop]: Abstraction has 3466 states and 11151 transitions. [2020-12-22 11:25:28,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 11:25:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 11151 transitions. [2020-12-22 11:25:28,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-22 11:25:28,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:28,563 INFO L422 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] [2020-12-22 11:25:28,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-22 11:25:28,563 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:28,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:28,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1277136462, now seen corresponding path program 1 times [2020-12-22 11:25:28,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:28,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608747660] [2020-12-22 11:25:28,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:28,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608747660] [2020-12-22 11:25:28,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:28,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 11:25:28,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296692941] [2020-12-22 11:25:28,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 11:25:28,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:28,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 11:25:28,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-22 11:25:28,942 INFO L87 Difference]: Start difference. First operand 3466 states and 11151 transitions. Second operand 12 states. [2020-12-22 11:25:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:30,870 INFO L93 Difference]: Finished difference Result 10274 states and 33203 transitions. [2020-12-22 11:25:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 11:25:30,872 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-12-22 11:25:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:30,890 INFO L225 Difference]: With dead ends: 10274 [2020-12-22 11:25:30,890 INFO L226 Difference]: Without dead ends: 10274 [2020-12-22 11:25:30,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2020-12-22 11:25:30,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10274 states. [2020-12-22 11:25:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10274 to 7747. [2020-12-22 11:25:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7747 states. [2020-12-22 11:25:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7747 states to 7747 states and 25730 transitions. [2020-12-22 11:25:31,039 INFO L78 Accepts]: Start accepts. Automaton has 7747 states and 25730 transitions. Word has length 30 [2020-12-22 11:25:31,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:31,039 INFO L481 AbstractCegarLoop]: Abstraction has 7747 states and 25730 transitions. [2020-12-22 11:25:31,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 11:25:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 7747 states and 25730 transitions. [2020-12-22 11:25:31,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-22 11:25:31,049 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:31,049 INFO L422 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] [2020-12-22 11:25:31,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-22 11:25:31,050 INFO L429 AbstractCegarLoop]: === Iteration 44 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:31,050 INFO L82 PathProgramCache]: Analyzing trace with hash 393782995, now seen corresponding path program 1 times [2020-12-22 11:25:31,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:31,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637123359] [2020-12-22 11:25:31,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:31,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637123359] [2020-12-22 11:25:31,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:31,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 11:25:31,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503878533] [2020-12-22 11:25:31,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:25:31,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:31,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:25:31,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:25:31,463 INFO L87 Difference]: Start difference. First operand 7747 states and 25730 transitions. Second operand 13 states. [2020-12-22 11:25:33,103 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2020-12-22 11:25:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:34,421 INFO L93 Difference]: Finished difference Result 15340 states and 50453 transitions. [2020-12-22 11:25:34,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-22 11:25:34,423 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-12-22 11:25:34,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:34,451 INFO L225 Difference]: With dead ends: 15340 [2020-12-22 11:25:34,451 INFO L226 Difference]: Without dead ends: 15340 [2020-12-22 11:25:34,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2020-12-22 11:25:34,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15340 states. [2020-12-22 11:25:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15340 to 10253. [2020-12-22 11:25:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10253 states. [2020-12-22 11:25:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10253 states to 10253 states and 34150 transitions. [2020-12-22 11:25:34,660 INFO L78 Accepts]: Start accepts. Automaton has 10253 states and 34150 transitions. Word has length 30 [2020-12-22 11:25:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:34,660 INFO L481 AbstractCegarLoop]: Abstraction has 10253 states and 34150 transitions. [2020-12-22 11:25:34,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:25:34,660 INFO L276 IsEmpty]: Start isEmpty. Operand 10253 states and 34150 transitions. [2020-12-22 11:25:34,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-22 11:25:34,671 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:34,671 INFO L422 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] [2020-12-22 11:25:34,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-22 11:25:34,672 INFO L429 AbstractCegarLoop]: === Iteration 45 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:34,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:34,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1198627466, now seen corresponding path program 2 times [2020-12-22 11:25:34,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:34,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208790369] [2020-12-22 11:25:34,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:35,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208790369] [2020-12-22 11:25:35,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:35,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 11:25:35,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275616177] [2020-12-22 11:25:35,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 11:25:35,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:35,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 11:25:35,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-22 11:25:35,058 INFO L87 Difference]: Start difference. First operand 10253 states and 34150 transitions. Second operand 12 states. [2020-12-22 11:25:36,467 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2020-12-22 11:25:38,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:38,023 INFO L93 Difference]: Finished difference Result 19078 states and 63416 transitions. [2020-12-22 11:25:38,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-22 11:25:38,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-12-22 11:25:38,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:38,063 INFO L225 Difference]: With dead ends: 19078 [2020-12-22 11:25:38,063 INFO L226 Difference]: Without dead ends: 19078 [2020-12-22 11:25:38,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2020-12-22 11:25:38,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2020-12-22 11:25:38,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 10881. [2020-12-22 11:25:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10881 states. [2020-12-22 11:25:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10881 states to 10881 states and 36512 transitions. [2020-12-22 11:25:38,310 INFO L78 Accepts]: Start accepts. Automaton has 10881 states and 36512 transitions. Word has length 30 [2020-12-22 11:25:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:38,310 INFO L481 AbstractCegarLoop]: Abstraction has 10881 states and 36512 transitions. [2020-12-22 11:25:38,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 11:25:38,310 INFO L276 IsEmpty]: Start isEmpty. Operand 10881 states and 36512 transitions. [2020-12-22 11:25:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-22 11:25:38,323 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:38,324 INFO L422 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] [2020-12-22 11:25:38,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-22 11:25:38,324 INFO L429 AbstractCegarLoop]: === Iteration 46 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:38,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:38,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1286895244, now seen corresponding path program 3 times [2020-12-22 11:25:38,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:38,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237987871] [2020-12-22 11:25:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:38,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237987871] [2020-12-22 11:25:38,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:38,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 11:25:38,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204223950] [2020-12-22 11:25:38,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 11:25:38,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:38,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 11:25:38,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-12-22 11:25:38,727 INFO L87 Difference]: Start difference. First operand 10881 states and 36512 transitions. Second operand 12 states. [2020-12-22 11:25:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:41,892 INFO L93 Difference]: Finished difference Result 19831 states and 65965 transitions. [2020-12-22 11:25:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 11:25:41,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-12-22 11:25:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:41,931 INFO L225 Difference]: With dead ends: 19831 [2020-12-22 11:25:41,932 INFO L226 Difference]: Without dead ends: 19831 [2020-12-22 11:25:41,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2020-12-22 11:25:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19831 states. [2020-12-22 11:25:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19831 to 9729. [2020-12-22 11:25:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9729 states. [2020-12-22 11:25:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9729 states to 9729 states and 32472 transitions. [2020-12-22 11:25:42,163 INFO L78 Accepts]: Start accepts. Automaton has 9729 states and 32472 transitions. Word has length 30 [2020-12-22 11:25:42,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:42,164 INFO L481 AbstractCegarLoop]: Abstraction has 9729 states and 32472 transitions. [2020-12-22 11:25:42,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 11:25:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 9729 states and 32472 transitions. [2020-12-22 11:25:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-22 11:25:42,174 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:42,175 INFO L422 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] [2020-12-22 11:25:42,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-22 11:25:42,175 INFO L429 AbstractCegarLoop]: === Iteration 47 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:42,175 INFO L82 PathProgramCache]: Analyzing trace with hash 562314729, now seen corresponding path program 2 times [2020-12-22 11:25:42,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:42,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929889] [2020-12-22 11:25:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:42,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929889] [2020-12-22 11:25:42,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:42,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 11:25:42,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398406571] [2020-12-22 11:25:42,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:25:42,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:42,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:25:42,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:25:42,606 INFO L87 Difference]: Start difference. First operand 9729 states and 32472 transitions. Second operand 13 states. [2020-12-22 11:25:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:46,478 INFO L93 Difference]: Finished difference Result 16868 states and 55552 transitions. [2020-12-22 11:25:46,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-22 11:25:46,480 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-12-22 11:25:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:46,513 INFO L225 Difference]: With dead ends: 16868 [2020-12-22 11:25:46,514 INFO L226 Difference]: Without dead ends: 16868 [2020-12-22 11:25:46,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=275, Invalid=717, Unknown=0, NotChecked=0, Total=992 [2020-12-22 11:25:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16868 states. [2020-12-22 11:25:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16868 to 9849. [2020-12-22 11:25:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2020-12-22 11:25:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 32878 transitions. [2020-12-22 11:25:46,806 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 32878 transitions. Word has length 30 [2020-12-22 11:25:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:46,807 INFO L481 AbstractCegarLoop]: Abstraction has 9849 states and 32878 transitions. [2020-12-22 11:25:46,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:25:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 32878 transitions. [2020-12-22 11:25:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-22 11:25:46,817 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:46,817 INFO L422 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] [2020-12-22 11:25:46,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-22 11:25:46,817 INFO L429 AbstractCegarLoop]: === Iteration 48 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:46,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:46,817 INFO L82 PathProgramCache]: Analyzing trace with hash -722228073, now seen corresponding path program 3 times [2020-12-22 11:25:46,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:46,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100117938] [2020-12-22 11:25:46,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:47,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100117938] [2020-12-22 11:25:47,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:47,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 11:25:47,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004231241] [2020-12-22 11:25:47,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:25:47,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:47,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:25:47,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:25:47,225 INFO L87 Difference]: Start difference. First operand 9849 states and 32878 transitions. Second operand 13 states. [2020-12-22 11:25:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:51,140 INFO L93 Difference]: Finished difference Result 18703 states and 61851 transitions. [2020-12-22 11:25:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-22 11:25:51,141 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-12-22 11:25:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:51,177 INFO L225 Difference]: With dead ends: 18703 [2020-12-22 11:25:51,178 INFO L226 Difference]: Without dead ends: 18703 [2020-12-22 11:25:51,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=319, Invalid=871, Unknown=0, NotChecked=0, Total=1190 [2020-12-22 11:25:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18703 states. [2020-12-22 11:25:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18703 to 9953. [2020-12-22 11:25:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9953 states. [2020-12-22 11:25:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9953 states to 9953 states and 33250 transitions. [2020-12-22 11:25:51,399 INFO L78 Accepts]: Start accepts. Automaton has 9953 states and 33250 transitions. Word has length 30 [2020-12-22 11:25:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:51,399 INFO L481 AbstractCegarLoop]: Abstraction has 9953 states and 33250 transitions. [2020-12-22 11:25:51,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:25:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 9953 states and 33250 transitions. [2020-12-22 11:25:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-22 11:25:51,412 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:51,412 INFO L422 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] [2020-12-22 11:25:51,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-22 11:25:51,412 INFO L429 AbstractCegarLoop]: === Iteration 49 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:51,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:51,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1184193409, now seen corresponding path program 4 times [2020-12-22 11:25:51,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:51,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871375031] [2020-12-22 11:25:51,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:51,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871375031] [2020-12-22 11:25:51,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:51,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 11:25:51,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307701727] [2020-12-22 11:25:51,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:25:51,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:51,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:25:51,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:25:51,840 INFO L87 Difference]: Start difference. First operand 9953 states and 33250 transitions. Second operand 13 states. [2020-12-22 11:25:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:54,094 INFO L93 Difference]: Finished difference Result 13392 states and 44102 transitions. [2020-12-22 11:25:54,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 11:25:54,095 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-12-22 11:25:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:54,120 INFO L225 Difference]: With dead ends: 13392 [2020-12-22 11:25:54,120 INFO L226 Difference]: Without dead ends: 13392 [2020-12-22 11:25:54,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2020-12-22 11:25:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2020-12-22 11:25:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 9593. [2020-12-22 11:25:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9593 states. [2020-12-22 11:25:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9593 states to 9593 states and 32170 transitions. [2020-12-22 11:25:54,293 INFO L78 Accepts]: Start accepts. Automaton has 9593 states and 32170 transitions. Word has length 30 [2020-12-22 11:25:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:54,293 INFO L481 AbstractCegarLoop]: Abstraction has 9593 states and 32170 transitions. [2020-12-22 11:25:54,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:25:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 9593 states and 32170 transitions. [2020-12-22 11:25:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-22 11:25:54,305 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:54,306 INFO L422 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] [2020-12-22 11:25:54,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-22 11:25:54,306 INFO L429 AbstractCegarLoop]: === Iteration 50 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:54,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:54,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1639413206, now seen corresponding path program 4 times [2020-12-22 11:25:54,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:54,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689591865] [2020-12-22 11:25:54,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:54,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689591865] [2020-12-22 11:25:54,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:54,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 11:25:54,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158579108] [2020-12-22 11:25:54,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:25:54,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:54,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:25:54,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:25:54,840 INFO L87 Difference]: Start difference. First operand 9593 states and 32170 transitions. Second operand 13 states. [2020-12-22 11:25:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:57,290 INFO L93 Difference]: Finished difference Result 16478 states and 54491 transitions. [2020-12-22 11:25:57,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 11:25:57,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-12-22 11:25:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:57,328 INFO L225 Difference]: With dead ends: 16478 [2020-12-22 11:25:57,328 INFO L226 Difference]: Without dead ends: 16478 [2020-12-22 11:25:57,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:25:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16478 states. [2020-12-22 11:25:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16478 to 9309. [2020-12-22 11:25:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9309 states. [2020-12-22 11:25:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9309 states to 9309 states and 31271 transitions. [2020-12-22 11:25:57,578 INFO L78 Accepts]: Start accepts. Automaton has 9309 states and 31271 transitions. Word has length 30 [2020-12-22 11:25:57,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:57,579 INFO L481 AbstractCegarLoop]: Abstraction has 9309 states and 31271 transitions. [2020-12-22 11:25:57,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:25:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 9309 states and 31271 transitions. [2020-12-22 11:25:57,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-22 11:25:57,591 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:57,591 INFO L422 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] [2020-12-22 11:25:57,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-22 11:25:57,591 INFO L429 AbstractCegarLoop]: === Iteration 51 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:57,592 INFO L82 PathProgramCache]: Analyzing trace with hash 756059739, now seen corresponding path program 5 times [2020-12-22 11:25:57,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:57,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218175105] [2020-12-22 11:25:57,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:58,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218175105] [2020-12-22 11:25:58,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:58,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:25:58,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345521661] [2020-12-22 11:25:58,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 11:25:58,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:58,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 11:25:58,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-12-22 11:25:58,122 INFO L87 Difference]: Start difference. First operand 9309 states and 31271 transitions. Second operand 14 states. [2020-12-22 11:26:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:26:00,680 INFO L93 Difference]: Finished difference Result 14098 states and 46557 transitions. [2020-12-22 11:26:00,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 11:26:00,681 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2020-12-22 11:26:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:26:00,713 INFO L225 Difference]: With dead ends: 14098 [2020-12-22 11:26:00,713 INFO L226 Difference]: Without dead ends: 14098 [2020-12-22 11:26:00,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:26:00,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14098 states. [2020-12-22 11:26:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14098 to 8187. [2020-12-22 11:26:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8187 states. [2020-12-22 11:26:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8187 states to 8187 states and 27721 transitions. [2020-12-22 11:26:00,982 INFO L78 Accepts]: Start accepts. Automaton has 8187 states and 27721 transitions. Word has length 30 [2020-12-22 11:26:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:26:00,983 INFO L481 AbstractCegarLoop]: Abstraction has 8187 states and 27721 transitions. [2020-12-22 11:26:00,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 11:26:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8187 states and 27721 transitions. [2020-12-22 11:26:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-22 11:26:00,992 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:26:00,992 INFO L422 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] [2020-12-22 11:26:00,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-22 11:26:00,993 INFO L429 AbstractCegarLoop]: === Iteration 52 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:26:00,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:26:00,993 INFO L82 PathProgramCache]: Analyzing trace with hash -105840897, now seen corresponding path program 1 times [2020-12-22 11:26:00,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:26:00,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515118606] [2020-12-22 11:26:00,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:26:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:26:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:26:02,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515118606] [2020-12-22 11:26:02,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:26:02,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-22 11:26:02,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607365848] [2020-12-22 11:26:02,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-22 11:26:02,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:26:02,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-22 11:26:02,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2020-12-22 11:26:02,228 INFO L87 Difference]: Start difference. First operand 8187 states and 27721 transitions. Second operand 19 states. [2020-12-22 11:26:02,823 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2020-12-22 11:26:03,056 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-12-22 11:26:03,323 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2020-12-22 11:26:03,648 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-12-22 11:26:03,941 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2020-12-22 11:26:04,164 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2020-12-22 11:26:04,526 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2020-12-22 11:26:04,965 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2020-12-22 11:26:05,705 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2020-12-22 11:26:05,967 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2020-12-22 11:26:06,314 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2020-12-22 11:26:06,580 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2020-12-22 11:26:06,907 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2020-12-22 11:26:07,248 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2020-12-22 11:26:07,439 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-12-22 11:26:07,711 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-22 11:26:07,917 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2020-12-22 11:26:08,153 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2020-12-22 11:26:08,424 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2020-12-22 11:26:08,730 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2020-12-22 11:26:09,028 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2020-12-22 11:26:09,388 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2020-12-22 11:26:09,690 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2020-12-22 11:26:10,160 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2020-12-22 11:26:10,482 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2020-12-22 11:26:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:26:11,170 INFO L93 Difference]: Finished difference Result 9364 states and 31204 transitions. [2020-12-22 11:26:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-12-22 11:26:11,171 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-12-22 11:26:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:26:11,190 INFO L225 Difference]: With dead ends: 9364 [2020-12-22 11:26:11,190 INFO L226 Difference]: Without dead ends: 9297 [2020-12-22 11:26:11,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=666, Invalid=1590, Unknown=0, NotChecked=0, Total=2256 [2020-12-22 11:26:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9297 states. [2020-12-22 11:26:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9297 to 8341. [2020-12-22 11:26:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8341 states. [2020-12-22 11:26:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8341 states to 8341 states and 28183 transitions. [2020-12-22 11:26:11,326 INFO L78 Accepts]: Start accepts. Automaton has 8341 states and 28183 transitions. Word has length 31 [2020-12-22 11:26:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:26:11,326 INFO L481 AbstractCegarLoop]: Abstraction has 8341 states and 28183 transitions. [2020-12-22 11:26:11,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-22 11:26:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 8341 states and 28183 transitions. [2020-12-22 11:26:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-22 11:26:11,335 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:26:11,335 INFO L422 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] [2020-12-22 11:26:11,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-22 11:26:11,335 INFO L429 AbstractCegarLoop]: === Iteration 53 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:26:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:26:11,336 INFO L82 PathProgramCache]: Analyzing trace with hash 765521199, now seen corresponding path program 2 times [2020-12-22 11:26:11,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:26:11,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124761456] [2020-12-22 11:26:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:26:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:26:12,183 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 32 [2020-12-22 11:26:12,407 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 31 [2020-12-22 11:26:12,681 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2020-12-22 11:26:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:26:12,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124761456] [2020-12-22 11:26:12,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:26:12,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-22 11:26:12,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551892159] [2020-12-22 11:26:12,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-22 11:26:12,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:26:12,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-22 11:26:12,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2020-12-22 11:26:12,890 INFO L87 Difference]: Start difference. First operand 8341 states and 28183 transitions. Second operand 19 states. [2020-12-22 11:26:13,628 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2020-12-22 11:26:13,867 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2020-12-22 11:26:14,151 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2020-12-22 11:26:14,494 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2020-12-22 11:26:14,809 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-12-22 11:26:15,034 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2020-12-22 11:26:15,402 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2020-12-22 11:26:15,952 WARN L197 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2020-12-22 11:26:16,818 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2020-12-22 11:26:17,059 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2020-12-22 11:26:17,420 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2020-12-22 11:26:17,715 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2020-12-22 11:26:18,066 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2020-12-22 11:26:18,421 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2020-12-22 11:26:18,743 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2020-12-22 11:26:19,011 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2020-12-22 11:26:19,396 WARN L197 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2020-12-22 11:26:19,809 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2020-12-22 11:26:20,312 WARN L197 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 72 [2020-12-22 11:26:20,634 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2020-12-22 11:26:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:26:20,909 INFO L93 Difference]: Finished difference Result 10002 states and 33142 transitions. [2020-12-22 11:26:20,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-12-22 11:26:20,910 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-12-22 11:26:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:26:20,928 INFO L225 Difference]: With dead ends: 10002 [2020-12-22 11:26:20,929 INFO L226 Difference]: Without dead ends: 9931 [2020-12-22 11:26:20,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=626, Invalid=1536, Unknown=0, NotChecked=0, Total=2162 [2020-12-22 11:26:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9931 states. [2020-12-22 11:26:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9931 to 8377. [2020-12-22 11:26:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8377 states. [2020-12-22 11:26:21,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8377 states to 8377 states and 28291 transitions. [2020-12-22 11:26:21,094 INFO L78 Accepts]: Start accepts. Automaton has 8377 states and 28291 transitions. Word has length 31 [2020-12-22 11:26:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:26:21,094 INFO L481 AbstractCegarLoop]: Abstraction has 8377 states and 28291 transitions. [2020-12-22 11:26:21,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-22 11:26:21,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8377 states and 28291 transitions. [2020-12-22 11:26:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-22 11:26:21,102 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:26:21,102 INFO L422 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] [2020-12-22 11:26:21,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-22 11:26:21,102 INFO L429 AbstractCegarLoop]: === Iteration 54 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:26:21,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:26:21,103 INFO L82 PathProgramCache]: Analyzing trace with hash -594683273, now seen corresponding path program 3 times [2020-12-22 11:26:21,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:26:21,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359578068] [2020-12-22 11:26:21,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:26:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:26:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:26:22,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359578068] [2020-12-22 11:26:22,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:26:22,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-22 11:26:22,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201693991] [2020-12-22 11:26:22,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-22 11:26:22,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:26:22,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-22 11:26:22,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2020-12-22 11:26:22,447 INFO L87 Difference]: Start difference. First operand 8377 states and 28291 transitions. Second operand 20 states. [2020-12-22 11:26:23,175 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-12-22 11:26:23,463 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2020-12-22 11:26:23,786 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-12-22 11:26:24,362 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2020-12-22 11:26:24,767 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2020-12-22 11:26:25,225 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2020-12-22 11:26:25,962 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2020-12-22 11:26:26,173 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-12-22 11:26:26,528 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-12-22 11:26:26,827 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2020-12-22 11:26:27,159 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2020-12-22 11:26:27,648 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2020-12-22 11:26:28,012 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2020-12-22 11:26:28,400 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2020-12-22 11:26:28,917 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2020-12-22 11:26:29,181 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68