/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/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 21:45:46,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 21:45:46,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 21:45:46,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 21:45:46,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 21:45:46,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 21:45:46,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 21:45:46,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 21:45:46,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 21:45:46,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 21:45:46,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 21:45:46,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 21:45:46,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 21:45:46,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 21:45:46,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 21:45:46,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 21:45:46,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 21:45:46,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 21:45:46,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 21:45:46,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 21:45:46,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 21:45:46,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 21:45:46,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 21:45:46,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 21:45:46,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 21:45:46,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 21:45:46,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 21:45:46,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 21:45:46,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 21:45:46,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 21:45:46,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 21:45:46,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 21:45:46,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 21:45:46,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 21:45:46,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 21:45:46,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 21:45:46,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 21:45:46,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 21:45:46,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 21:45:46,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 21:45:46,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 21:45:46,268 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 [2022-02-10 21:45:46,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 21:45:46,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 21:45:46,301 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 21:45:46,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 21:45:46,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 21:45:46,302 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 21:45:46,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 21:45:46,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 21:45:46,302 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 21:45:46,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 21:45:46,303 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 21:45:46,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 21:45:46,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 21:45:46,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 21:45:46,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 21:45:46,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 21:45:46,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 21:45:46,304 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 21:45:46,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 21:45:46,304 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 21:45:46,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 21:45:46,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 21:45:46,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 21:45:46,305 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 21:45:46,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 21:45:46,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:45:46,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 21:45:46,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 21:45:46,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 21:45:46,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 21:45:46,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 21:45:46,306 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 21:45:46,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 21:45:46,306 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 [2022-02-10 21:45:46,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 21:45:46,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 21:45:46,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 21:45:46,547 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 21:45:46,547 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 21:45:46,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-02-10 21:45:46,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f1629f1a/404ac58b9e724fa7b161a4865eba812e/FLAGb9214cc3f [2022-02-10 21:45:47,052 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 21:45:47,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-02-10 21:45:47,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f1629f1a/404ac58b9e724fa7b161a4865eba812e/FLAGb9214cc3f [2022-02-10 21:45:47,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f1629f1a/404ac58b9e724fa7b161a4865eba812e [2022-02-10 21:45:47,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 21:45:47,081 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 21:45:47,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 21:45:47,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 21:45:47,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 21:45:47,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:45:47" (1/1) ... [2022-02-10 21:45:47,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e129cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:45:47, skipping insertion in model container [2022-02-10 21:45:47,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:45:47" (1/1) ... [2022-02-10 21:45:47,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 21:45:47,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 21:45:47,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-02-10 21:45:47,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:45:47,509 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 21:45:47,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-02-10 21:45:47,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:45:47,588 INFO L208 MainTranslator]: Completed translation [2022-02-10 21:45:47,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:45:47 WrapperNode [2022-02-10 21:45:47,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 21:45:47,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 21:45:47,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 21:45:47,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 21:45:47,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:45:47" (1/1) ... [2022-02-10 21:45:47,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:45:47" (1/1) ... [2022-02-10 21:45:47,667 INFO L137 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 259 [2022-02-10 21:45:47,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 21:45:47,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 21:45:47,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 21:45:47,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 21:45:47,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:45:47" (1/1) ... [2022-02-10 21:45:47,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:45:47" (1/1) ... [2022-02-10 21:45:47,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:45:47" (1/1) ... [2022-02-10 21:45:47,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:45:47" (1/1) ... [2022-02-10 21:45:47,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:45:47" (1/1) ... [2022-02-10 21:45:47,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:45:47" (1/1) ... [2022-02-10 21:45:47,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:45:47" (1/1) ... [2022-02-10 21:45:47,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 21:45:47,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 21:45:47,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 21:45:47,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 21:45:47,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:45:47" (1/1) ... [2022-02-10 21:45:47,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:45:47,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:45:47,760 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) [2022-02-10 21:45:47,784 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 [2022-02-10 21:45:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 21:45:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-10 21:45:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 21:45:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 21:45:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 21:45:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-02-10 21:45:47,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-02-10 21:45:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-02-10 21:45:47,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-02-10 21:45:47,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 21:45:47,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-10 21:45:47,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 21:45:47,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 21:45:47,808 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 21:45:47,973 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 21:45:47,975 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 21:45:48,431 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 21:45:48,745 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 21:45:48,745 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-10 21:45:48,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:45:48 BoogieIcfgContainer [2022-02-10 21:45:48,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 21:45:48,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 21:45:48,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 21:45:48,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 21:45:48,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 09:45:47" (1/3) ... [2022-02-10 21:45:48,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc8069f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:45:48, skipping insertion in model container [2022-02-10 21:45:48,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:45:47" (2/3) ... [2022-02-10 21:45:48,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc8069f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:45:48, skipping insertion in model container [2022-02-10 21:45:48,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:45:48" (3/3) ... [2022-02-10 21:45:48,754 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-02-10 21:45:48,759 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 21:45:48,759 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 21:45:48,759 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-10 21:45:48,759 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 21:45:48,794 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,795 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,795 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,795 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,796 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,796 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,796 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,796 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,796 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,796 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,797 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,797 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,798 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,798 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,798 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,798 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,798 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,799 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,799 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,799 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,799 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,799 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,800 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,800 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,800 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,801 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,801 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,801 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,802 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,802 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,803 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,803 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,803 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,803 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,803 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,804 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,804 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,804 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,804 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,804 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,804 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,805 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,805 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,805 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,806 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,806 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,806 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,806 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,806 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,807 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,807 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,807 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,807 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,807 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,807 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,807 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,808 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,808 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,808 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,809 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,812 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,812 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,812 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,813 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,813 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,813 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,813 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,814 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,814 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,814 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,814 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,814 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,815 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,815 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,815 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,816 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,816 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,816 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,816 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,816 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,817 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,817 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:45:48,817 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-10 21:45:48,892 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 21:45:48,898 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, mAutomataTypeConcurrency=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 [2022-02-10 21:45:48,898 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-10 21:45:48,910 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 94 transitions, 198 flow [2022-02-10 21:45:49,010 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1734 states, 1731 states have (on average 2.6770652801848644) internal successors, (4634), 1733 states have internal predecessors, (4634), 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) [2022-02-10 21:45:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 1734 states, 1731 states have (on average 2.6770652801848644) internal successors, (4634), 1733 states have internal predecessors, (4634), 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) [2022-02-10 21:45:49,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-10 21:45:49,022 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:45:49,025 INFO L515 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] [2022-02-10 21:45:49,029 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:45:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:45:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash 840746016, now seen corresponding path program 1 times [2022-02-10 21:45:49,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:45:49,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378405944] [2022-02-10 21:45:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:45:49,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:45:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:45:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:45:49,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:45:49,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378405944] [2022-02-10 21:45:49,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378405944] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:45:49,337 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:45:49,337 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 21:45:49,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155931515] [2022-02-10 21:45:49,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:45:49,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 21:45:49,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:45:49,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 21:45:49,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:45:49,369 INFO L87 Difference]: Start difference. First operand has 1734 states, 1731 states have (on average 2.6770652801848644) internal successors, (4634), 1733 states have internal predecessors, (4634), 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 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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) [2022-02-10 21:45:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:45:49,446 INFO L93 Difference]: Finished difference Result 1471 states and 3804 transitions. [2022-02-10 21:45:49,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 21:45:49,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2022-02-10 21:45:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:45:49,468 INFO L225 Difference]: With dead ends: 1471 [2022-02-10 21:45:49,468 INFO L226 Difference]: Without dead ends: 1247 [2022-02-10 21:45:49,469 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:45:49,472 INFO L934 BasicCegarLoop]: 81 mSDtfsCounter, 39 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 21:45:49,473 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 138 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 21:45:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2022-02-10 21:45:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1247. [2022-02-10 21:45:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1246 states have (on average 2.606741573033708) internal successors, (3248), 1246 states have internal predecessors, (3248), 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) [2022-02-10 21:45:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 3248 transitions. [2022-02-10 21:45:49,566 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 3248 transitions. Word has length 41 [2022-02-10 21:45:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:45:49,566 INFO L470 AbstractCegarLoop]: Abstraction has 1247 states and 3248 transitions. [2022-02-10 21:45:49,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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) [2022-02-10 21:45:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 3248 transitions. [2022-02-10 21:45:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-10 21:45:49,573 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:45:49,573 INFO L515 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] [2022-02-10 21:45:49,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 21:45:49,574 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:45:49,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:45:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash 88413764, now seen corresponding path program 1 times [2022-02-10 21:45:49,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:45:49,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694430600] [2022-02-10 21:45:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:45:49,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:45:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:45:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:45:49,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:45:49,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694430600] [2022-02-10 21:45:49,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694430600] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:45:49,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:45:49,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:45:49,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185308598] [2022-02-10 21:45:49,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:45:49,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:45:49,899 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:45:49,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:45:49,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:45:49,899 INFO L87 Difference]: Start difference. First operand 1247 states and 3248 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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) [2022-02-10 21:45:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:45:50,098 INFO L93 Difference]: Finished difference Result 1455 states and 3758 transitions. [2022-02-10 21:45:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:45:50,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 63 [2022-02-10 21:45:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:45:50,105 INFO L225 Difference]: With dead ends: 1455 [2022-02-10 21:45:50,105 INFO L226 Difference]: Without dead ends: 1135 [2022-02-10 21:45:50,109 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:45:50,110 INFO L934 BasicCegarLoop]: 101 mSDtfsCounter, 84 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:45:50,111 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 394 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:45:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2022-02-10 21:45:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2022-02-10 21:45:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1134 states have (on average 2.580246913580247) internal successors, (2926), 1134 states have internal predecessors, (2926), 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) [2022-02-10 21:45:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 2926 transitions. [2022-02-10 21:45:50,140 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 2926 transitions. Word has length 63 [2022-02-10 21:45:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:45:50,142 INFO L470 AbstractCegarLoop]: Abstraction has 1135 states and 2926 transitions. [2022-02-10 21:45:50,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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) [2022-02-10 21:45:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2926 transitions. [2022-02-10 21:45:50,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-10 21:45:50,146 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:45:50,146 INFO L515 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] [2022-02-10 21:45:50,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 21:45:50,147 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:45:50,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:45:50,147 INFO L85 PathProgramCache]: Analyzing trace with hash -64395099, now seen corresponding path program 1 times [2022-02-10 21:45:50,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:45:50,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731408923] [2022-02-10 21:45:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:45:50,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:45:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:45:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:45:50,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:45:50,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731408923] [2022-02-10 21:45:50,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731408923] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:45:50,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:45:50,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:45:50,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278768269] [2022-02-10 21:45:50,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:45:50,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:45:50,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:45:50,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:45:50,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:45:50,400 INFO L87 Difference]: Start difference. First operand 1135 states and 2926 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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) [2022-02-10 21:45:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:45:50,626 INFO L93 Difference]: Finished difference Result 1579 states and 4058 transitions. [2022-02-10 21:45:50,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:45:50,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 65 [2022-02-10 21:45:50,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:45:50,633 INFO L225 Difference]: With dead ends: 1579 [2022-02-10 21:45:50,633 INFO L226 Difference]: Without dead ends: 811 [2022-02-10 21:45:50,634 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-10 21:45:50,639 INFO L934 BasicCegarLoop]: 94 mSDtfsCounter, 163 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:45:50,640 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 419 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:45:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-02-10 21:45:50,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2022-02-10 21:45:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 2.460493827160494) internal successors, (1993), 810 states have internal predecessors, (1993), 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) [2022-02-10 21:45:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1993 transitions. [2022-02-10 21:45:50,661 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1993 transitions. Word has length 65 [2022-02-10 21:45:50,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:45:50,662 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1993 transitions. [2022-02-10 21:45:50,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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) [2022-02-10 21:45:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1993 transitions. [2022-02-10 21:45:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-10 21:45:50,668 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:45:50,668 INFO L515 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] [2022-02-10 21:45:50,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 21:45:50,668 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:45:50,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:45:50,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1491829723, now seen corresponding path program 1 times [2022-02-10 21:45:50,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:45:50,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351096530] [2022-02-10 21:45:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:45:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:45:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:45:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:45:50,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:45:50,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351096530] [2022-02-10 21:45:50,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351096530] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:45:50,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:45:50,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 21:45:50,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473987874] [2022-02-10 21:45:50,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:45:50,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 21:45:50,962 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:45:50,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 21:45:50,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-10 21:45:50,963 INFO L87 Difference]: Start difference. First operand 811 states and 1993 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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) [2022-02-10 21:45:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:45:51,190 INFO L93 Difference]: Finished difference Result 954 states and 2338 transitions. [2022-02-10 21:45:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-10 21:45:51,190 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 68 [2022-02-10 21:45:51,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:45:51,194 INFO L225 Difference]: With dead ends: 954 [2022-02-10 21:45:51,194 INFO L226 Difference]: Without dead ends: 804 [2022-02-10 21:45:51,194 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-02-10 21:45:51,195 INFO L934 BasicCegarLoop]: 105 mSDtfsCounter, 167 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:45:51,195 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 564 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:45:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-02-10 21:45:51,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2022-02-10 21:45:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 2.455790784557908) internal successors, (1972), 803 states have internal predecessors, (1972), 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) [2022-02-10 21:45:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1972 transitions. [2022-02-10 21:45:51,212 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1972 transitions. Word has length 68 [2022-02-10 21:45:51,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:45:51,213 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 1972 transitions. [2022-02-10 21:45:51,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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) [2022-02-10 21:45:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1972 transitions. [2022-02-10 21:45:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-10 21:45:51,215 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:45:51,215 INFO L515 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] [2022-02-10 21:45:51,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 21:45:51,215 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:45:51,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:45:51,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2046926434, now seen corresponding path program 1 times [2022-02-10 21:45:51,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:45:51,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990993434] [2022-02-10 21:45:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:45:51,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:45:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:45:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:45:51,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:45:51,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990993434] [2022-02-10 21:45:51,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990993434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:45:51,365 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:45:51,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:45:51,365 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241054847] [2022-02-10 21:45:51,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:45:51,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:45:51,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:45:51,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:45:51,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:45:51,366 INFO L87 Difference]: Start difference. First operand 804 states and 1972 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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) [2022-02-10 21:45:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:45:51,506 INFO L93 Difference]: Finished difference Result 871 states and 2087 transitions. [2022-02-10 21:45:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:45:51,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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 [2022-02-10 21:45:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:45:51,511 INFO L225 Difference]: With dead ends: 871 [2022-02-10 21:45:51,511 INFO L226 Difference]: Without dead ends: 641 [2022-02-10 21:45:51,511 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:45:51,512 INFO L934 BasicCegarLoop]: 83 mSDtfsCounter, 117 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:45:51,512 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 301 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:45:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-02-10 21:45:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2022-02-10 21:45:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 2.3546875) internal successors, (1507), 640 states have internal predecessors, (1507), 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) [2022-02-10 21:45:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1507 transitions. [2022-02-10 21:45:51,527 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1507 transitions. Word has length 69 [2022-02-10 21:45:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:45:51,527 INFO L470 AbstractCegarLoop]: Abstraction has 641 states and 1507 transitions. [2022-02-10 21:45:51,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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) [2022-02-10 21:45:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1507 transitions. [2022-02-10 21:45:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-10 21:45:51,529 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:45:51,529 INFO L515 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] [2022-02-10 21:45:51,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 21:45:51,529 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:45:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:45:51,530 INFO L85 PathProgramCache]: Analyzing trace with hash 110237412, now seen corresponding path program 1 times [2022-02-10 21:45:51,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:45:51,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922384458] [2022-02-10 21:45:51,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:45:51,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:45:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:45:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:45:51,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:45:51,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922384458] [2022-02-10 21:45:51,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922384458] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:45:51,620 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:45:51,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:45:51,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23801813] [2022-02-10 21:45:51,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:45:51,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:45:51,621 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:45:51,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:45:51,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:45:51,622 INFO L87 Difference]: Start difference. First operand 641 states and 1507 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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) [2022-02-10 21:45:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:45:51,763 INFO L93 Difference]: Finished difference Result 518 states and 1155 transitions. [2022-02-10 21:45:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:45:51,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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 70 [2022-02-10 21:45:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:45:51,766 INFO L225 Difference]: With dead ends: 518 [2022-02-10 21:45:51,766 INFO L226 Difference]: Without dead ends: 368 [2022-02-10 21:45:51,766 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-10 21:45:51,767 INFO L934 BasicCegarLoop]: 79 mSDtfsCounter, 163 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:45:51,767 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 318 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:45:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-02-10 21:45:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-02-10 21:45:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 2.122615803814714) internal successors, (779), 367 states have internal predecessors, (779), 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) [2022-02-10 21:45:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 779 transitions. [2022-02-10 21:45:51,774 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 779 transitions. Word has length 70 [2022-02-10 21:45:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:45:51,775 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 779 transitions. [2022-02-10 21:45:51,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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) [2022-02-10 21:45:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 779 transitions. [2022-02-10 21:45:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-10 21:45:51,776 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:45:51,776 INFO L515 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] [2022-02-10 21:45:51,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 21:45:51,776 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:45:51,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:45:51,777 INFO L85 PathProgramCache]: Analyzing trace with hash 263497398, now seen corresponding path program 1 times [2022-02-10 21:45:51,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:45:51,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597521125] [2022-02-10 21:45:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:45:51,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:45:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:45:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:45:52,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:45:52,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597521125] [2022-02-10 21:45:52,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597521125] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:45:52,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:45:52,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-10 21:45:52,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71282990] [2022-02-10 21:45:52,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:45:52,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-10 21:45:52,020 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:45:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-10 21:45:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-10 21:45:52,021 INFO L87 Difference]: Start difference. First operand 368 states and 779 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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) [2022-02-10 21:45:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:45:52,215 INFO L93 Difference]: Finished difference Result 545 states and 1185 transitions. [2022-02-10 21:45:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:45:52,216 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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 [2022-02-10 21:45:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:45:52,217 INFO L225 Difference]: With dead ends: 545 [2022-02-10 21:45:52,217 INFO L226 Difference]: Without dead ends: 304 [2022-02-10 21:45:52,218 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-02-10 21:45:52,218 INFO L934 BasicCegarLoop]: 108 mSDtfsCounter, 144 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:45:52,219 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 745 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:45:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-02-10 21:45:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-02-10 21:45:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 2.0693069306930694) internal successors, (627), 303 states have internal predecessors, (627), 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) [2022-02-10 21:45:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 627 transitions. [2022-02-10 21:45:52,225 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 627 transitions. Word has length 73 [2022-02-10 21:45:52,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:45:52,225 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 627 transitions. [2022-02-10 21:45:52,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 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) [2022-02-10 21:45:52,226 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 627 transitions. [2022-02-10 21:45:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-10 21:45:52,226 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:45:52,227 INFO L515 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] [2022-02-10 21:45:52,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 21:45:52,227 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-10 21:45:52,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:45:52,227 INFO L85 PathProgramCache]: Analyzing trace with hash 48629332, now seen corresponding path program 2 times [2022-02-10 21:45:52,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:45:52,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313091657] [2022-02-10 21:45:52,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:45:52,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:45:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:45:52,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-10 21:45:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:45:52,382 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-10 21:45:52,383 INFO L629 BasicCegarLoop]: Counterexample is feasible [2022-02-10 21:45:52,383 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-02-10 21:45:52,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-02-10 21:45:52,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-02-10 21:45:52,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-02-10 21:45:52,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-02-10 21:45:52,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 21:45:52,388 INFO L733 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-02-10 21:45:52,393 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 21:45:52,393 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 21:45:52,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 09:45:52 BasicIcfg [2022-02-10 21:45:52,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 21:45:52,500 INFO L158 Benchmark]: Toolchain (without parser) took 5418.28ms. Allocated memory was 173.0MB in the beginning and 317.7MB in the end (delta: 144.7MB). Free memory was 116.3MB in the beginning and 247.0MB in the end (delta: -130.7MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. [2022-02-10 21:45:52,500 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 173.0MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 21:45:52,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.16ms. Allocated memory was 173.0MB in the beginning and 248.5MB in the end (delta: 75.5MB). Free memory was 116.1MB in the beginning and 207.3MB in the end (delta: -91.2MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2022-02-10 21:45:52,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.74ms. Allocated memory is still 248.5MB. Free memory was 207.3MB in the beginning and 204.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-10 21:45:52,500 INFO L158 Benchmark]: Boogie Preprocessor took 36.57ms. Allocated memory is still 248.5MB. Free memory was 204.1MB in the beginning and 202.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-10 21:45:52,501 INFO L158 Benchmark]: RCFGBuilder took 1042.16ms. Allocated memory is still 248.5MB. Free memory was 202.6MB in the beginning and 131.8MB in the end (delta: 70.8MB). Peak memory consumption was 71.3MB. Max. memory is 8.0GB. [2022-02-10 21:45:52,501 INFO L158 Benchmark]: TraceAbstraction took 3750.37ms. Allocated memory was 248.5MB in the beginning and 317.7MB in the end (delta: 69.2MB). Free memory was 131.3MB in the beginning and 247.0MB in the end (delta: -115.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 21:45:52,502 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.14ms. Allocated memory is still 173.0MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 505.16ms. Allocated memory was 173.0MB in the beginning and 248.5MB in the end (delta: 75.5MB). Free memory was 116.1MB in the beginning and 207.3MB in the end (delta: -91.2MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.74ms. Allocated memory is still 248.5MB. Free memory was 207.3MB in the beginning and 204.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.57ms. Allocated memory is still 248.5MB. Free memory was 204.1MB in the beginning and 202.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 1042.16ms. Allocated memory is still 248.5MB. Free memory was 202.6MB in the beginning and 131.8MB in the end (delta: 70.8MB). Peak memory consumption was 71.3MB. Max. memory is 8.0GB. * TraceAbstraction took 3750.37ms. Allocated memory was 248.5MB in the beginning and 317.7MB in the end (delta: 69.2MB). Free memory was 131.3MB in the beginning and 247.0MB in the end (delta: -115.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L716] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L718] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L719] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L720] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L721] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L726] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L727] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L728] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L729] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L730] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2009; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2009, ((void *)0), P0, ((void *)0))=-1, t2009={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2010; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2010, ((void *)0), P1, ((void *)0))=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009={5:0}, t2010={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 795]: 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: 793]: 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 5 procedures, 112 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 877 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 877 mSDsluCounter, 2879 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2415 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 545 IncrementalHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 651 mSDtfsCounter, 545 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1734occurred in iteration=0, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 442 ConstructedInterpolants, 0 QuantifiedInterpolants, 2059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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! [2022-02-10 21:45:52,537 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...