/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 11:40:29,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 11:40:29,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 11:40:29,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 11:40:29,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 11:40:29,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 11:40:29,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 11:40:29,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 11:40:29,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 11:40:29,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 11:40:29,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 11:40:29,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 11:40:29,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 11:40:29,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 11:40:29,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 11:40:29,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 11:40:29,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 11:40:29,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 11:40:29,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 11:40:29,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 11:40:29,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 11:40:29,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 11:40:29,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 11:40:29,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 11:40:29,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 11:40:29,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 11:40:29,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 11:40:29,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 11:40:29,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 11:40:29,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 11:40:29,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 11:40:29,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 11:40:29,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 11:40:29,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 11:40:29,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 11:40:29,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 11:40:29,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 11:40:29,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 11:40:29,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 11:40:29,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 11:40:29,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 11:40:29,239 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-08-21 11:40:29,258 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 11:40:29,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 11:40:29,258 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-21 11:40:29,258 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-21 11:40:29,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 11:40:29,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 11:40:29,259 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 11:40:29,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 11:40:29,259 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 11:40:29,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 11:40:29,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 11:40:29,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 11:40:29,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 11:40:29,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 11:40:29,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 11:40:29,260 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 11:40:29,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 11:40:29,260 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 11:40:29,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 11:40:29,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 11:40:29,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 11:40:29,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 11:40:29,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 11:40:29,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:40:29,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 11:40:29,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 11:40:29,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 11:40:29,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 11:40:29,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 11:40:29,261 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 11:40:29,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 11:40:29,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-21 11:40:29,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 11:40:29,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 11:40:29,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 11:40:29,539 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 11:40:29,540 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 11:40:29,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i [2021-08-21 11:40:29,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5ae19da/3e3bce542e4b4537b0e2bbb0724f3394/FLAGf87e20423 [2021-08-21 11:40:30,150 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 11:40:30,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i [2021-08-21 11:40:30,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5ae19da/3e3bce542e4b4537b0e2bbb0724f3394/FLAGf87e20423 [2021-08-21 11:40:30,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5ae19da/3e3bce542e4b4537b0e2bbb0724f3394 [2021-08-21 11:40:30,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 11:40:30,619 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 11:40:30,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 11:40:30,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 11:40:30,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 11:40:30,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:40:30" (1/1) ... [2021-08-21 11:40:30,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66030f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:40:30, skipping insertion in model container [2021-08-21 11:40:30,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:40:30" (1/1) ... [2021-08-21 11:40:30,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 11:40:30,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 11:40:30,763 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i[949,962] [2021-08-21 11:40:30,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:40:30,915 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 11:40:30,926 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i[949,962] [2021-08-21 11:40:30,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 11:40:30,992 INFO L208 MainTranslator]: Completed translation [2021-08-21 11:40:30,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:40:30 WrapperNode [2021-08-21 11:40:30,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 11:40:30,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 11:40:30,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 11:40:30,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 11:40:30,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:40:30" (1/1) ... [2021-08-21 11:40:31,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:40:30" (1/1) ... [2021-08-21 11:40:31,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 11:40:31,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 11:40:31,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 11:40:31,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 11:40:31,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:40:30" (1/1) ... [2021-08-21 11:40:31,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:40:30" (1/1) ... [2021-08-21 11:40:31,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:40:30" (1/1) ... [2021-08-21 11:40:31,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:40:30" (1/1) ... [2021-08-21 11:40:31,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:40:30" (1/1) ... [2021-08-21 11:40:31,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:40:30" (1/1) ... [2021-08-21 11:40:31,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:40:30" (1/1) ... [2021-08-21 11:40:31,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 11:40:31,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 11:40:31,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 11:40:31,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 11:40:31,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:40:30" (1/1) ... [2021-08-21 11:40:31,066 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 11:40:31,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 11:40:31,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-21 11:40:31,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-21 11:40:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 11:40:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-21 11:40:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 11:40:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 11:40:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-21 11:40:31,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-21 11:40:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-21 11:40:31,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-21 11:40:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-21 11:40:31,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-21 11:40:31,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 11:40:31,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-21 11:40:31,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 11:40:31,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 11:40:31,122 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 11:40:32,518 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 11:40:32,519 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-21 11:40:32,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:40:32 BoogieIcfgContainer [2021-08-21 11:40:32,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 11:40:32,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 11:40:32,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 11:40:32,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 11:40:32,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 11:40:30" (1/3) ... [2021-08-21 11:40:32,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e227e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:40:32, skipping insertion in model container [2021-08-21 11:40:32,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:40:30" (2/3) ... [2021-08-21 11:40:32,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e227e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:40:32, skipping insertion in model container [2021-08-21 11:40:32,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:40:32" (3/3) ... [2021-08-21 11:40:32,525 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_pso.opt.i [2021-08-21 11:40:32,528 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 11:40:32,528 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 11:40:32,528 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-21 11:40:32,528 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 11:40:32,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,552 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,552 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,553 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,553 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,555 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,555 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,556 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,556 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,556 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,556 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,556 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,556 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,559 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,559 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,559 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,559 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,563 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,564 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,564 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,567 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,567 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,567 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,569 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,569 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 11:40:32,571 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-21 11:40:32,596 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 11:40:32,599 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-21 11:40:32,599 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-21 11:40:32,606 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-08-21 11:40:32,918 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 11927 states, 11924 states have (on average 3.562646762831265) internal successors, (42481), 11926 states have internal predecessors, (42481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 11927 states, 11924 states have (on average 3.562646762831265) internal successors, (42481), 11926 states have internal predecessors, (42481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-21 11:40:32,958 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:32,959 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:32,960 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:32,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:32,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1756318615, now seen corresponding path program 1 times [2021-08-21 11:40:32,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:32,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305281658] [2021-08-21 11:40:32,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:32,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:40:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:40:33,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:40:33,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305281658] [2021-08-21 11:40:33,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305281658] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:40:33,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:40:33,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-21 11:40:33,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239272457] [2021-08-21 11:40:33,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 11:40:33,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:40:33,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 11:40:33,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 11:40:33,245 INFO L87 Difference]: Start difference. First operand has 11927 states, 11924 states have (on average 3.562646762831265) internal successors, (42481), 11926 states have internal predecessors, (42481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:40:33,450 INFO L93 Difference]: Finished difference Result 10015 states and 34720 transitions. [2021-08-21 11:40:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 11:40:33,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-08-21 11:40:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:40:33,556 INFO L225 Difference]: With dead ends: 10015 [2021-08-21 11:40:33,556 INFO L226 Difference]: Without dead ends: 8223 [2021-08-21 11:40:33,557 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 11:40:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8223 states. [2021-08-21 11:40:33,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8223 to 8223. [2021-08-21 11:40:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8223 states, 8222 states have (on average 3.4911213816589637) internal successors, (28704), 8222 states have internal predecessors, (28704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8223 states to 8223 states and 28704 transitions. [2021-08-21 11:40:33,942 INFO L78 Accepts]: Start accepts. Automaton has 8223 states and 28704 transitions. Word has length 48 [2021-08-21 11:40:33,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:40:33,943 INFO L470 AbstractCegarLoop]: Abstraction has 8223 states and 28704 transitions. [2021-08-21 11:40:33,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 8223 states and 28704 transitions. [2021-08-21 11:40:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-21 11:40:33,959 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:33,959 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:33,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 11:40:33,959 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:33,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:33,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2046366058, now seen corresponding path program 1 times [2021-08-21 11:40:33,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:33,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580905966] [2021-08-21 11:40:33,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:33,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:40:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:40:34,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:40:34,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580905966] [2021-08-21 11:40:34,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580905966] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:40:34,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:40:34,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:40:34,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890430529] [2021-08-21 11:40:34,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:40:34,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:40:34,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:40:34,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:40:34,147 INFO L87 Difference]: Start difference. First operand 8223 states and 28704 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:40:34,363 INFO L93 Difference]: Finished difference Result 9503 states and 32864 transitions. [2021-08-21 11:40:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:40:34,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-08-21 11:40:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:40:34,404 INFO L225 Difference]: With dead ends: 9503 [2021-08-21 11:40:34,404 INFO L226 Difference]: Without dead ends: 7455 [2021-08-21 11:40:34,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 69.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:40:34,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7455 states. [2021-08-21 11:40:34,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7455 to 7455. [2021-08-21 11:40:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7455 states, 7454 states have (on average 3.464448618191575) internal successors, (25824), 7454 states have internal predecessors, (25824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 25824 transitions. [2021-08-21 11:40:34,675 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 25824 transitions. Word has length 67 [2021-08-21 11:40:34,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:40:34,676 INFO L470 AbstractCegarLoop]: Abstraction has 7455 states and 25824 transitions. [2021-08-21 11:40:34,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 25824 transitions. [2021-08-21 11:40:34,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-21 11:40:34,687 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:34,687 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:34,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 11:40:34,688 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:34,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:34,688 INFO L82 PathProgramCache]: Analyzing trace with hash 307498057, now seen corresponding path program 1 times [2021-08-21 11:40:34,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:34,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402030997] [2021-08-21 11:40:34,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:34,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:40:34,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:40:34,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:40:34,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402030997] [2021-08-21 11:40:34,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402030997] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:40:34,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:40:34,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 11:40:34,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373164151] [2021-08-21 11:40:34,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 11:40:34,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:40:34,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 11:40:34,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-21 11:40:34,870 INFO L87 Difference]: Start difference. First operand 7455 states and 25824 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:35,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:40:35,109 INFO L93 Difference]: Finished difference Result 10287 states and 35462 transitions. [2021-08-21 11:40:35,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 11:40:35,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-08-21 11:40:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:40:35,125 INFO L225 Difference]: With dead ends: 10287 [2021-08-21 11:40:35,126 INFO L226 Difference]: Without dead ends: 5295 [2021-08-21 11:40:35,126 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 109.7ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-21 11:40:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2021-08-21 11:40:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5295. [2021-08-21 11:40:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5295 states, 5294 states have (on average 3.3513411409142426) internal successors, (17742), 5294 states have internal predecessors, (17742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5295 states to 5295 states and 17742 transitions. [2021-08-21 11:40:35,237 INFO L78 Accepts]: Start accepts. Automaton has 5295 states and 17742 transitions. Word has length 69 [2021-08-21 11:40:35,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:40:35,238 INFO L470 AbstractCegarLoop]: Abstraction has 5295 states and 17742 transitions. [2021-08-21 11:40:35,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5295 states and 17742 transitions. [2021-08-21 11:40:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-21 11:40:35,246 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:35,246 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:35,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 11:40:35,246 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:35,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:35,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1557851838, now seen corresponding path program 1 times [2021-08-21 11:40:35,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:35,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661207309] [2021-08-21 11:40:35,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:35,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:40:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:40:35,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:40:35,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661207309] [2021-08-21 11:40:35,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661207309] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:40:35,366 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:40:35,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:40:35,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79319747] [2021-08-21 11:40:35,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:40:35,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:40:35,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:40:35,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:40:35,368 INFO L87 Difference]: Start difference. First operand 5295 states and 17742 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:40:35,551 INFO L93 Difference]: Finished difference Result 6195 states and 20652 transitions. [2021-08-21 11:40:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:40:35,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-21 11:40:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:40:35,567 INFO L225 Difference]: With dead ends: 6195 [2021-08-21 11:40:35,568 INFO L226 Difference]: Without dead ends: 5235 [2021-08-21 11:40:35,569 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 88.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:40:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5235 states. [2021-08-21 11:40:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5235 to 5235. [2021-08-21 11:40:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5235 states, 5234 states have (on average 3.34619793656859) internal successors, (17514), 5234 states have internal predecessors, (17514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5235 states to 5235 states and 17514 transitions. [2021-08-21 11:40:35,691 INFO L78 Accepts]: Start accepts. Automaton has 5235 states and 17514 transitions. Word has length 72 [2021-08-21 11:40:35,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:40:35,691 INFO L470 AbstractCegarLoop]: Abstraction has 5235 states and 17514 transitions. [2021-08-21 11:40:35,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:35,691 INFO L276 IsEmpty]: Start isEmpty. Operand 5235 states and 17514 transitions. [2021-08-21 11:40:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-21 11:40:35,700 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:35,700 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:35,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 11:40:35,700 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:35,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:35,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1942630598, now seen corresponding path program 1 times [2021-08-21 11:40:35,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:35,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257991721] [2021-08-21 11:40:35,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:35,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:40:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:40:35,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:40:35,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257991721] [2021-08-21 11:40:35,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257991721] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:40:35,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:40:35,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:40:35,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580473029] [2021-08-21 11:40:35,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:40:35,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:40:35,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:40:35,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:40:35,889 INFO L87 Difference]: Start difference. First operand 5235 states and 17514 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:40:36,017 INFO L93 Difference]: Finished difference Result 8585 states and 28549 transitions. [2021-08-21 11:40:36,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:40:36,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-21 11:40:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:40:36,035 INFO L225 Difference]: With dead ends: 8585 [2021-08-21 11:40:36,035 INFO L226 Difference]: Without dead ends: 5835 [2021-08-21 11:40:36,036 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 77.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:40:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2021-08-21 11:40:36,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 4935. [2021-08-21 11:40:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4935 states, 4934 states have (on average 3.2760437778678555) internal successors, (16164), 4934 states have internal predecessors, (16164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4935 states to 4935 states and 16164 transitions. [2021-08-21 11:40:36,188 INFO L78 Accepts]: Start accepts. Automaton has 4935 states and 16164 transitions. Word has length 73 [2021-08-21 11:40:36,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:40:36,189 INFO L470 AbstractCegarLoop]: Abstraction has 4935 states and 16164 transitions. [2021-08-21 11:40:36,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4935 states and 16164 transitions. [2021-08-21 11:40:36,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-21 11:40:36,198 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:36,198 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:36,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 11:40:36,199 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:36,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:36,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1771214207, now seen corresponding path program 1 times [2021-08-21 11:40:36,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:36,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13609064] [2021-08-21 11:40:36,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:36,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:40:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:40:36,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:40:36,420 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13609064] [2021-08-21 11:40:36,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13609064] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:40:36,420 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:40:36,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 11:40:36,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21460435] [2021-08-21 11:40:36,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 11:40:36,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:40:36,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 11:40:36,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-21 11:40:36,421 INFO L87 Difference]: Start difference. First operand 4935 states and 16164 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:40:36,722 INFO L93 Difference]: Finished difference Result 5643 states and 18434 transitions. [2021-08-21 11:40:36,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 11:40:36,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-21 11:40:36,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:40:36,735 INFO L225 Difference]: With dead ends: 5643 [2021-08-21 11:40:36,736 INFO L226 Difference]: Without dead ends: 4923 [2021-08-21 11:40:36,736 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 104.6ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-08-21 11:40:36,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4923 states. [2021-08-21 11:40:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4923 to 4923. [2021-08-21 11:40:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4923 states, 4922 states have (on average 3.2742787484762292) internal successors, (16116), 4922 states have internal predecessors, (16116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4923 states to 4923 states and 16116 transitions. [2021-08-21 11:40:36,855 INFO L78 Accepts]: Start accepts. Automaton has 4923 states and 16116 transitions. Word has length 74 [2021-08-21 11:40:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:40:36,855 INFO L470 AbstractCegarLoop]: Abstraction has 4923 states and 16116 transitions. [2021-08-21 11:40:36,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4923 states and 16116 transitions. [2021-08-21 11:40:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-21 11:40:36,865 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:36,865 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:36,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 11:40:36,866 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:36,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1624812746, now seen corresponding path program 1 times [2021-08-21 11:40:36,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:36,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78680318] [2021-08-21 11:40:36,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:36,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:40:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:40:37,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:40:37,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78680318] [2021-08-21 11:40:37,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78680318] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:40:37,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:40:37,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-21 11:40:37,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713708077] [2021-08-21 11:40:37,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-21 11:40:37,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:40:37,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-21 11:40:37,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-21 11:40:37,038 INFO L87 Difference]: Start difference. First operand 4923 states and 16116 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:40:37,279 INFO L93 Difference]: Finished difference Result 6112 states and 20044 transitions. [2021-08-21 11:40:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 11:40:37,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-21 11:40:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:40:37,295 INFO L225 Difference]: With dead ends: 6112 [2021-08-21 11:40:37,295 INFO L226 Difference]: Without dead ends: 5512 [2021-08-21 11:40:37,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 96.7ms TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-08-21 11:40:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5512 states. [2021-08-21 11:40:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5512 to 4986. [2021-08-21 11:40:37,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4986 states, 4985 states have (on average 3.274824473420261) internal successors, (16325), 4985 states have internal predecessors, (16325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 16325 transitions. [2021-08-21 11:40:37,428 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 16325 transitions. Word has length 75 [2021-08-21 11:40:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:40:37,428 INFO L470 AbstractCegarLoop]: Abstraction has 4986 states and 16325 transitions. [2021-08-21 11:40:37,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:37,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 16325 transitions. [2021-08-21 11:40:37,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-21 11:40:37,440 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:37,440 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:37,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 11:40:37,440 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:37,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:37,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1147561520, now seen corresponding path program 2 times [2021-08-21 11:40:37,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:37,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362901949] [2021-08-21 11:40:37,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:37,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:40:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:40:37,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:40:37,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362901949] [2021-08-21 11:40:37,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362901949] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:40:37,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:40:37,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-21 11:40:37,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096221599] [2021-08-21 11:40:37,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-21 11:40:37,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:40:37,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-21 11:40:37,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:40:37,692 INFO L87 Difference]: Start difference. First operand 4986 states and 16325 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:38,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:40:38,024 INFO L93 Difference]: Finished difference Result 5591 states and 18249 transitions. [2021-08-21 11:40:38,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 11:40:38,025 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-21 11:40:38,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:40:38,038 INFO L225 Difference]: With dead ends: 5591 [2021-08-21 11:40:38,038 INFO L226 Difference]: Without dead ends: 4991 [2021-08-21 11:40:38,038 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 174.4ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-08-21 11:40:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2021-08-21 11:40:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4982. [2021-08-21 11:40:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4982 states, 4981 states have (on average 3.2754466974503114) internal successors, (16315), 4981 states have internal predecessors, (16315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 16315 transitions. [2021-08-21 11:40:38,162 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 16315 transitions. Word has length 75 [2021-08-21 11:40:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:40:38,163 INFO L470 AbstractCegarLoop]: Abstraction has 4982 states and 16315 transitions. [2021-08-21 11:40:38,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 16315 transitions. [2021-08-21 11:40:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-21 11:40:38,172 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:38,172 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:38,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 11:40:38,172 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:38,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:38,173 INFO L82 PathProgramCache]: Analyzing trace with hash 379011794, now seen corresponding path program 3 times [2021-08-21 11:40:38,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:38,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860830869] [2021-08-21 11:40:38,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:38,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:40:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:40:38,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:40:38,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860830869] [2021-08-21 11:40:38,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860830869] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:40:38,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:40:38,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 11:40:38,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446835724] [2021-08-21 11:40:38,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 11:40:38,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:40:38,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 11:40:38,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-21 11:40:38,303 INFO L87 Difference]: Start difference. First operand 4982 states and 16315 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:40:38,509 INFO L93 Difference]: Finished difference Result 6202 states and 20345 transitions. [2021-08-21 11:40:38,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 11:40:38,510 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-21 11:40:38,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:40:38,522 INFO L225 Difference]: With dead ends: 6202 [2021-08-21 11:40:38,523 INFO L226 Difference]: Without dead ends: 5490 [2021-08-21 11:40:38,523 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 105.0ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-08-21 11:40:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5490 states. [2021-08-21 11:40:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5490 to 5263. [2021-08-21 11:40:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5263 states, 5262 states have (on average 3.2786012922843026) internal successors, (17252), 5262 states have internal predecessors, (17252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 17252 transitions. [2021-08-21 11:40:38,659 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 17252 transitions. Word has length 75 [2021-08-21 11:40:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:40:38,659 INFO L470 AbstractCegarLoop]: Abstraction has 5263 states and 17252 transitions. [2021-08-21 11:40:38,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 17252 transitions. [2021-08-21 11:40:38,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-21 11:40:38,671 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:38,671 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:38,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 11:40:38,672 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:38,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:38,672 INFO L82 PathProgramCache]: Analyzing trace with hash -978550209, now seen corresponding path program 1 times [2021-08-21 11:40:38,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:38,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138970085] [2021-08-21 11:40:38,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:38,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:40:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:40:38,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:40:38,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138970085] [2021-08-21 11:40:38,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138970085] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:40:38,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:40:38,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 11:40:38,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641109457] [2021-08-21 11:40:38,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 11:40:38,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:40:38,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 11:40:38,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 11:40:38,762 INFO L87 Difference]: Start difference. First operand 5263 states and 17252 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:40:38,855 INFO L93 Difference]: Finished difference Result 6279 states and 20246 transitions. [2021-08-21 11:40:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 11:40:38,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-21 11:40:38,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:40:38,866 INFO L225 Difference]: With dead ends: 6279 [2021-08-21 11:40:38,866 INFO L226 Difference]: Without dead ends: 4663 [2021-08-21 11:40:38,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 54.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 11:40:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2021-08-21 11:40:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4663. [2021-08-21 11:40:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4663 states, 4662 states have (on average 3.214071214071214) internal successors, (14984), 4662 states have internal predecessors, (14984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 14984 transitions. [2021-08-21 11:40:38,950 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 14984 transitions. Word has length 75 [2021-08-21 11:40:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:40:38,950 INFO L470 AbstractCegarLoop]: Abstraction has 4663 states and 14984 transitions. [2021-08-21 11:40:38,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 14984 transitions. [2021-08-21 11:40:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 11:40:38,957 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:38,957 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:38,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 11:40:38,958 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:38,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:38,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1767377440, now seen corresponding path program 1 times [2021-08-21 11:40:38,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:38,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055005304] [2021-08-21 11:40:38,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:38,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:40:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:40:39,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:40:39,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055005304] [2021-08-21 11:40:39,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055005304] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:40:39,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:40:39,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 11:40:39,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721837106] [2021-08-21 11:40:39,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 11:40:39,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:40:39,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 11:40:39,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-21 11:40:39,029 INFO L87 Difference]: Start difference. First operand 4663 states and 14984 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:39,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:40:39,125 INFO L93 Difference]: Finished difference Result 4513 states and 14080 transitions. [2021-08-21 11:40:39,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 11:40:39,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-21 11:40:39,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:40:39,133 INFO L225 Difference]: With dead ends: 4513 [2021-08-21 11:40:39,133 INFO L226 Difference]: Without dead ends: 3241 [2021-08-21 11:40:39,133 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 61.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-21 11:40:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2021-08-21 11:40:39,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3153. [2021-08-21 11:40:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3153 states, 3152 states have (on average 3.0653553299492384) internal successors, (9662), 3152 states have internal predecessors, (9662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3153 states to 3153 states and 9662 transitions. [2021-08-21 11:40:39,188 INFO L78 Accepts]: Start accepts. Automaton has 3153 states and 9662 transitions. Word has length 76 [2021-08-21 11:40:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:40:39,189 INFO L470 AbstractCegarLoop]: Abstraction has 3153 states and 9662 transitions. [2021-08-21 11:40:39,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:39,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3153 states and 9662 transitions. [2021-08-21 11:40:39,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-21 11:40:39,194 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:39,194 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:39,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 11:40:39,194 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:39,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:39,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1783083272, now seen corresponding path program 1 times [2021-08-21 11:40:39,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:39,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231124118] [2021-08-21 11:40:39,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:39,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:40:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 11:40:39,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:40:39,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231124118] [2021-08-21 11:40:39,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231124118] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:40:39,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:40:39,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-21 11:40:39,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258135610] [2021-08-21 11:40:39,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-21 11:40:39,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:40:39,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-21 11:40:39,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-21 11:40:39,285 INFO L87 Difference]: Start difference. First operand 3153 states and 9662 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:40:39,387 INFO L93 Difference]: Finished difference Result 2595 states and 7757 transitions. [2021-08-21 11:40:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 11:40:39,387 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-08-21 11:40:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:40:39,390 INFO L225 Difference]: With dead ends: 2595 [2021-08-21 11:40:39,390 INFO L226 Difference]: Without dead ends: 1263 [2021-08-21 11:40:39,391 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 78.3ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-21 11:40:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2021-08-21 11:40:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1215. [2021-08-21 11:40:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1214 states have (on average 2.9209225700164745) internal successors, (3546), 1214 states have internal predecessors, (3546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 3546 transitions. [2021-08-21 11:40:39,410 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 3546 transitions. Word has length 79 [2021-08-21 11:40:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:40:39,410 INFO L470 AbstractCegarLoop]: Abstraction has 1215 states and 3546 transitions. [2021-08-21 11:40:39,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 3546 transitions. [2021-08-21 11:40:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-21 11:40:39,412 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:39,412 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:39,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 11:40:39,413 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:39,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:39,413 INFO L82 PathProgramCache]: Analyzing trace with hash -841738577, now seen corresponding path program 1 times [2021-08-21 11:40:39,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:39,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800174360] [2021-08-21 11:40:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:39,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 11:40: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. [2021-08-21 11:40:39,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 11:40:39,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800174360] [2021-08-21 11:40:39,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800174360] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 11:40:39,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 11:40:39,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-21 11:40:39,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722832923] [2021-08-21 11:40:39,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-21 11:40:39,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 11:40:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-21 11:40:39,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-08-21 11:40:39,612 INFO L87 Difference]: Start difference. First operand 1215 states and 3546 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 11:40:39,773 INFO L93 Difference]: Finished difference Result 1785 states and 5261 transitions. [2021-08-21 11:40:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 11:40:39,773 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-08-21 11:40:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 11:40:39,775 INFO L225 Difference]: With dead ends: 1785 [2021-08-21 11:40:39,775 INFO L226 Difference]: Without dead ends: 907 [2021-08-21 11:40:39,776 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 142.6ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-08-21 11:40:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2021-08-21 11:40:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907. [2021-08-21 11:40:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 2.8189845474613686) internal successors, (2554), 906 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 2554 transitions. [2021-08-21 11:40:39,788 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 2554 transitions. Word has length 82 [2021-08-21 11:40:39,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 11:40:39,788 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 2554 transitions. [2021-08-21 11:40:39,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 11:40:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 2554 transitions. [2021-08-21 11:40:39,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-21 11:40:39,790 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 11:40:39,790 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 11:40:39,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 11:40:39,790 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 11:40:39,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 11:40:39,791 INFO L82 PathProgramCache]: Analyzing trace with hash -498352465, now seen corresponding path program 2 times [2021-08-21 11:40:39,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 11:40:39,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189000129] [2021-08-21 11:40:39,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 11:40:39,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 11:40:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 11:40:39,815 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 11:40:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 11:40:39,869 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 11:40:39,869 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 11:40:39,870 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:40:39,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:40:39,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 11:40:39,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 11:40:39,872 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-21 11:40:39,872 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 11:40:39,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-21 11:40:39,877 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 11:40:39,877 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 11:40:39,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 11:40:39 BasicIcfg [2021-08-21 11:40:39,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 11:40:39,955 INFO L168 Benchmark]: Toolchain (without parser) took 9336.36 ms. Allocated memory was 180.4 MB in the beginning and 1.0 GB in the end (delta: 868.2 MB). Free memory was 144.5 MB in the beginning and 325.4 MB in the end (delta: -180.9 MB). Peak memory consumption was 687.7 MB. Max. memory is 8.0 GB. [2021-08-21 11:40:39,956 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 180.4 MB. Free memory is still 162.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 11:40:39,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.05 ms. Allocated memory is still 180.4 MB. Free memory was 144.3 MB in the beginning and 151.5 MB in the end (delta: -7.2 MB). Peak memory consumption was 17.0 MB. Max. memory is 8.0 GB. [2021-08-21 11:40:39,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.04 ms. Allocated memory is still 180.4 MB. Free memory was 151.5 MB in the beginning and 148.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:40:39,956 INFO L168 Benchmark]: Boogie Preprocessor took 21.64 ms. Allocated memory is still 180.4 MB. Free memory was 148.3 MB in the beginning and 146.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 11:40:39,956 INFO L168 Benchmark]: RCFGBuilder took 1458.81 ms. Allocated memory was 180.4 MB in the beginning and 217.1 MB in the end (delta: 36.7 MB). Free memory was 146.2 MB in the beginning and 149.9 MB in the end (delta: -3.6 MB). Peak memory consumption was 89.2 MB. Max. memory is 8.0 GB. [2021-08-21 11:40:39,957 INFO L168 Benchmark]: TraceAbstraction took 7433.09 ms. Allocated memory was 217.1 MB in the beginning and 1.0 GB in the end (delta: 831.5 MB). Free memory was 149.4 MB in the beginning and 325.4 MB in the end (delta: -176.0 MB). Peak memory consumption was 655.0 MB. Max. memory is 8.0 GB. [2021-08-21 11:40:39,958 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 180.4 MB. Free memory is still 162.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 373.05 ms. Allocated memory is still 180.4 MB. Free memory was 144.3 MB in the beginning and 151.5 MB in the end (delta: -7.2 MB). Peak memory consumption was 17.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 46.04 ms. Allocated memory is still 180.4 MB. Free memory was 151.5 MB in the beginning and 148.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 21.64 ms. Allocated memory is still 180.4 MB. Free memory was 148.3 MB in the beginning and 146.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1458.81 ms. Allocated memory was 180.4 MB in the beginning and 217.1 MB in the end (delta: 36.7 MB). Free memory was 146.2 MB in the beginning and 149.9 MB in the end (delta: -3.6 MB). Peak memory consumption was 89.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7433.09 ms. Allocated memory was 217.1 MB in the beginning and 1.0 GB in the end (delta: 831.5 MB). Free memory was 149.4 MB in the beginning and 325.4 MB in the end (delta: -176.0 MB). Peak memory consumption was 655.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L717] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L718] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L719] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L720] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L721] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L726] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L727] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L728] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L729] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L730] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L731] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L733] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] 0 pthread_t t2034; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t2034, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2035; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t2035, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2036; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t2036, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7280.1ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 145.9ms, AutomataDifference: 2829.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 318.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1723 SDtfs, 2273 SDslu, 5980 SDs, 0 SdLazy, 798 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 787.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1173.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11927occurred in iteration=0, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1710.8ms AutomataMinimizationTime, 13 MinimizatonAttempts, 1798 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 44.6ms SsaConstructionTime, 415.5ms SatisfiabilityAnalysisTime, 1549.2ms InterpolantComputationTime, 1022 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 927 ConstructedInterpolants, 0 QuantifiedInterpolants, 4021 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-21 11:40:39,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...