/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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 13:53:42,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 13:53:42,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 13:53:42,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 13:53:42,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 13:53:42,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 13:53:42,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 13:53:42,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 13:53:42,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 13:53:42,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 13:53:42,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 13:53:42,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 13:53:42,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 13:53:42,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 13:53:42,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 13:53:42,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 13:53:42,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 13:53:42,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 13:53:42,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 13:53:42,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 13:53:42,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 13:53:42,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 13:53:42,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 13:53:42,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 13:53:42,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 13:53:42,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 13:53:42,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 13:53:42,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 13:53:42,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 13:53:42,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 13:53:42,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 13:53:42,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 13:53:42,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 13:53:42,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 13:53:42,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 13:53:42,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 13:53:42,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 13:53:42,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 13:53:42,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 13:53:42,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 13:53:42,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 13:53:42,564 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 13:53:42,613 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 13:53:42,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 13:53:42,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 13:53:42,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 13:53:42,620 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 13:53:42,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 13:53:42,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 13:53:42,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 13:53:42,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 13:53:42,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 13:53:42,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 13:53:42,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 13:53:42,622 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 13:53:42,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 13:53:42,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 13:53:42,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 13:53:42,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 13:53:42,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 13:53:42,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 13:53:42,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 13:53:42,624 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 13:53:42,624 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 13:53:42,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 13:53:42,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 13:53:42,625 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 13:53:42,625 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-bitabs/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-23 13:53:43,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 13:53:43,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 13:53:43,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 13:53:43,087 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 13:53:43,088 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 13:53:43,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2020-12-23 13:53:43,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/daafef92e/8c89e0e7e40048babafa2f1c3f2d7bf2/FLAG3202fc164 [2020-12-23 13:53:43,949 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 13:53:43,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2020-12-23 13:53:43,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/daafef92e/8c89e0e7e40048babafa2f1c3f2d7bf2/FLAG3202fc164 [2020-12-23 13:53:44,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/daafef92e/8c89e0e7e40048babafa2f1c3f2d7bf2 [2020-12-23 13:53:44,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 13:53:44,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 13:53:44,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 13:53:44,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 13:53:44,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 13:53:44,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:53:44" (1/1) ... [2020-12-23 13:53:44,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e7c92ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:44, skipping insertion in model container [2020-12-23 13:53:44,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:53:44" (1/1) ... [2020-12-23 13:53:44,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 13:53:44,213 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 13:53:44,411 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~r,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[#t~mem8,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~r,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],StructAccessExpression[IdentifierExpression[~r,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~r,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],StructAccessExpression[IdentifierExpression[~r,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~val~0,] [2020-12-23 13:53:44,752 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] left hand side expression in assignment: lhs: VariableLHS[~last~0,] [2020-12-23 13:53:44,761 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2020-12-23 13:53:44,762 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] left hand side expression in assignment: lhs: VariableLHS[~val~1,] [2020-12-23 13:53:44,825 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2020-12-23 13:53:44,826 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2020-12-23 13:53:44,829 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2020-12-23 13:53:44,830 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2020-12-23 13:53:44,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:53:44,853 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 13:53:44,868 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~r,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[#t~mem8,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~r,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],StructAccessExpression[IdentifierExpression[~r,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~r,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],StructAccessExpression[IdentifierExpression[~r,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~val~0,] [2020-12-23 13:53:44,900 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] left hand side expression in assignment: lhs: VariableLHS[~last~0,] [2020-12-23 13:53:44,901 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2020-12-23 13:53:44,902 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] left hand side expression in assignment: lhs: VariableLHS[~val~1,] [2020-12-23 13:53:44,928 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2020-12-23 13:53:44,929 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2020-12-23 13:53:44,934 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2020-12-23 13:53:44,935 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2020-12-23 13:53:44,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:53:45,166 INFO L208 MainTranslator]: Completed translation [2020-12-23 13:53:45,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:45 WrapperNode [2020-12-23 13:53:45,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 13:53:45,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 13:53:45,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 13:53:45,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 13:53:45,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:45" (1/1) ... [2020-12-23 13:53:45,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:45" (1/1) ... [2020-12-23 13:53:45,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 13:53:45,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 13:53:45,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 13:53:45,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 13:53:45,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:45" (1/1) ... [2020-12-23 13:53:45,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:45" (1/1) ... [2020-12-23 13:53:45,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:45" (1/1) ... [2020-12-23 13:53:45,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:45" (1/1) ... [2020-12-23 13:53:45,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:45" (1/1) ... [2020-12-23 13:53:45,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:45" (1/1) ... [2020-12-23 13:53:45,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:45" (1/1) ... [2020-12-23 13:53:45,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 13:53:45,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 13:53:45,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 13:53:45,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 13:53:45,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:45" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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-23 13:53:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2020-12-23 13:53:45,455 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2020-12-23 13:53:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2020-12-23 13:53:45,455 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2020-12-23 13:53:45,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 13:53:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 13:53:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 13:53:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 13:53:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-12-23 13:53:45,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 13:53:45,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 13:53:45,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 13:53:45,459 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-23 13:53:46,284 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 13:53:46,284 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2020-12-23 13:53:46,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:53:46 BoogieIcfgContainer [2020-12-23 13:53:46,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 13:53:46,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 13:53:46,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 13:53:46,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 13:53:46,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:53:44" (1/3) ... [2020-12-23 13:53:46,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8c66a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:53:46, skipping insertion in model container [2020-12-23 13:53:46,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:45" (2/3) ... [2020-12-23 13:53:46,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8c66a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:53:46, skipping insertion in model container [2020-12-23 13:53:46,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:53:46" (3/3) ... [2020-12-23 13:53:46,297 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2020-12-23 13:53:46,326 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-23 13:53:46,327 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 13:53:46,332 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-12-23 13:53:46,333 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-23 13:53:46,382 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,382 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,383 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,383 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,383 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,384 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,384 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,384 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,384 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,385 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,385 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,385 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,385 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,385 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,386 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,386 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,386 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,386 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,387 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,387 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,387 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,387 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,388 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,388 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,388 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,388 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,389 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,389 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,389 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,390 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,390 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,390 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,390 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,390 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,391 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,391 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,391 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,391 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,392 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,392 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,392 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,392 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,393 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,393 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,393 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,393 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,394 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,394 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,394 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,394 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,394 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,395 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,395 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,395 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,395 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,396 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,396 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,396 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,396 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,401 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,402 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,402 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,402 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,402 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,402 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,403 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,403 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,403 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,403 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,403 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,404 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,404 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,404 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,404 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,405 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,405 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,405 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,405 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,405 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,406 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,406 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,407 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,407 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,407 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,407 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,408 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,408 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,409 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,410 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,410 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,411 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,412 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,412 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,412 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,412 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,413 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,413 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,416 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,416 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,416 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,417 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,417 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,417 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,417 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,417 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,418 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,418 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,418 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,419 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,420 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,420 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,420 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,420 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,420 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,421 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,422 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,423 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,423 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,423 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,423 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,423 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,424 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,424 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,424 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,424 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,425 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,425 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,425 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,425 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,425 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,427 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,427 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,427 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,428 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,428 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,428 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,428 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,428 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,429 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,429 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,429 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,430 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,430 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,430 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,430 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,430 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,431 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,431 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,434 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,434 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,435 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,436 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,436 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,436 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,436 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,437 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,437 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,438 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,438 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,439 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,439 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,439 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,439 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,439 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,440 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,440 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,440 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,440 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,440 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,441 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,441 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,441 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,441 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,441 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,442 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,442 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,442 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,442 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,443 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,443 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,443 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,443 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,443 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,444 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,445 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,445 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,446 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,446 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,447 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,448 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,448 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,448 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,449 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,450 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,450 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,450 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,451 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,451 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,452 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,453 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,453 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,455 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,458 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,460 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,461 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,461 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,461 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,466 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,466 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,466 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,466 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,466 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,467 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,467 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,473 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,474 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,474 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,474 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,474 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,474 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,475 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,475 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,475 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,475 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,475 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,476 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,476 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,477 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,477 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,477 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,478 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,478 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,478 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,478 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,478 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,478 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,479 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,479 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,480 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,481 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,481 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,481 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,481 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,481 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,481 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,482 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,482 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,484 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,484 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,484 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,484 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,485 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,485 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,485 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,485 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,485 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,485 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,486 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,486 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,486 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,486 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,487 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,487 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,487 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,487 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,487 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,488 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,488 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,488 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,488 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,488 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,488 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,489 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,489 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,489 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,489 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,490 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,490 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,490 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,490 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,490 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,490 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,491 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,491 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,491 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,491 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,493 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,493 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,493 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,493 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,494 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,494 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,494 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,494 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,494 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,494 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,495 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,495 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,495 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,495 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,495 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,496 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,496 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,496 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,496 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,496 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,497 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,497 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,497 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,497 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,498 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,498 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,498 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,498 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,499 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,499 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,499 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,499 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,499 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,499 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,500 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,500 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,500 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,500 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,500 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,500 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,500 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,501 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,501 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,501 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,501 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,501 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,501 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,502 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,502 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,504 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,508 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,511 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,515 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,516 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,516 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,516 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,516 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,516 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,517 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,517 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,522 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,522 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,523 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,523 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,523 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,523 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,523 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,524 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,524 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,524 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,524 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,524 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,524 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,525 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,525 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,527 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,527 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,528 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,528 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,528 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,528 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,528 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,529 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,529 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,532 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,532 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,533 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,533 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,533 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,533 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,534 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,534 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,534 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,534 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,534 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,535 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,535 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,536 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,536 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,536 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,536 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,537 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,537 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,537 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,537 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,537 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,538 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,538 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,538 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,538 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,538 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,538 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,539 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,539 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,539 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,539 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,539 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,540 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,540 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,540 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,540 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,540 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,541 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,541 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,541 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,541 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,541 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,542 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,542 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,542 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,542 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,542 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,542 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,543 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,543 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,543 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,545 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,546 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,546 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,546 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,546 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,547 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,547 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,547 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,547 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,547 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,548 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,548 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,548 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,548 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,548 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,549 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,549 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,549 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,549 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,557 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,558 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,558 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,558 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,559 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,559 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,559 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,559 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,559 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,559 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,560 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,560 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,560 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,560 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,561 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,561 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,561 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,561 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,561 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,562 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,562 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,563 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,564 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,564 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,564 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,564 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,564 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,565 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,565 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,565 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,565 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,565 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,566 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,566 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,566 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:46,576 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-12-23 13:53:46,599 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-12-23 13:53:46,640 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 13:53:46,640 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 13:53:46,640 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 13:53:46,640 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 13:53:46,641 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 13:53:46,641 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 13:53:46,641 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 13:53:46,641 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 13:53:46,670 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-23 13:53:46,672 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 212 transitions, 446 flow [2020-12-23 13:53:46,676 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 212 transitions, 446 flow [2020-12-23 13:53:46,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 200 places, 212 transitions, 446 flow [2020-12-23 13:53:46,802 INFO L129 PetriNetUnfolder]: 18/212 cut-off events. [2020-12-23 13:53:46,802 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-12-23 13:53:46,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 212 events. 18/212 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 474 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2020-12-23 13:53:46,843 INFO L116 LiptonReduction]: Number of co-enabled transitions 16584 [2020-12-23 13:53:48,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:53:50,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:53:52,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:53:52,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:53:52,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:53:53,604 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-12-23 13:53:54,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:53:54,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:53:54,435 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-12-23 13:53:54,653 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-12-23 13:53:54,924 WARN L197 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-12-23 13:53:55,160 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-12-23 13:53:55,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:53:55,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:53:56,387 WARN L197 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 147 [2020-12-23 13:53:56,744 WARN L197 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-12-23 13:53:57,451 WARN L197 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 147 [2020-12-23 13:53:57,775 WARN L197 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-12-23 13:53:57,967 INFO L131 LiptonReduction]: Checked pairs total: 43716 [2020-12-23 13:53:57,968 INFO L133 LiptonReduction]: Total number of compositions: 193 [2020-12-23 13:53:57,975 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 60 places, 66 transitions, 154 flow [2020-12-23 13:53:58,149 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2555 states. [2020-12-23 13:53:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states. [2020-12-23 13:53:58,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 13:53:58,168 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:53:58,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:53:58,169 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:53:58,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:53:58,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1264230791, now seen corresponding path program 1 times [2020-12-23 13:53:58,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:53:58,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052756870] [2020-12-23 13:53:58,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:53:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:53:58,480 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-23 13:53:58,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052756870] [2020-12-23 13:53:58,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:53:58,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 13:53:58,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329650878] [2020-12-23 13:53:58,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 13:53:58,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:53:58,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 13:53:58,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 13:53:58,512 INFO L87 Difference]: Start difference. First operand 2555 states. Second operand 2 states. [2020-12-23 13:53:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:53:58,601 INFO L93 Difference]: Finished difference Result 2555 states and 8199 transitions. [2020-12-23 13:53:58,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 13:53:58,603 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-12-23 13:53:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:53:58,644 INFO L225 Difference]: With dead ends: 2555 [2020-12-23 13:53:58,644 INFO L226 Difference]: Without dead ends: 2417 [2020-12-23 13:53:58,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 13:53:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2020-12-23 13:53:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2417. [2020-12-23 13:53:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2417 states. [2020-12-23 13:53:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 7802 transitions. [2020-12-23 13:53:58,825 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 7802 transitions. Word has length 13 [2020-12-23 13:53:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:53:58,825 INFO L481 AbstractCegarLoop]: Abstraction has 2417 states and 7802 transitions. [2020-12-23 13:53:58,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 13:53:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 7802 transitions. [2020-12-23 13:53:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-23 13:53:58,836 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:53:58,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:53:58,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 13:53:58,837 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:53:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:53:58,838 INFO L82 PathProgramCache]: Analyzing trace with hash -577657063, now seen corresponding path program 1 times [2020-12-23 13:53:58,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:53:58,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541745947] [2020-12-23 13:53:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:53:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:53:59,178 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-23 13:53:59,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541745947] [2020-12-23 13:53:59,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:53:59,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 13:53:59,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633126225] [2020-12-23 13:53:59,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 13:53:59,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:53:59,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 13:53:59,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:53:59,189 INFO L87 Difference]: Start difference. First operand 2417 states and 7802 transitions. Second operand 6 states. [2020-12-23 13:53:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:53:59,506 INFO L93 Difference]: Finished difference Result 2405 states and 7776 transitions. [2020-12-23 13:53:59,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:53:59,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-23 13:53:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:53:59,528 INFO L225 Difference]: With dead ends: 2405 [2020-12-23 13:53:59,529 INFO L226 Difference]: Without dead ends: 2405 [2020-12-23 13:53:59,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-23 13:53:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2020-12-23 13:53:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2405. [2020-12-23 13:53:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2020-12-23 13:53:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 7776 transitions. [2020-12-23 13:53:59,802 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 7776 transitions. Word has length 17 [2020-12-23 13:53:59,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:53:59,803 INFO L481 AbstractCegarLoop]: Abstraction has 2405 states and 7776 transitions. [2020-12-23 13:53:59,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 13:53:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 7776 transitions. [2020-12-23 13:53:59,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 13:53:59,806 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:53:59,806 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-23 13:53:59,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 13:53:59,807 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:53:59,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:53:59,808 INFO L82 PathProgramCache]: Analyzing trace with hash -245887620, now seen corresponding path program 1 times [2020-12-23 13:53:59,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:53:59,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804601407] [2020-12-23 13:53:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:53:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:00,014 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-23 13:54:00,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804601407] [2020-12-23 13:54:00,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:00,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 13:54:00,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289009828] [2020-12-23 13:54:00,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 13:54:00,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:00,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 13:54:00,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:54:00,022 INFO L87 Difference]: Start difference. First operand 2405 states and 7776 transitions. Second operand 7 states. [2020-12-23 13:54:00,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:00,687 INFO L93 Difference]: Finished difference Result 3979 states and 13124 transitions. [2020-12-23 13:54:00,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:54:00,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-12-23 13:54:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:00,720 INFO L225 Difference]: With dead ends: 3979 [2020-12-23 13:54:00,720 INFO L226 Difference]: Without dead ends: 3939 [2020-12-23 13:54:00,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-23 13:54:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2020-12-23 13:54:00,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 2948. [2020-12-23 13:54:00,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2020-12-23 13:54:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 9594 transitions. [2020-12-23 13:54:00,894 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 9594 transitions. Word has length 18 [2020-12-23 13:54:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:00,894 INFO L481 AbstractCegarLoop]: Abstraction has 2948 states and 9594 transitions. [2020-12-23 13:54:00,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 13:54:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 9594 transitions. [2020-12-23 13:54:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 13:54:00,899 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:00,899 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-23 13:54:00,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 13:54:00,900 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:00,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:00,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1133171604, now seen corresponding path program 2 times [2020-12-23 13:54:00,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:00,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404715787] [2020-12-23 13:54:00,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:01,136 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-23 13:54:01,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404715787] [2020-12-23 13:54:01,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:01,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 13:54:01,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147064919] [2020-12-23 13:54:01,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 13:54:01,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:01,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 13:54:01,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:54:01,138 INFO L87 Difference]: Start difference. First operand 2948 states and 9594 transitions. Second operand 7 states. [2020-12-23 13:54:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:01,683 INFO L93 Difference]: Finished difference Result 3485 states and 11281 transitions. [2020-12-23 13:54:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:54:01,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-12-23 13:54:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:01,711 INFO L225 Difference]: With dead ends: 3485 [2020-12-23 13:54:01,712 INFO L226 Difference]: Without dead ends: 3437 [2020-12-23 13:54:01,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-12-23 13:54:01,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2020-12-23 13:54:01,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 2898. [2020-12-23 13:54:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2020-12-23 13:54:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 9417 transitions. [2020-12-23 13:54:01,823 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 9417 transitions. Word has length 18 [2020-12-23 13:54:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:01,824 INFO L481 AbstractCegarLoop]: Abstraction has 2898 states and 9417 transitions. [2020-12-23 13:54:01,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 13:54:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 9417 transitions. [2020-12-23 13:54:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:01,830 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:01,830 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-23 13:54:01,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 13:54:01,830 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:01,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:01,831 INFO L82 PathProgramCache]: Analyzing trace with hash 41159297, now seen corresponding path program 1 times [2020-12-23 13:54:01,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:01,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410661763] [2020-12-23 13:54:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:02,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-23 13:54:02,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410661763] [2020-12-23 13:54:02,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:02,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 13:54:02,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877915704] [2020-12-23 13:54:02,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 13:54:02,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:02,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 13:54:02,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-23 13:54:02,254 INFO L87 Difference]: Start difference. First operand 2898 states and 9417 transitions. Second operand 12 states. [2020-12-23 13:54:03,728 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2020-12-23 13:54:03,939 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2020-12-23 13:54:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:04,218 INFO L93 Difference]: Finished difference Result 3448 states and 11147 transitions. [2020-12-23 13:54:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 13:54:04,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-12-23 13:54:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:04,248 INFO L225 Difference]: With dead ends: 3448 [2020-12-23 13:54:04,249 INFO L226 Difference]: Without dead ends: 3448 [2020-12-23 13:54:04,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2020-12-23 13:54:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2020-12-23 13:54:04,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 3388. [2020-12-23 13:54:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2020-12-23 13:54:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 11017 transitions. [2020-12-23 13:54:04,374 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 11017 transitions. Word has length 25 [2020-12-23 13:54:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:04,375 INFO L481 AbstractCegarLoop]: Abstraction has 3388 states and 11017 transitions. [2020-12-23 13:54:04,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 13:54:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 11017 transitions. [2020-12-23 13:54:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:04,383 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:04,383 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-23 13:54:04,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 13:54:04,421 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:04,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:04,422 INFO L82 PathProgramCache]: Analyzing trace with hash -907878328, now seen corresponding path program 1 times [2020-12-23 13:54:04,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:04,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683017704] [2020-12-23 13:54:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:04,961 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-23 13:54:04,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683017704] [2020-12-23 13:54:04,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:04,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 13:54:04,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749735615] [2020-12-23 13:54:04,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:54:04,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:04,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:54:04,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:54:04,966 INFO L87 Difference]: Start difference. First operand 3388 states and 11017 transitions. Second operand 13 states. [2020-12-23 13:54:06,244 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-12-23 13:54:06,467 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-12-23 13:54:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:06,920 INFO L93 Difference]: Finished difference Result 4020 states and 12998 transitions. [2020-12-23 13:54:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 13:54:06,921 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-23 13:54:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:06,951 INFO L225 Difference]: With dead ends: 4020 [2020-12-23 13:54:06,951 INFO L226 Difference]: Without dead ends: 4020 [2020-12-23 13:54:06,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:54:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2020-12-23 13:54:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 3514. [2020-12-23 13:54:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2020-12-23 13:54:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 11403 transitions. [2020-12-23 13:54:07,079 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 11403 transitions. Word has length 25 [2020-12-23 13:54:07,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:07,079 INFO L481 AbstractCegarLoop]: Abstraction has 3514 states and 11403 transitions. [2020-12-23 13:54:07,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:54:07,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 11403 transitions. [2020-12-23 13:54:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:07,087 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:07,087 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-23 13:54:07,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 13:54:07,087 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash 435078796, now seen corresponding path program 2 times [2020-12-23 13:54:07,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:07,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996936985] [2020-12-23 13:54:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:07,529 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-23 13:54:07,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996936985] [2020-12-23 13:54:07,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:07,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 13:54:07,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260709409] [2020-12-23 13:54:07,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:54:07,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:07,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:54:07,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:54:07,532 INFO L87 Difference]: Start difference. First operand 3514 states and 11403 transitions. Second operand 13 states. [2020-12-23 13:54:08,996 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2020-12-23 13:54:09,180 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2020-12-23 13:54:09,430 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-12-23 13:54:09,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:09,812 INFO L93 Difference]: Finished difference Result 4036 states and 13054 transitions. [2020-12-23 13:54:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 13:54:09,813 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-23 13:54:09,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:09,829 INFO L225 Difference]: With dead ends: 4036 [2020-12-23 13:54:09,829 INFO L226 Difference]: Without dead ends: 4036 [2020-12-23 13:54:09,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2020-12-23 13:54:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2020-12-23 13:54:09,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 3801. [2020-12-23 13:54:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3801 states. [2020-12-23 13:54:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3801 states to 3801 states and 12401 transitions. [2020-12-23 13:54:09,950 INFO L78 Accepts]: Start accepts. Automaton has 3801 states and 12401 transitions. Word has length 25 [2020-12-23 13:54:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:09,952 INFO L481 AbstractCegarLoop]: Abstraction has 3801 states and 12401 transitions. [2020-12-23 13:54:09,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:54:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3801 states and 12401 transitions. [2020-12-23 13:54:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:09,960 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:09,961 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-23 13:54:09,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 13:54:09,961 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:09,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:09,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1618332350, now seen corresponding path program 3 times [2020-12-23 13:54:09,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:09,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246517651] [2020-12-23 13:54:09,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:10,369 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-23 13:54:10,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246517651] [2020-12-23 13:54:10,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:10,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 13:54:10,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735811279] [2020-12-23 13:54:10,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:54:10,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:10,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:54:10,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:54:10,371 INFO L87 Difference]: Start difference. First operand 3801 states and 12401 transitions. Second operand 13 states. [2020-12-23 13:54:12,030 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-12-23 13:54:12,223 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2020-12-23 13:54:12,461 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2020-12-23 13:54:12,612 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-12-23 13:54:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:12,994 INFO L93 Difference]: Finished difference Result 4008 states and 12887 transitions. [2020-12-23 13:54:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 13:54:12,995 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-23 13:54:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:13,009 INFO L225 Difference]: With dead ends: 4008 [2020-12-23 13:54:13,009 INFO L226 Difference]: Without dead ends: 4008 [2020-12-23 13:54:13,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2020-12-23 13:54:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4008 states. [2020-12-23 13:54:13,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4008 to 3865. [2020-12-23 13:54:13,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3865 states. [2020-12-23 13:54:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 12515 transitions. [2020-12-23 13:54:13,138 INFO L78 Accepts]: Start accepts. Automaton has 3865 states and 12515 transitions. Word has length 25 [2020-12-23 13:54:13,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:13,139 INFO L481 AbstractCegarLoop]: Abstraction has 3865 states and 12515 transitions. [2020-12-23 13:54:13,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:54:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3865 states and 12515 transitions. [2020-12-23 13:54:13,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:13,148 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:13,148 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-23 13:54:13,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 13:54:13,149 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:13,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:13,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1839762318, now seen corresponding path program 4 times [2020-12-23 13:54:13,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:13,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191202046] [2020-12-23 13:54:13,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:13,634 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-23 13:54:13,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191202046] [2020-12-23 13:54:13,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:13,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 13:54:13,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588909050] [2020-12-23 13:54:13,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:54:13,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:13,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:54:13,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:54:13,637 INFO L87 Difference]: Start difference. First operand 3865 states and 12515 transitions. Second operand 13 states. [2020-12-23 13:54:14,177 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-23 13:54:14,384 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2020-12-23 13:54:14,751 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-12-23 13:54:15,495 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-12-23 13:54:15,684 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2020-12-23 13:54:15,912 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2020-12-23 13:54:16,184 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2020-12-23 13:54:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:16,526 INFO L93 Difference]: Finished difference Result 4065 states and 13075 transitions. [2020-12-23 13:54:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 13:54:16,527 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-23 13:54:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:16,541 INFO L225 Difference]: With dead ends: 4065 [2020-12-23 13:54:16,541 INFO L226 Difference]: Without dead ends: 4065 [2020-12-23 13:54:16,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=199, Invalid=401, Unknown=0, NotChecked=0, Total=600 [2020-12-23 13:54:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2020-12-23 13:54:16,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 3948. [2020-12-23 13:54:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2020-12-23 13:54:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 12777 transitions. [2020-12-23 13:54:16,662 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 12777 transitions. Word has length 25 [2020-12-23 13:54:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:16,662 INFO L481 AbstractCegarLoop]: Abstraction has 3948 states and 12777 transitions. [2020-12-23 13:54:16,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:54:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 12777 transitions. [2020-12-23 13:54:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:16,673 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:16,673 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-23 13:54:16,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 13:54:16,673 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:16,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:16,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1799252960, now seen corresponding path program 5 times [2020-12-23 13:54:16,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:16,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347803171] [2020-12-23 13:54:16,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:17,046 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-23 13:54:17,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347803171] [2020-12-23 13:54:17,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:17,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 13:54:17,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452925456] [2020-12-23 13:54:17,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:54:17,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:17,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:54:17,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:54:17,049 INFO L87 Difference]: Start difference. First operand 3948 states and 12777 transitions. Second operand 13 states. [2020-12-23 13:54:18,085 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-12-23 13:54:18,259 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-12-23 13:54:18,474 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2020-12-23 13:54:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:18,981 INFO L93 Difference]: Finished difference Result 4093 states and 13165 transitions. [2020-12-23 13:54:18,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 13:54:18,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-23 13:54:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:18,994 INFO L225 Difference]: With dead ends: 4093 [2020-12-23 13:54:18,994 INFO L226 Difference]: Without dead ends: 4093 [2020-12-23 13:54:18,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2020-12-23 13:54:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2020-12-23 13:54:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 4022. [2020-12-23 13:54:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4022 states. [2020-12-23 13:54:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 13022 transitions. [2020-12-23 13:54:19,108 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 13022 transitions. Word has length 25 [2020-12-23 13:54:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:19,108 INFO L481 AbstractCegarLoop]: Abstraction has 4022 states and 13022 transitions. [2020-12-23 13:54:19,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:54:19,109 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 13022 transitions. [2020-12-23 13:54:19,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:19,117 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:19,117 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-23 13:54:19,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 13:54:19,118 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:19,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:19,118 INFO L82 PathProgramCache]: Analyzing trace with hash -456295836, now seen corresponding path program 6 times [2020-12-23 13:54:19,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:19,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970351118] [2020-12-23 13:54:19,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:19,522 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-23 13:54:19,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970351118] [2020-12-23 13:54:19,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:19,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 13:54:19,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583717513] [2020-12-23 13:54:19,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:54:19,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:54:19,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:54:19,525 INFO L87 Difference]: Start difference. First operand 4022 states and 13022 transitions. Second operand 13 states. [2020-12-23 13:54:20,944 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2020-12-23 13:54:21,082 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-12-23 13:54:21,247 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2020-12-23 13:54:21,486 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2020-12-23 13:54:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:21,954 INFO L93 Difference]: Finished difference Result 4890 states and 15824 transitions. [2020-12-23 13:54:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 13:54:21,954 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-23 13:54:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:21,966 INFO L225 Difference]: With dead ends: 4890 [2020-12-23 13:54:21,966 INFO L226 Difference]: Without dead ends: 4890 [2020-12-23 13:54:21,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:54:21,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4890 states. [2020-12-23 13:54:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4890 to 4514. [2020-12-23 13:54:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4514 states. [2020-12-23 13:54:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 14822 transitions. [2020-12-23 13:54:22,088 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 14822 transitions. Word has length 25 [2020-12-23 13:54:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:22,088 INFO L481 AbstractCegarLoop]: Abstraction has 4514 states and 14822 transitions. [2020-12-23 13:54:22,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:54:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 14822 transitions. [2020-12-23 13:54:22,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:22,099 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:22,099 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-23 13:54:22,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 13:54:22,099 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:22,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:22,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1785260314, now seen corresponding path program 7 times [2020-12-23 13:54:22,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:22,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114752216] [2020-12-23 13:54:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:22,436 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-23 13:54:22,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114752216] [2020-12-23 13:54:22,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:22,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 13:54:22,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379102793] [2020-12-23 13:54:22,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:54:22,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:22,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:54:22,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:54:22,438 INFO L87 Difference]: Start difference. First operand 4514 states and 14822 transitions. Second operand 13 states. [2020-12-23 13:54:23,464 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2020-12-23 13:54:24,284 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2020-12-23 13:54:24,464 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-12-23 13:54:24,700 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2020-12-23 13:54:24,870 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2020-12-23 13:54:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:25,361 INFO L93 Difference]: Finished difference Result 4837 states and 15524 transitions. [2020-12-23 13:54:25,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 13:54:25,362 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-23 13:54:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:25,370 INFO L225 Difference]: With dead ends: 4837 [2020-12-23 13:54:25,370 INFO L226 Difference]: Without dead ends: 4837 [2020-12-23 13:54:25,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-12-23 13:54:25,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4837 states. [2020-12-23 13:54:25,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4837 to 4562. [2020-12-23 13:54:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4562 states. [2020-12-23 13:54:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4562 states to 4562 states and 14831 transitions. [2020-12-23 13:54:25,483 INFO L78 Accepts]: Start accepts. Automaton has 4562 states and 14831 transitions. Word has length 25 [2020-12-23 13:54:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:25,484 INFO L481 AbstractCegarLoop]: Abstraction has 4562 states and 14831 transitions. [2020-12-23 13:54:25,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:54:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 4562 states and 14831 transitions. [2020-12-23 13:54:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:25,492 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:25,493 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-23 13:54:25,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 13:54:25,493 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash 948387686, now seen corresponding path program 8 times [2020-12-23 13:54:25,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:25,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049241654] [2020-12-23 13:54:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:25,818 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-23 13:54:25,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049241654] [2020-12-23 13:54:25,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:25,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 13:54:25,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705297922] [2020-12-23 13:54:25,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:54:25,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:25,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:54:25,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:54:25,821 INFO L87 Difference]: Start difference. First operand 4562 states and 14831 transitions. Second operand 13 states. [2020-12-23 13:54:27,037 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2020-12-23 13:54:28,138 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2020-12-23 13:54:28,376 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2020-12-23 13:54:28,691 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2020-12-23 13:54:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:29,022 INFO L93 Difference]: Finished difference Result 5362 states and 17081 transitions. [2020-12-23 13:54:29,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 13:54:29,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-23 13:54:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:29,031 INFO L225 Difference]: With dead ends: 5362 [2020-12-23 13:54:29,031 INFO L226 Difference]: Without dead ends: 5362 [2020-12-23 13:54:29,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=247, Invalid=509, Unknown=0, NotChecked=0, Total=756 [2020-12-23 13:54:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2020-12-23 13:54:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 4128. [2020-12-23 13:54:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4128 states. [2020-12-23 13:54:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 13467 transitions. [2020-12-23 13:54:29,139 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 13467 transitions. Word has length 25 [2020-12-23 13:54:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:29,139 INFO L481 AbstractCegarLoop]: Abstraction has 4128 states and 13467 transitions. [2020-12-23 13:54:29,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:54:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 13467 transitions. [2020-12-23 13:54:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:29,147 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:29,147 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-23 13:54:29,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 13:54:29,148 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:29,148 INFO L82 PathProgramCache]: Analyzing trace with hash -162131449, now seen corresponding path program 2 times [2020-12-23 13:54:29,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:29,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522721851] [2020-12-23 13:54:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:29,564 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-23 13:54:29,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522721851] [2020-12-23 13:54:29,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:29,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 13:54:29,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361995238] [2020-12-23 13:54:29,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 13:54:29,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:29,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 13:54:29,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-23 13:54:29,567 INFO L87 Difference]: Start difference. First operand 4128 states and 13467 transitions. Second operand 12 states. [2020-12-23 13:54:30,555 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-12-23 13:54:31,458 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2020-12-23 13:54:31,647 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-12-23 13:54:31,903 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2020-12-23 13:54:32,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:32,196 INFO L93 Difference]: Finished difference Result 5348 states and 17117 transitions. [2020-12-23 13:54:32,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 13:54:32,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-12-23 13:54:32,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:32,206 INFO L225 Difference]: With dead ends: 5348 [2020-12-23 13:54:32,206 INFO L226 Difference]: Without dead ends: 5348 [2020-12-23 13:54:32,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2020-12-23 13:54:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5348 states. [2020-12-23 13:54:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5348 to 4008. [2020-12-23 13:54:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4008 states. [2020-12-23 13:54:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 12977 transitions. [2020-12-23 13:54:32,318 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 12977 transitions. Word has length 25 [2020-12-23 13:54:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:32,318 INFO L481 AbstractCegarLoop]: Abstraction has 4008 states and 12977 transitions. [2020-12-23 13:54:32,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 13:54:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 12977 transitions. [2020-12-23 13:54:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:32,326 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:32,326 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-23 13:54:32,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 13:54:32,327 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1203695909, now seen corresponding path program 3 times [2020-12-23 13:54:32,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:32,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886397049] [2020-12-23 13:54:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:32,734 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-23 13:54:32,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886397049] [2020-12-23 13:54:32,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:32,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 13:54:32,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029701291] [2020-12-23 13:54:32,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 13:54:32,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:32,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 13:54:32,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-12-23 13:54:32,737 INFO L87 Difference]: Start difference. First operand 4008 states and 12977 transitions. Second operand 12 states. [2020-12-23 13:54:33,836 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2020-12-23 13:54:34,860 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2020-12-23 13:54:35,031 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-12-23 13:54:35,267 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2020-12-23 13:54:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:35,599 INFO L93 Difference]: Finished difference Result 4998 states and 16017 transitions. [2020-12-23 13:54:35,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 13:54:35,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-12-23 13:54:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:35,608 INFO L225 Difference]: With dead ends: 4998 [2020-12-23 13:54:35,609 INFO L226 Difference]: Without dead ends: 4998 [2020-12-23 13:54:35,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2020-12-23 13:54:35,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2020-12-23 13:54:35,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 3768. [2020-12-23 13:54:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3768 states. [2020-12-23 13:54:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 12217 transitions. [2020-12-23 13:54:35,724 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 12217 transitions. Word has length 25 [2020-12-23 13:54:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:35,725 INFO L481 AbstractCegarLoop]: Abstraction has 3768 states and 12217 transitions. [2020-12-23 13:54:35,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 13:54:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 12217 transitions. [2020-12-23 13:54:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:35,732 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:35,732 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-23 13:54:35,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 13:54:35,732 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:35,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:35,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1916452799, now seen corresponding path program 4 times [2020-12-23 13:54:35,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:35,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748695018] [2020-12-23 13:54:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:36,024 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-23 13:54:36,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748695018] [2020-12-23 13:54:36,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:36,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 13:54:36,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543251990] [2020-12-23 13:54:36,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 13:54:36,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:36,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 13:54:36,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-12-23 13:54:36,027 INFO L87 Difference]: Start difference. First operand 3768 states and 12217 transitions. Second operand 12 states. [2020-12-23 13:54:37,309 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-12-23 13:54:38,702 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-12-23 13:54:38,880 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2020-12-23 13:54:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:39,227 INFO L93 Difference]: Finished difference Result 4552 states and 14474 transitions. [2020-12-23 13:54:39,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 13:54:39,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-12-23 13:54:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:39,235 INFO L225 Difference]: With dead ends: 4552 [2020-12-23 13:54:39,235 INFO L226 Difference]: Without dead ends: 4552 [2020-12-23 13:54:39,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=231, Invalid=525, Unknown=0, NotChecked=0, Total=756 [2020-12-23 13:54:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2020-12-23 13:54:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 3542. [2020-12-23 13:54:39,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2020-12-23 13:54:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 11374 transitions. [2020-12-23 13:54:39,328 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 11374 transitions. Word has length 25 [2020-12-23 13:54:39,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:39,329 INFO L481 AbstractCegarLoop]: Abstraction has 3542 states and 11374 transitions. [2020-12-23 13:54:39,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 13:54:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 11374 transitions. [2020-12-23 13:54:39,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:39,335 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:39,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] [2020-12-23 13:54:39,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 13:54:39,335 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:39,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:39,336 INFO L82 PathProgramCache]: Analyzing trace with hash 697724736, now seen corresponding path program 9 times [2020-12-23 13:54:39,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:39,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893762162] [2020-12-23 13:54:39,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:39,611 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-23 13:54:39,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893762162] [2020-12-23 13:54:39,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:39,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 13:54:39,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090607424] [2020-12-23 13:54:39,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 13:54:39,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:39,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 13:54:39,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-12-23 13:54:39,618 INFO L87 Difference]: Start difference. First operand 3542 states and 11374 transitions. Second operand 12 states. [2020-12-23 13:54:40,461 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-12-23 13:54:40,923 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2020-12-23 13:54:41,903 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2020-12-23 13:54:42,095 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2020-12-23 13:54:42,389 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2020-12-23 13:54:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:42,671 INFO L93 Difference]: Finished difference Result 4522 states and 14394 transitions. [2020-12-23 13:54:42,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 13:54:42,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-12-23 13:54:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:42,679 INFO L225 Difference]: With dead ends: 4522 [2020-12-23 13:54:42,679 INFO L226 Difference]: Without dead ends: 4522 [2020-12-23 13:54:42,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2020-12-23 13:54:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4522 states. [2020-12-23 13:54:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4522 to 3682. [2020-12-23 13:54:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3682 states. [2020-12-23 13:54:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 11864 transitions. [2020-12-23 13:54:42,772 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 11864 transitions. Word has length 25 [2020-12-23 13:54:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:42,773 INFO L481 AbstractCegarLoop]: Abstraction has 3682 states and 11864 transitions. [2020-12-23 13:54:42,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 13:54:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 11864 transitions. [2020-12-23 13:54:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:42,779 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:42,779 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-23 13:54:42,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 13:54:42,779 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:42,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:42,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1249075534, now seen corresponding path program 10 times [2020-12-23 13:54:42,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:42,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344283691] [2020-12-23 13:54:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:43,101 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-23 13:54:43,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344283691] [2020-12-23 13:54:43,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:43,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 13:54:43,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27381404] [2020-12-23 13:54:43,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:54:43,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:43,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:54:43,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:54:43,106 INFO L87 Difference]: Start difference. First operand 3682 states and 11864 transitions. Second operand 13 states. [2020-12-23 13:54:44,508 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2020-12-23 13:54:44,755 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2020-12-23 13:54:44,942 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2020-12-23 13:54:46,162 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-12-23 13:54:46,436 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-12-23 13:54:46,720 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2020-12-23 13:54:46,924 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2020-12-23 13:54:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:47,319 INFO L93 Difference]: Finished difference Result 4606 states and 14531 transitions. [2020-12-23 13:54:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 13:54:47,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-23 13:54:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:47,328 INFO L225 Difference]: With dead ends: 4606 [2020-12-23 13:54:47,328 INFO L226 Difference]: Without dead ends: 4606 [2020-12-23 13:54:47,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2020-12-23 13:54:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4606 states. [2020-12-23 13:54:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4606 to 3206. [2020-12-23 13:54:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3206 states. [2020-12-23 13:54:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 10231 transitions. [2020-12-23 13:54:47,412 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 10231 transitions. Word has length 25 [2020-12-23 13:54:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:47,412 INFO L481 AbstractCegarLoop]: Abstraction has 3206 states and 10231 transitions. [2020-12-23 13:54:47,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:54:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 10231 transitions. [2020-12-23 13:54:47,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:54:47,418 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:47,418 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-23 13:54:47,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 13:54:47,418 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:47,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:47,419 INFO L82 PathProgramCache]: Analyzing trace with hash -367690303, now seen corresponding path program 1 times [2020-12-23 13:54:47,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:47,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149266388] [2020-12-23 13:54:47,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:47,946 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-23 13:54:47,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149266388] [2020-12-23 13:54:47,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:47,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:54:47,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506761178] [2020-12-23 13:54:47,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:54:47,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:47,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:54:47,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:54:47,948 INFO L87 Difference]: Start difference. First operand 3206 states and 10231 transitions. Second operand 15 states. [2020-12-23 13:54:49,045 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-23 13:54:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:51,186 INFO L93 Difference]: Finished difference Result 5540 states and 17982 transitions. [2020-12-23 13:54:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 13:54:51,186 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:54:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:51,197 INFO L225 Difference]: With dead ends: 5540 [2020-12-23 13:54:51,197 INFO L226 Difference]: Without dead ends: 5540 [2020-12-23 13:54:51,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2020-12-23 13:54:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5540 states. [2020-12-23 13:54:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5540 to 4506. [2020-12-23 13:54:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2020-12-23 13:54:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 14460 transitions. [2020-12-23 13:54:51,304 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 14460 transitions. Word has length 27 [2020-12-23 13:54:51,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:51,304 INFO L481 AbstractCegarLoop]: Abstraction has 4506 states and 14460 transitions. [2020-12-23 13:54:51,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:54:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 14460 transitions. [2020-12-23 13:54:51,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:54:51,312 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:51,312 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-23 13:54:51,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 13:54:51,312 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:51,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:51,313 INFO L82 PathProgramCache]: Analyzing trace with hash -367690317, now seen corresponding path program 1 times [2020-12-23 13:54:51,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:51,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788911815] [2020-12-23 13:54:51,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:51,794 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-23 13:54:51,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788911815] [2020-12-23 13:54:51,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:51,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:54:51,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686198087] [2020-12-23 13:54:51,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:54:51,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:51,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:54:51,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:54:51,796 INFO L87 Difference]: Start difference. First operand 4506 states and 14460 transitions. Second operand 15 states. [2020-12-23 13:54:52,817 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-23 13:54:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:54,765 INFO L93 Difference]: Finished difference Result 5540 states and 17837 transitions. [2020-12-23 13:54:54,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 13:54:54,766 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:54:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:54,776 INFO L225 Difference]: With dead ends: 5540 [2020-12-23 13:54:54,776 INFO L226 Difference]: Without dead ends: 5540 [2020-12-23 13:54:54,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2020-12-23 13:54:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5540 states. [2020-12-23 13:54:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5540 to 4506. [2020-12-23 13:54:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2020-12-23 13:54:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 14367 transitions. [2020-12-23 13:54:54,853 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 14367 transitions. Word has length 27 [2020-12-23 13:54:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:54,853 INFO L481 AbstractCegarLoop]: Abstraction has 4506 states and 14367 transitions. [2020-12-23 13:54:54,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:54:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 14367 transitions. [2020-12-23 13:54:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:54:54,861 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:54,861 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-23 13:54:54,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 13:54:54,862 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:54,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:54,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1609018301, now seen corresponding path program 1 times [2020-12-23 13:54:54,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:54,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216149855] [2020-12-23 13:54:54,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:55,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-23 13:54:55,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216149855] [2020-12-23 13:54:55,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:55,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 13:54:55,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282980143] [2020-12-23 13:54:55,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 13:54:55,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:55,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 13:54:55,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2020-12-23 13:54:55,562 INFO L87 Difference]: Start difference. First operand 4506 states and 14367 transitions. Second operand 17 states. [2020-12-23 13:54:56,715 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-23 13:54:56,932 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-12-23 13:54:57,206 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-23 13:54:57,468 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2020-12-23 13:54:57,701 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2020-12-23 13:54:59,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:59,336 INFO L93 Difference]: Finished difference Result 6526 states and 21072 transitions. [2020-12-23 13:54:59,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 13:54:59,336 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-23 13:54:59,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:59,349 INFO L225 Difference]: With dead ends: 6526 [2020-12-23 13:54:59,349 INFO L226 Difference]: Without dead ends: 6526 [2020-12-23 13:54:59,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2020-12-23 13:54:59,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6526 states. [2020-12-23 13:54:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6526 to 5060. [2020-12-23 13:54:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5060 states. [2020-12-23 13:54:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 16254 transitions. [2020-12-23 13:54:59,444 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 16254 transitions. Word has length 27 [2020-12-23 13:54:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:59,444 INFO L481 AbstractCegarLoop]: Abstraction has 5060 states and 16254 transitions. [2020-12-23 13:54:59,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 13:54:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 16254 transitions. [2020-12-23 13:54:59,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:54:59,453 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:59,453 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-23 13:54:59,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 13:54:59,453 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:54:59,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:59,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1609018315, now seen corresponding path program 1 times [2020-12-23 13:54:59,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:59,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484460582] [2020-12-23 13:54:59,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:00,147 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-23 13:55:00,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484460582] [2020-12-23 13:55:00,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:00,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 13:55:00,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376902753] [2020-12-23 13:55:00,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 13:55:00,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:00,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 13:55:00,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2020-12-23 13:55:00,150 INFO L87 Difference]: Start difference. First operand 5060 states and 16254 transitions. Second operand 17 states. [2020-12-23 13:55:01,312 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-23 13:55:01,553 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-12-23 13:55:01,820 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-23 13:55:02,085 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2020-12-23 13:55:02,320 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2020-12-23 13:55:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:03,933 INFO L93 Difference]: Finished difference Result 6004 states and 19185 transitions. [2020-12-23 13:55:03,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 13:55:03,934 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-23 13:55:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:03,945 INFO L225 Difference]: With dead ends: 6004 [2020-12-23 13:55:03,945 INFO L226 Difference]: Without dead ends: 6004 [2020-12-23 13:55:03,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2020-12-23 13:55:03,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2020-12-23 13:55:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 4736. [2020-12-23 13:55:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4736 states. [2020-12-23 13:55:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 15084 transitions. [2020-12-23 13:55:04,037 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 15084 transitions. Word has length 27 [2020-12-23 13:55:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:04,037 INFO L481 AbstractCegarLoop]: Abstraction has 4736 states and 15084 transitions. [2020-12-23 13:55:04,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 13:55:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 15084 transitions. [2020-12-23 13:55:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:04,045 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:04,045 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-23 13:55:04,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 13:55:04,046 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:55:04,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:04,046 INFO L82 PathProgramCache]: Analyzing trace with hash 482589063, now seen corresponding path program 2 times [2020-12-23 13:55:04,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:04,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518033890] [2020-12-23 13:55:04,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:04,841 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-12-23 13:55:05,086 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-23 13:55:05,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518033890] [2020-12-23 13:55:05,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:05,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 13:55:05,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569319747] [2020-12-23 13:55:05,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 13:55:05,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:05,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 13:55:05,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-12-23 13:55:05,087 INFO L87 Difference]: Start difference. First operand 4736 states and 15084 transitions. Second operand 17 states. [2020-12-23 13:55:06,567 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2020-12-23 13:55:06,761 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-12-23 13:55:07,012 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2020-12-23 13:55:07,276 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2020-12-23 13:55:07,524 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-12-23 13:55:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:09,213 INFO L93 Difference]: Finished difference Result 7279 states and 23435 transitions. [2020-12-23 13:55:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 13:55:09,214 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-23 13:55:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:09,228 INFO L225 Difference]: With dead ends: 7279 [2020-12-23 13:55:09,228 INFO L226 Difference]: Without dead ends: 7279 [2020-12-23 13:55:09,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2020-12-23 13:55:09,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7279 states. [2020-12-23 13:55:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7279 to 5446. [2020-12-23 13:55:09,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5446 states. [2020-12-23 13:55:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5446 states to 5446 states and 17439 transitions. [2020-12-23 13:55:09,339 INFO L78 Accepts]: Start accepts. Automaton has 5446 states and 17439 transitions. Word has length 27 [2020-12-23 13:55:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:09,339 INFO L481 AbstractCegarLoop]: Abstraction has 5446 states and 17439 transitions. [2020-12-23 13:55:09,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 13:55:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 5446 states and 17439 transitions. [2020-12-23 13:55:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:09,346 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:09,347 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-23 13:55:09,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 13:55:09,347 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:55:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash 482589049, now seen corresponding path program 2 times [2020-12-23 13:55:09,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:09,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528137466] [2020-12-23 13:55:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:10,074 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-12-23 13:55:10,324 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-23 13:55:10,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528137466] [2020-12-23 13:55:10,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:10,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 13:55:10,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125496878] [2020-12-23 13:55:10,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 13:55:10,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:10,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 13:55:10,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-12-23 13:55:10,326 INFO L87 Difference]: Start difference. First operand 5446 states and 17439 transitions. Second operand 17 states. [2020-12-23 13:55:10,911 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-23 13:55:11,858 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2020-12-23 13:55:12,080 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-12-23 13:55:12,327 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2020-12-23 13:55:12,586 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2020-12-23 13:55:12,823 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-12-23 13:55:14,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:14,541 INFO L93 Difference]: Finished difference Result 7186 states and 23088 transitions. [2020-12-23 13:55:14,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 13:55:14,541 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-23 13:55:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:14,554 INFO L225 Difference]: With dead ends: 7186 [2020-12-23 13:55:14,554 INFO L226 Difference]: Without dead ends: 7186 [2020-12-23 13:55:14,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2020-12-23 13:55:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2020-12-23 13:55:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 4976. [2020-12-23 13:55:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4976 states. [2020-12-23 13:55:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4976 states to 4976 states and 15804 transitions. [2020-12-23 13:55:14,647 INFO L78 Accepts]: Start accepts. Automaton has 4976 states and 15804 transitions. Word has length 27 [2020-12-23 13:55:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:14,647 INFO L481 AbstractCegarLoop]: Abstraction has 4976 states and 15804 transitions. [2020-12-23 13:55:14,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 13:55:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4976 states and 15804 transitions. [2020-12-23 13:55:14,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:14,653 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:14,653 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-23 13:55:14,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 13:55:14,653 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:55:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:14,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1455533379, now seen corresponding path program 3 times [2020-12-23 13:55:14,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:14,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030545875] [2020-12-23 13:55:14,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:15,409 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-23 13:55:15,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030545875] [2020-12-23 13:55:15,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:15,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:55:15,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694947020] [2020-12-23 13:55:15,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 13:55:15,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:15,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 13:55:15,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-12-23 13:55:15,411 INFO L87 Difference]: Start difference. First operand 4976 states and 15804 transitions. Second operand 16 states. [2020-12-23 13:55:15,989 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-23 13:55:16,225 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-23 13:55:16,601 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-23 13:55:16,918 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-23 13:55:17,191 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-23 13:55:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:19,231 INFO L93 Difference]: Finished difference Result 7541 states and 24298 transitions. [2020-12-23 13:55:19,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 13:55:19,231 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-23 13:55:19,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:19,245 INFO L225 Difference]: With dead ends: 7541 [2020-12-23 13:55:19,245 INFO L226 Difference]: Without dead ends: 7541 [2020-12-23 13:55:19,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2020-12-23 13:55:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7541 states. [2020-12-23 13:55:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7541 to 5986. [2020-12-23 13:55:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5986 states. [2020-12-23 13:55:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5986 states to 5986 states and 19163 transitions. [2020-12-23 13:55:19,378 INFO L78 Accepts]: Start accepts. Automaton has 5986 states and 19163 transitions. Word has length 27 [2020-12-23 13:55:19,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:19,378 INFO L481 AbstractCegarLoop]: Abstraction has 5986 states and 19163 transitions. [2020-12-23 13:55:19,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 13:55:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5986 states and 19163 transitions. [2020-12-23 13:55:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:19,387 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:19,387 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-23 13:55:19,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 13:55:19,388 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:55:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:19,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1455533393, now seen corresponding path program 3 times [2020-12-23 13:55:19,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:19,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744789489] [2020-12-23 13:55:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:20,043 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-23 13:55:20,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744789489] [2020-12-23 13:55:20,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:20,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:55:20,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273503185] [2020-12-23 13:55:20,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 13:55:20,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 13:55:20,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-12-23 13:55:20,045 INFO L87 Difference]: Start difference. First operand 5986 states and 19163 transitions. Second operand 16 states. [2020-12-23 13:55:20,618 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-23 13:55:20,870 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-23 13:55:21,274 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-23 13:55:21,609 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-23 13:55:21,927 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-23 13:55:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:24,156 INFO L93 Difference]: Finished difference Result 6926 states and 22209 transitions. [2020-12-23 13:55:24,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 13:55:24,156 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-23 13:55:24,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:24,173 INFO L225 Difference]: With dead ends: 6926 [2020-12-23 13:55:24,173 INFO L226 Difference]: Without dead ends: 6926 [2020-12-23 13:55:24,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2020-12-23 13:55:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6926 states. [2020-12-23 13:55:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6926 to 5180. [2020-12-23 13:55:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5180 states. [2020-12-23 13:55:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 16448 transitions. [2020-12-23 13:55:24,284 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 16448 transitions. Word has length 27 [2020-12-23 13:55:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:24,284 INFO L481 AbstractCegarLoop]: Abstraction has 5180 states and 16448 transitions. [2020-12-23 13:55:24,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 13:55:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 16448 transitions. [2020-12-23 13:55:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:24,289 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:24,289 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-23 13:55:24,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 13:55:24,289 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:55:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:24,290 INFO L82 PathProgramCache]: Analyzing trace with hash 773419547, now seen corresponding path program 4 times [2020-12-23 13:55:24,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:24,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156898519] [2020-12-23 13:55:24,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:25,168 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-23 13:55:25,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156898519] [2020-12-23 13:55:25,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:25,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 13:55:25,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465062637] [2020-12-23 13:55:25,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 13:55:25,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:25,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 13:55:25,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-23 13:55:25,169 INFO L87 Difference]: Start difference. First operand 5180 states and 16448 transitions. Second operand 17 states. [2020-12-23 13:55:26,529 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2020-12-23 13:55:26,783 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2020-12-23 13:55:27,098 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-12-23 13:55:27,392 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2020-12-23 13:55:27,645 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-12-23 13:55:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:29,429 INFO L93 Difference]: Finished difference Result 6839 states and 21925 transitions. [2020-12-23 13:55:29,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 13:55:29,430 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-23 13:55:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:29,442 INFO L225 Difference]: With dead ends: 6839 [2020-12-23 13:55:29,442 INFO L226 Difference]: Without dead ends: 6839 [2020-12-23 13:55:29,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=218, Invalid=904, Unknown=0, NotChecked=0, Total=1122 [2020-12-23 13:55:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6839 states. [2020-12-23 13:55:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6839 to 5240. [2020-12-23 13:55:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5240 states. [2020-12-23 13:55:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 16628 transitions. [2020-12-23 13:55:29,636 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 16628 transitions. Word has length 27 [2020-12-23 13:55:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:29,636 INFO L481 AbstractCegarLoop]: Abstraction has 5240 states and 16628 transitions. [2020-12-23 13:55:29,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 13:55:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 16628 transitions. [2020-12-23 13:55:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:29,642 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:29,642 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-23 13:55:29,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 13:55:29,642 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:55:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:29,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1429940385, now seen corresponding path program 5 times [2020-12-23 13:55:29,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:29,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141689497] [2020-12-23 13:55:29,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:30,407 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 32 [2020-12-23 13:55:30,663 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-23 13:55:30,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141689497] [2020-12-23 13:55:30,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:30,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 13:55:30,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177999990] [2020-12-23 13:55:30,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 13:55:30,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:30,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 13:55:30,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2020-12-23 13:55:30,665 INFO L87 Difference]: Start difference. First operand 5240 states and 16628 transitions. Second operand 17 states. [2020-12-23 13:55:32,319 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2020-12-23 13:55:32,515 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-12-23 13:55:32,774 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-12-23 13:55:33,037 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2020-12-23 13:55:33,297 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2020-12-23 13:55:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:35,047 INFO L93 Difference]: Finished difference Result 8230 states and 26252 transitions. [2020-12-23 13:55:35,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 13:55:35,048 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-23 13:55:35,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:35,062 INFO L225 Difference]: With dead ends: 8230 [2020-12-23 13:55:35,062 INFO L226 Difference]: Without dead ends: 8230 [2020-12-23 13:55:35,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2020-12-23 13:55:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8230 states. [2020-12-23 13:55:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8230 to 5720. [2020-12-23 13:55:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5720 states. [2020-12-23 13:55:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5720 states to 5720 states and 18068 transitions. [2020-12-23 13:55:35,166 INFO L78 Accepts]: Start accepts. Automaton has 5720 states and 18068 transitions. Word has length 27 [2020-12-23 13:55:35,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:35,167 INFO L481 AbstractCegarLoop]: Abstraction has 5720 states and 18068 transitions. [2020-12-23 13:55:35,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 13:55:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 5720 states and 18068 transitions. [2020-12-23 13:55:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:35,172 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:35,173 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-23 13:55:35,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 13:55:35,173 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:55:35,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:35,173 INFO L82 PathProgramCache]: Analyzing trace with hash 926904469, now seen corresponding path program 6 times [2020-12-23 13:55:35,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:35,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289783046] [2020-12-23 13:55:35,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:35,751 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-23 13:55:35,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289783046] [2020-12-23 13:55:35,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:35,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:55:35,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230711186] [2020-12-23 13:55:35,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:55:35,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:35,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:55:35,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:55:35,753 INFO L87 Difference]: Start difference. First operand 5720 states and 18068 transitions. Second operand 15 states. [2020-12-23 13:55:36,340 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-23 13:55:36,851 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2020-12-23 13:55:37,143 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-12-23 13:55:37,451 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-23 13:55:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:39,678 INFO L93 Difference]: Finished difference Result 8515 states and 27279 transitions. [2020-12-23 13:55:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 13:55:39,678 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:55:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:39,693 INFO L225 Difference]: With dead ends: 8515 [2020-12-23 13:55:39,693 INFO L226 Difference]: Without dead ends: 8515 [2020-12-23 13:55:39,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2020-12-23 13:55:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8515 states. [2020-12-23 13:55:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8515 to 6790. [2020-12-23 13:55:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6790 states. [2020-12-23 13:55:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6790 states to 6790 states and 21607 transitions. [2020-12-23 13:55:39,811 INFO L78 Accepts]: Start accepts. Automaton has 6790 states and 21607 transitions. Word has length 27 [2020-12-23 13:55:39,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:39,811 INFO L481 AbstractCegarLoop]: Abstraction has 6790 states and 21607 transitions. [2020-12-23 13:55:39,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:55:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6790 states and 21607 transitions. [2020-12-23 13:55:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:39,817 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:39,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] [2020-12-23 13:55:39,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 13:55:39,818 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:55:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:39,818 INFO L82 PathProgramCache]: Analyzing trace with hash 926904455, now seen corresponding path program 4 times [2020-12-23 13:55:39,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:39,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214369197] [2020-12-23 13:55:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:40,632 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-23 13:55:40,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214369197] [2020-12-23 13:55:40,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:40,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:55:40,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481588695] [2020-12-23 13:55:40,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 13:55:40,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:40,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 13:55:40,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-23 13:55:40,634 INFO L87 Difference]: Start difference. First operand 6790 states and 21607 transitions. Second operand 16 states. [2020-12-23 13:55:41,224 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-23 13:55:41,480 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-23 13:55:41,902 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-23 13:55:42,241 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-23 13:55:42,561 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-23 13:55:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:44,757 INFO L93 Difference]: Finished difference Result 8422 states and 26932 transitions. [2020-12-23 13:55:44,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 13:55:44,757 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-23 13:55:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:44,770 INFO L225 Difference]: With dead ends: 8422 [2020-12-23 13:55:44,770 INFO L226 Difference]: Without dead ends: 8422 [2020-12-23 13:55:44,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2020-12-23 13:55:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8422 states. [2020-12-23 13:55:44,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8422 to 5420. [2020-12-23 13:55:44,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5420 states. [2020-12-23 13:55:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5420 states to 5420 states and 17168 transitions. [2020-12-23 13:55:44,861 INFO L78 Accepts]: Start accepts. Automaton has 5420 states and 17168 transitions. Word has length 27 [2020-12-23 13:55:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:44,861 INFO L481 AbstractCegarLoop]: Abstraction has 5420 states and 17168 transitions. [2020-12-23 13:55:44,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 13:55:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5420 states and 17168 transitions. [2020-12-23 13:55:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:44,866 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:44,866 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-23 13:55:44,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 13:55:44,866 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:55:44,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:44,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1838398407, now seen corresponding path program 2 times [2020-12-23 13:55:44,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:44,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577798031] [2020-12-23 13:55:44,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:45,555 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-23 13:55:45,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577798031] [2020-12-23 13:55:45,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:45,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:55:45,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535108861] [2020-12-23 13:55:45,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:55:45,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:45,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:55:45,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:55:45,557 INFO L87 Difference]: Start difference. First operand 5420 states and 17168 transitions. Second operand 15 states. [2020-12-23 13:55:46,207 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-12-23 13:55:46,574 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2020-12-23 13:55:46,856 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2020-12-23 13:55:47,190 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2020-12-23 13:55:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:49,572 INFO L93 Difference]: Finished difference Result 7768 states and 24816 transitions. [2020-12-23 13:55:49,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 13:55:49,573 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:55:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:49,587 INFO L225 Difference]: With dead ends: 7768 [2020-12-23 13:55:49,587 INFO L226 Difference]: Without dead ends: 7768 [2020-12-23 13:55:49,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2020-12-23 13:55:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7768 states. [2020-12-23 13:55:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7768 to 5184. [2020-12-23 13:55:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5184 states. [2020-12-23 13:55:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 16460 transitions. [2020-12-23 13:55:49,682 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 16460 transitions. Word has length 27 [2020-12-23 13:55:49,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:49,682 INFO L481 AbstractCegarLoop]: Abstraction has 5184 states and 16460 transitions. [2020-12-23 13:55:49,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:55:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 16460 transitions. [2020-12-23 13:55:49,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:49,687 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:49,687 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-23 13:55:49,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 13:55:49,688 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:55:49,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:49,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1622332315, now seen corresponding path program 3 times [2020-12-23 13:55:49,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:49,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223575309] [2020-12-23 13:55:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:50,404 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-23 13:55:50,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223575309] [2020-12-23 13:55:50,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:50,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:55:50,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522308312] [2020-12-23 13:55:50,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:55:50,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:50,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:55:50,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:55:50,406 INFO L87 Difference]: Start difference. First operand 5184 states and 16460 transitions. Second operand 15 states. [2020-12-23 13:55:51,017 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-12-23 13:55:51,356 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-12-23 13:55:51,614 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2020-12-23 13:55:51,923 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2020-12-23 13:55:54,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:54,147 INFO L93 Difference]: Finished difference Result 7528 states and 24096 transitions. [2020-12-23 13:55:54,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 13:55:54,148 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:55:54,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:54,163 INFO L225 Difference]: With dead ends: 7528 [2020-12-23 13:55:54,163 INFO L226 Difference]: Without dead ends: 7528 [2020-12-23 13:55:54,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2020-12-23 13:55:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7528 states. [2020-12-23 13:55:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7528 to 4824. [2020-12-23 13:55:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4824 states. [2020-12-23 13:55:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4824 states to 4824 states and 15380 transitions. [2020-12-23 13:55:54,252 INFO L78 Accepts]: Start accepts. Automaton has 4824 states and 15380 transitions. Word has length 27 [2020-12-23 13:55:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:54,252 INFO L481 AbstractCegarLoop]: Abstraction has 4824 states and 15380 transitions. [2020-12-23 13:55:54,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:55:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4824 states and 15380 transitions. [2020-12-23 13:55:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:54,258 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:54,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, 1, 1] [2020-12-23 13:55:54,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 13:55:54,258 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:55:54,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:54,258 INFO L82 PathProgramCache]: Analyzing trace with hash 24491393, now seen corresponding path program 4 times [2020-12-23 13:55:54,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:54,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539465053] [2020-12-23 13:55:54,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:54,891 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-23 13:55:54,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539465053] [2020-12-23 13:55:54,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:54,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:55:54,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510168771] [2020-12-23 13:55:54,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:55:54,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:54,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:55:54,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:55:54,893 INFO L87 Difference]: Start difference. First operand 4824 states and 15380 transitions. Second operand 15 states. [2020-12-23 13:55:55,832 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2020-12-23 13:55:56,108 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2020-12-23 13:55:56,400 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2020-12-23 13:55:58,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:58,652 INFO L93 Difference]: Finished difference Result 6808 states and 21936 transitions. [2020-12-23 13:55:58,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 13:55:58,653 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:55:58,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:58,664 INFO L225 Difference]: With dead ends: 6808 [2020-12-23 13:55:58,664 INFO L226 Difference]: Without dead ends: 6808 [2020-12-23 13:55:58,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2020-12-23 13:55:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6808 states. [2020-12-23 13:55:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6808 to 4704. [2020-12-23 13:55:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4704 states. [2020-12-23 13:55:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4704 states to 4704 states and 15020 transitions. [2020-12-23 13:55:58,798 INFO L78 Accepts]: Start accepts. Automaton has 4704 states and 15020 transitions. Word has length 27 [2020-12-23 13:55:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:58,798 INFO L481 AbstractCegarLoop]: Abstraction has 4704 states and 15020 transitions. [2020-12-23 13:55:58,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:55:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 4704 states and 15020 transitions. [2020-12-23 13:55:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:58,803 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:58,804 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-23 13:55:58,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 13:55:58,804 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:55:58,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:58,804 INFO L82 PathProgramCache]: Analyzing trace with hash -183527175, now seen corresponding path program 5 times [2020-12-23 13:55:58,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:58,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91060767] [2020-12-23 13:55:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:59,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-23 13:55:59,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91060767] [2020-12-23 13:55:59,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:59,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:55:59,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238304279] [2020-12-23 13:55:59,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:55:59,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:59,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:55:59,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:55:59,426 INFO L87 Difference]: Start difference. First operand 4704 states and 15020 transitions. Second operand 15 states. [2020-12-23 13:56:00,330 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-23 13:56:00,583 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2020-12-23 13:56:00,981 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-12-23 13:56:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:03,702 INFO L93 Difference]: Finished difference Result 6893 states and 22242 transitions. [2020-12-23 13:56:03,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 13:56:03,702 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:56:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:03,714 INFO L225 Difference]: With dead ends: 6893 [2020-12-23 13:56:03,714 INFO L226 Difference]: Without dead ends: 6893 [2020-12-23 13:56:03,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2020-12-23 13:56:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6893 states. [2020-12-23 13:56:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6893 to 5538. [2020-12-23 13:56:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5538 states. [2020-12-23 13:56:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5538 states to 5538 states and 17831 transitions. [2020-12-23 13:56:03,802 INFO L78 Accepts]: Start accepts. Automaton has 5538 states and 17831 transitions. Word has length 27 [2020-12-23 13:56:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:03,803 INFO L481 AbstractCegarLoop]: Abstraction has 5538 states and 17831 transitions. [2020-12-23 13:56:03,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:56:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 5538 states and 17831 transitions. [2020-12-23 13:56:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:56:03,808 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:03,808 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-23 13:56:03,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 13:56:03,808 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:56:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:03,808 INFO L82 PathProgramCache]: Analyzing trace with hash -183527189, now seen corresponding path program 2 times [2020-12-23 13:56:03,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:03,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543012574] [2020-12-23 13:56:03,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:04,338 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-23 13:56:04,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543012574] [2020-12-23 13:56:04,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:04,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:56:04,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45195652] [2020-12-23 13:56:04,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:56:04,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:04,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:56:04,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:56:04,340 INFO L87 Difference]: Start difference. First operand 5538 states and 17831 transitions. Second operand 15 states. [2020-12-23 13:56:05,511 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-23 13:56:05,909 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2020-12-23 13:56:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:08,694 INFO L93 Difference]: Finished difference Result 6278 states and 20153 transitions. [2020-12-23 13:56:08,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 13:56:08,695 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:56:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:08,707 INFO L225 Difference]: With dead ends: 6278 [2020-12-23 13:56:08,707 INFO L226 Difference]: Without dead ends: 6278 [2020-12-23 13:56:08,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2020-12-23 13:56:08,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6278 states. [2020-12-23 13:56:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6278 to 4588. [2020-12-23 13:56:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4588 states. [2020-12-23 13:56:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 14652 transitions. [2020-12-23 13:56:08,778 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 14652 transitions. Word has length 27 [2020-12-23 13:56:08,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:08,778 INFO L481 AbstractCegarLoop]: Abstraction has 4588 states and 14652 transitions. [2020-12-23 13:56:08,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:56:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 14652 transitions. [2020-12-23 13:56:08,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:56:08,782 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:08,782 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-23 13:56:08,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 13:56:08,782 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:56:08,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:08,782 INFO L82 PathProgramCache]: Analyzing trace with hash 79389321, now seen corresponding path program 7 times [2020-12-23 13:56:08,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:08,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768868413] [2020-12-23 13:56:08,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:09,507 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-23 13:56:09,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768868413] [2020-12-23 13:56:09,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:09,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 13:56:09,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136526028] [2020-12-23 13:56:09,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 13:56:09,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:09,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 13:56:09,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-23 13:56:09,509 INFO L87 Difference]: Start difference. First operand 4588 states and 14652 transitions. Second operand 17 states. [2020-12-23 13:56:10,232 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-23 13:56:10,503 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2020-12-23 13:56:10,946 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-23 13:56:11,312 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-23 13:56:11,680 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-23 13:56:12,706 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2020-12-23 13:56:12,895 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2020-12-23 13:56:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:15,202 INFO L93 Difference]: Finished difference Result 6986 states and 22434 transitions. [2020-12-23 13:56:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-23 13:56:15,203 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-23 13:56:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:15,215 INFO L225 Difference]: With dead ends: 6986 [2020-12-23 13:56:15,215 INFO L226 Difference]: Without dead ends: 6986 [2020-12-23 13:56:15,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=300, Invalid=1422, Unknown=0, NotChecked=0, Total=1722 [2020-12-23 13:56:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6986 states. [2020-12-23 13:56:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6986 to 5042. [2020-12-23 13:56:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5042 states. [2020-12-23 13:56:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5042 states to 5042 states and 16138 transitions. [2020-12-23 13:56:15,299 INFO L78 Accepts]: Start accepts. Automaton has 5042 states and 16138 transitions. Word has length 27 [2020-12-23 13:56:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:15,299 INFO L481 AbstractCegarLoop]: Abstraction has 5042 states and 16138 transitions. [2020-12-23 13:56:15,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 13:56:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 5042 states and 16138 transitions. [2020-12-23 13:56:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:56:15,305 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:15,305 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-23 13:56:15,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 13:56:15,305 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:56:15,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:15,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1646528791, now seen corresponding path program 8 times [2020-12-23 13:56:15,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:15,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755212013] [2020-12-23 13:56:15,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:16,143 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-23 13:56:16,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755212013] [2020-12-23 13:56:16,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:16,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 13:56:16,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422021689] [2020-12-23 13:56:16,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 13:56:16,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:16,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 13:56:16,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-23 13:56:16,145 INFO L87 Difference]: Start difference. First operand 5042 states and 16138 transitions. Second operand 17 states. [2020-12-23 13:56:16,615 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2020-12-23 13:56:16,857 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2020-12-23 13:56:17,217 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-12-23 13:56:17,505 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-23 13:56:17,904 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2020-12-23 13:56:18,309 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-23 13:56:19,513 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2020-12-23 13:56:19,719 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2020-12-23 13:56:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:22,192 INFO L93 Difference]: Finished difference Result 7309 states and 23657 transitions. [2020-12-23 13:56:22,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-23 13:56:22,193 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-23 13:56:22,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:22,206 INFO L225 Difference]: With dead ends: 7309 [2020-12-23 13:56:22,207 INFO L226 Difference]: Without dead ends: 7309 [2020-12-23 13:56:22,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=294, Invalid=1428, Unknown=0, NotChecked=0, Total=1722 [2020-12-23 13:56:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7309 states. [2020-12-23 13:56:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7309 to 5884. [2020-12-23 13:56:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5884 states. [2020-12-23 13:56:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5884 states to 5884 states and 18941 transitions. [2020-12-23 13:56:22,363 INFO L78 Accepts]: Start accepts. Automaton has 5884 states and 18941 transitions. Word has length 27 [2020-12-23 13:56:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:22,363 INFO L481 AbstractCegarLoop]: Abstraction has 5884 states and 18941 transitions. [2020-12-23 13:56:22,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 13:56:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 5884 states and 18941 transitions. [2020-12-23 13:56:22,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:56:22,369 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:22,369 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-23 13:56:22,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 13:56:22,369 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:56:22,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:22,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1646528777, now seen corresponding path program 5 times [2020-12-23 13:56:22,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:22,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665937244] [2020-12-23 13:56:22,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:23,173 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-23 13:56:23,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665937244] [2020-12-23 13:56:23,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:23,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 13:56:23,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881412357] [2020-12-23 13:56:23,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 13:56:23,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:23,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 13:56:23,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-23 13:56:23,176 INFO L87 Difference]: Start difference. First operand 5884 states and 18941 transitions. Second operand 17 states. [2020-12-23 13:56:23,640 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2020-12-23 13:56:23,889 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2020-12-23 13:56:24,262 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-12-23 13:56:24,571 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-23 13:56:24,937 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2020-12-23 13:56:25,293 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-23 13:56:26,555 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2020-12-23 13:56:26,757 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2020-12-23 13:56:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:29,145 INFO L93 Difference]: Finished difference Result 7216 states and 23258 transitions. [2020-12-23 13:56:29,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-23 13:56:29,146 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-23 13:56:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:29,159 INFO L225 Difference]: With dead ends: 7216 [2020-12-23 13:56:29,159 INFO L226 Difference]: Without dead ends: 7216 [2020-12-23 13:56:29,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=294, Invalid=1428, Unknown=0, NotChecked=0, Total=1722 [2020-12-23 13:56:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7216 states. [2020-12-23 13:56:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7216 to 5042. [2020-12-23 13:56:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5042 states. [2020-12-23 13:56:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5042 states to 5042 states and 16138 transitions. [2020-12-23 13:56:29,244 INFO L78 Accepts]: Start accepts. Automaton has 5042 states and 16138 transitions. Word has length 27 [2020-12-23 13:56:29,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:29,245 INFO L481 AbstractCegarLoop]: Abstraction has 5042 states and 16138 transitions. [2020-12-23 13:56:29,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 13:56:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 5042 states and 16138 transitions. [2020-12-23 13:56:29,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:56:29,249 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:29,249 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-23 13:56:29,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 13:56:29,250 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:56:29,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:29,250 INFO L82 PathProgramCache]: Analyzing trace with hash 713846761, now seen corresponding path program 9 times [2020-12-23 13:56:29,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:29,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976734555] [2020-12-23 13:56:29,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:30,110 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-23 13:56:30,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976734555] [2020-12-23 13:56:30,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:30,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 13:56:30,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372503646] [2020-12-23 13:56:30,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 13:56:30,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:30,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 13:56:30,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-23 13:56:30,112 INFO L87 Difference]: Start difference. First operand 5042 states and 16138 transitions. Second operand 17 states. [2020-12-23 13:56:30,840 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2020-12-23 13:56:31,232 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2020-12-23 13:56:31,578 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2020-12-23 13:56:31,906 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2020-12-23 13:56:32,066 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2020-12-23 13:56:32,411 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2020-12-23 13:56:33,741 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2020-12-23 13:56:33,939 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2020-12-23 13:56:34,777 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2020-12-23 13:56:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:36,338 INFO L93 Difference]: Finished difference Result 7428 states and 23889 transitions. [2020-12-23 13:56:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-23 13:56:36,338 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-23 13:56:36,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:36,351 INFO L225 Difference]: With dead ends: 7428 [2020-12-23 13:56:36,351 INFO L226 Difference]: Without dead ends: 7428 [2020-12-23 13:56:36,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2020-12-23 13:56:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7428 states. [2020-12-23 13:56:36,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7428 to 5062. [2020-12-23 13:56:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5062 states. [2020-12-23 13:56:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5062 states to 5062 states and 16203 transitions. [2020-12-23 13:56:36,439 INFO L78 Accepts]: Start accepts. Automaton has 5062 states and 16203 transitions. Word has length 27 [2020-12-23 13:56:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:36,439 INFO L481 AbstractCegarLoop]: Abstraction has 5062 states and 16203 transitions. [2020-12-23 13:56:36,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 13:56:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 5062 states and 16203 transitions. [2020-12-23 13:56:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:56:36,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:36,444 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-23 13:56:36,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 13:56:36,444 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:56:36,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:36,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1551387543, now seen corresponding path program 10 times [2020-12-23 13:56:36,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:36,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200353234] [2020-12-23 13:56:36,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:37,137 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-23 13:56:37,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200353234] [2020-12-23 13:56:37,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:37,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 13:56:37,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683486390] [2020-12-23 13:56:37,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 13:56:37,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:37,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 13:56:37,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-23 13:56:37,138 INFO L87 Difference]: Start difference. First operand 5062 states and 16203 transitions. Second operand 17 states. [2020-12-23 13:56:37,786 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-23 13:56:38,066 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-23 13:56:38,510 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-23 13:56:38,878 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-23 13:56:39,233 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-23 13:56:40,250 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2020-12-23 13:56:40,441 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2020-12-23 13:56:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:42,752 INFO L93 Difference]: Finished difference Result 7059 states and 22882 transitions. [2020-12-23 13:56:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-23 13:56:42,753 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-23 13:56:42,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:42,766 INFO L225 Difference]: With dead ends: 7059 [2020-12-23 13:56:42,766 INFO L226 Difference]: Without dead ends: 7059 [2020-12-23 13:56:42,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=300, Invalid=1422, Unknown=0, NotChecked=0, Total=1722 [2020-12-23 13:56:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7059 states. [2020-12-23 13:56:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7059 to 5704. [2020-12-23 13:56:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2020-12-23 13:56:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 18386 transitions. [2020-12-23 13:56:42,861 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 18386 transitions. Word has length 27 [2020-12-23 13:56:42,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:42,861 INFO L481 AbstractCegarLoop]: Abstraction has 5704 states and 18386 transitions. [2020-12-23 13:56:42,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 13:56:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 18386 transitions. [2020-12-23 13:56:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:56:42,866 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:42,866 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-23 13:56:42,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 13:56:42,866 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:56:42,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:42,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1551387557, now seen corresponding path program 6 times [2020-12-23 13:56:42,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:42,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807102503] [2020-12-23 13:56:42,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:43,598 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-23 13:56:43,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807102503] [2020-12-23 13:56:43,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:43,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-23 13:56:43,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364325481] [2020-12-23 13:56:43,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 13:56:43,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:43,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 13:56:43,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-23 13:56:43,600 INFO L87 Difference]: Start difference. First operand 5704 states and 18386 transitions. Second operand 17 states. [2020-12-23 13:56:44,344 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-23 13:56:44,655 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-23 13:56:45,196 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-23 13:56:45,589 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-23 13:56:45,964 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-23 13:56:47,088 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2020-12-23 13:56:47,303 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2020-12-23 13:56:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:49,721 INFO L93 Difference]: Finished difference Result 6444 states and 20741 transitions. [2020-12-23 13:56:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-23 13:56:49,721 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-23 13:56:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:49,732 INFO L225 Difference]: With dead ends: 6444 [2020-12-23 13:56:49,733 INFO L226 Difference]: Without dead ends: 6444 [2020-12-23 13:56:49,733 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=300, Invalid=1422, Unknown=0, NotChecked=0, Total=1722 [2020-12-23 13:56:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6444 states. [2020-12-23 13:56:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6444 to 4682. [2020-12-23 13:56:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4682 states. [2020-12-23 13:56:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4682 states to 4682 states and 15043 transitions. [2020-12-23 13:56:49,810 INFO L78 Accepts]: Start accepts. Automaton has 4682 states and 15043 transitions. Word has length 27 [2020-12-23 13:56:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:49,811 INFO L481 AbstractCegarLoop]: Abstraction has 4682 states and 15043 transitions. [2020-12-23 13:56:49,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 13:56:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 4682 states and 15043 transitions. [2020-12-23 13:56:49,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 13:56:49,815 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:49,815 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:56:49,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-23 13:56:49,815 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:56:49,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:49,816 INFO L82 PathProgramCache]: Analyzing trace with hash 817488071, now seen corresponding path program 1 times [2020-12-23 13:56:49,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:49,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639562282] [2020-12-23 13:56:49,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:50,183 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 28 [2020-12-23 13:56:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:50,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639562282] [2020-12-23 13:56:50,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914134688] [2020-12-23 13:56:50,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 13:56:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:50,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 72 conjunts are in the unsatisfiable core [2020-12-23 13:56:50,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 13:56:50,731 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 79 [2020-12-23 13:56:50,740 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 13:56:50,814 INFO L625 ElimStorePlain]: treesize reduction 26, result has 70.1 percent of original size [2020-12-23 13:56:50,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:56:50,830 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2020-12-23 13:56:50,831 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 13:56:50,857 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:56:50,864 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 13:56:50,865 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:64, output treesize:35 [2020-12-23 13:56:51,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:56:51,071 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:56:51,071 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 64 [2020-12-23 13:56:51,075 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 13:56:51,145 INFO L625 ElimStorePlain]: treesize reduction 16, result has 77.8 percent of original size [2020-12-23 13:56:51,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:56:51,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:51,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:56:51,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:51,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:56:51,191 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 13:56:51,192 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:52 [2020-12-23 13:56:51,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:56:51,203 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:51,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:56:51,213 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:51,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:56:53,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:56:53,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:53,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:56:53,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:56:53,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:53,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:56:53,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:56:53,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:56:53,793 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 13:56:53,829 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:56:53,829 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2020-12-23 13:56:53,834 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 13:56:53,891 INFO L625 ElimStorePlain]: treesize reduction 20, result has 71.0 percent of original size [2020-12-23 13:56:53,893 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 13:56:53,894 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:46 [2020-12-23 13:56:54,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:54,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:56:54,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:54,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 13:56:54,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:54,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:54,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:56:54,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:54,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 13:56:54,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:54,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:54,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 13:56:54,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:54,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:56:54,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:54,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:54,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:56:54,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:56:54,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:56:54,130 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2020-12-23 13:56:54,133 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 13:56:54,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:56:54,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:56:54,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:56:54,177 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2020-12-23 13:56:54,180 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 13:56:54,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:56:54,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:56:54,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:56:54,204 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2020-12-23 13:56:54,207 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 13:56:54,308 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-23 13:56:54,309 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:56:54,318 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2020-12-23 13:56:54,319 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:194, output treesize:267 [2020-12-23 13:56:54,632 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2020-12-23 13:56:55,374 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 1] term [2020-12-23 13:56:55,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:56:55,419 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:56:55,420 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2020-12-23 13:56:55,424 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 13:56:55,463 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:56:55,489 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:56:55,490 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 67 [2020-12-23 13:56:55,498 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 13:56:55,514 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:56:55,517 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 13:56:55,517 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:136, output treesize:3 [2020-12-23 13:56:55,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:55,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 13:56:55,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2020-12-23 13:56:55,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188289532] [2020-12-23 13:56:55,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-23 13:56:55,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:55,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-23 13:56:55,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=631, Unknown=1, NotChecked=0, Total=702 [2020-12-23 13:56:55,540 INFO L87 Difference]: Start difference. First operand 4682 states and 15043 transitions. Second operand 27 states. [2020-12-23 13:56:56,392 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2020-12-23 13:56:56,705 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 48 [2020-12-23 13:56:57,243 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 48 [2020-12-23 13:56:57,675 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2020-12-23 13:56:58,304 WARN L197 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 79 [2020-12-23 13:56:58,511 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2020-12-23 13:56:59,121 WARN L197 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 75 [2020-12-23 13:56:59,354 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-12-23 13:57:00,057 WARN L197 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2020-12-23 13:57:00,608 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-12-23 13:57:03,193 WARN L197 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 109 [2020-12-23 13:57:03,637 WARN L197 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-23 13:57:04,561 WARN L197 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 136 [2020-12-23 13:57:05,268 WARN L197 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2020-12-23 13:57:06,291 WARN L197 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 138 [2020-12-23 13:57:07,130 WARN L197 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2020-12-23 13:57:07,839 WARN L197 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 111 [2020-12-23 13:57:08,543 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-23 13:57:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:57:11,033 INFO L93 Difference]: Finished difference Result 7848 states and 25655 transitions. [2020-12-23 13:57:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-23 13:57:11,034 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 29 [2020-12-23 13:57:11,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:57:11,046 INFO L225 Difference]: With dead ends: 7848 [2020-12-23 13:57:11,046 INFO L226 Difference]: Without dead ends: 7848 [2020-12-23 13:57:11,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=362, Invalid=1799, Unknown=1, NotChecked=0, Total=2162 [2020-12-23 13:57:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7848 states. [2020-12-23 13:57:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7848 to 5232. [2020-12-23 13:57:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5232 states. [2020-12-23 13:57:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5232 states to 5232 states and 16989 transitions. [2020-12-23 13:57:11,196 INFO L78 Accepts]: Start accepts. Automaton has 5232 states and 16989 transitions. Word has length 29 [2020-12-23 13:57:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:57:11,199 INFO L481 AbstractCegarLoop]: Abstraction has 5232 states and 16989 transitions. [2020-12-23 13:57:11,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-23 13:57:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 5232 states and 16989 transitions. [2020-12-23 13:57:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 13:57:11,207 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:57:11,207 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:57:11,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2020-12-23 13:57:11,422 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:57:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:57:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash 817488057, now seen corresponding path program 1 times [2020-12-23 13:57:11,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:57:11,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675318646] [2020-12-23 13:57:11,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:57:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:57:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:57:12,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675318646] [2020-12-23 13:57:12,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732499129] [2020-12-23 13:57:12,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 13:57:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:57:12,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 70 conjunts are in the unsatisfiable core [2020-12-23 13:57:12,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 13:57:12,527 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 79 [2020-12-23 13:57:12,530 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 13:57:12,609 INFO L625 ElimStorePlain]: treesize reduction 26, result has 70.1 percent of original size [2020-12-23 13:57:12,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:57:12,622 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2020-12-23 13:57:12,623 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 13:57:12,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:57:12,651 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 13:57:12,651 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:64, output treesize:35 [2020-12-23 13:57:12,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:57:12,862 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:57:12,863 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 64 [2020-12-23 13:57:12,866 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 13:57:12,950 INFO L625 ElimStorePlain]: treesize reduction 16, result has 77.8 percent of original size [2020-12-23 13:57:12,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:57:12,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:12,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:57:12,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:12,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:57:12,966 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-23 13:57:12,966 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:52 [2020-12-23 13:57:12,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:57:12,971 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:12,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:57:12,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:12,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:57:19,061 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 37 [2020-12-23 13:57:19,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:57:19,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:19,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:57:19,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:57:19,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:19,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:57:19,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:57:19,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:57:19,550 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-23 13:57:19,597 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:57:19,598 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2020-12-23 13:57:19,602 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 13:57:19,677 INFO L625 ElimStorePlain]: treesize reduction 20, result has 71.0 percent of original size [2020-12-23 13:57:19,680 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 13:57:19,680 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:46 [2020-12-23 13:57:19,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:19,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:57:19,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:19,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 13:57:19,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:19,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:19,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:57:19,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:19,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 13:57:19,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:19,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:19,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 13:57:19,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:19,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:57:19,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:19,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:19,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:57:19,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:57:19,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:57:19,913 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2020-12-23 13:57:19,917 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 13:57:19,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:57:19,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:57:19,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:57:19,973 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2020-12-23 13:57:19,977 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 13:57:19,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:57:19,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:57:19,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 13:57:20,004 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2020-12-23 13:57:20,008 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 13:57:20,139 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-23 13:57:20,140 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:57:20,197 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2020-12-23 13:57:20,197 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:194, output treesize:267 [2020-12-23 13:57:20,513 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2020-12-23 13:57:21,252 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-12-23 13:57:21,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 1] term [2020-12-23 13:57:21,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:57:21,308 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:57:21,309 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 67 [2020-12-23 13:57:21,315 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 13:57:21,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:57:21,383 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:57:21,384 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2020-12-23 13:57:21,388 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 13:57:21,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 13:57:21,407 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 13:57:21,408 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:136, output treesize:3 [2020-12-23 13:57:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:57:21,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 13:57:21,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 26 [2020-12-23 13:57:21,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50809188] [2020-12-23 13:57:21,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-23 13:57:21,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:57:21,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-23 13:57:21,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=686, Unknown=2, NotChecked=0, Total=756 [2020-12-23 13:57:21,490 INFO L87 Difference]: Start difference. First operand 5232 states and 16989 transitions. Second operand 28 states. [2020-12-23 13:57:25,836 WARN L197 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2020-12-23 13:57:26,197 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2020-12-23 13:57:26,533 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 42 [2020-12-23 13:57:26,914 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2020-12-23 13:57:27,637 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2020-12-23 13:57:28,200 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-12-23 13:57:30,919 WARN L197 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 75 [2020-12-23 13:57:31,179 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 46