/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.mcr-reduction-4b0ab11 [2022-03-03 16:22:36,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 16:22:36,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 16:22:36,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 16:22:36,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 16:22:36,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 16:22:36,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 16:22:36,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 16:22:36,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 16:22:36,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 16:22:36,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 16:22:36,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 16:22:36,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 16:22:36,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 16:22:36,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 16:22:36,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 16:22:36,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 16:22:36,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 16:22:36,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 16:22:36,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 16:22:36,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 16:22:36,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 16:22:36,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 16:22:36,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 16:22:36,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 16:22:36,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 16:22:36,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 16:22:36,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 16:22:36,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 16:22:36,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 16:22:36,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 16:22:36,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 16:22:36,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 16:22:36,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 16:22:36,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 16:22:36,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 16:22:36,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 16:22:36,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 16:22:36,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 16:22:36,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 16:22:36,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 16:22:36,219 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-03-03 16:22:36,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 16:22:36,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 16:22:36,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 16:22:36,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 16:22:36,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 16:22:36,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 16:22:36,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 16:22:36,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 16:22:36,246 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 16:22:36,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 16:22:36,247 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 16:22:36,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 16:22:36,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 16:22:36,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 16:22:36,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 16:22:36,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 16:22:36,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 16:22:36,248 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 16:22:36,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 16:22:36,249 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 16:22:36,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 16:22:36,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 16:22:36,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 16:22:36,253 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 16:22:36,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 16:22:36,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 16:22:36,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 16:22:36,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 16:22:36,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 16:22:36,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 16:22:36,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 16:22:36,256 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 16:22:36,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 16:22:36,257 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-03-03 16:22:36,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 16:22:36,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 16:22:36,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 16:22:36,451 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 16:22:36,454 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 16:22:36,455 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-03-03 16:22:36,522 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb476f5e/bd9da2231344418fb11793c347b7ce87/FLAGc46e4d8f2 [2022-03-03 16:22:37,037 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 16:22:37,037 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-03-03 16:22:37,047 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb476f5e/bd9da2231344418fb11793c347b7ce87/FLAGc46e4d8f2 [2022-03-03 16:22:37,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb476f5e/bd9da2231344418fb11793c347b7ce87 [2022-03-03 16:22:37,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 16:22:37,316 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 16:22:37,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 16:22:37,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 16:22:37,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 16:22:37,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:22:37" (1/1) ... [2022-03-03 16:22:37,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6604fc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:37, skipping insertion in model container [2022-03-03 16:22:37,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:22:37" (1/1) ... [2022-03-03 16:22:37,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 16:22:37,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 16:22:37,595 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-03-03 16:22:37,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 16:22:37,760 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 16:22:37,771 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-03-03 16:22:37,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 16:22:37,816 INFO L208 MainTranslator]: Completed translation [2022-03-03 16:22:37,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:37 WrapperNode [2022-03-03 16:22:37,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 16:22:37,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 16:22:37,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 16:22:37,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 16:22:37,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:37" (1/1) ... [2022-03-03 16:22:37,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:37" (1/1) ... [2022-03-03 16:22:37,853 INFO L137 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 259 [2022-03-03 16:22:37,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 16:22:37,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 16:22:37,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 16:22:37,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 16:22:37,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:37" (1/1) ... [2022-03-03 16:22:37,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:37" (1/1) ... [2022-03-03 16:22:37,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:37" (1/1) ... [2022-03-03 16:22:37,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:37" (1/1) ... [2022-03-03 16:22:37,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:37" (1/1) ... [2022-03-03 16:22:37,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:37" (1/1) ... [2022-03-03 16:22:37,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:37" (1/1) ... [2022-03-03 16:22:37,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 16:22:37,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 16:22:37,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 16:22:37,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 16:22:37,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:37" (1/1) ... [2022-03-03 16:22:37,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 16:22:37,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 16:22:37,926 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-03-03 16:22:37,946 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-03-03 16:22:37,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 16:22:37,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-03 16:22:37,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 16:22:37,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 16:22:37,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 16:22:37,963 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-03 16:22:37,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-03 16:22:37,963 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-03 16:22:37,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-03 16:22:37,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 16:22:37,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-03 16:22:37,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 16:22:37,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 16:22:37,965 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 16:22:38,099 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 16:22:38,100 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 16:22:38,369 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 16:22:38,637 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 16:22:38,637 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-03 16:22:38,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 04:22:38 BoogieIcfgContainer [2022-03-03 16:22:38,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 16:22:38,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 16:22:38,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 16:22:38,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 16:22:38,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:22:37" (1/3) ... [2022-03-03 16:22:38,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e9e79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:22:38, skipping insertion in model container [2022-03-03 16:22:38,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:37" (2/3) ... [2022-03-03 16:22:38,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e9e79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:22:38, skipping insertion in model container [2022-03-03 16:22:38,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 04:22:38" (3/3) ... [2022-03-03 16:22:38,644 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-03-03 16:22:38,647 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 16:22:38,647 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 16:22:38,647 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-03 16:22:38,647 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 16:22:38,678 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,678 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,680 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,680 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,680 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,680 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,681 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,681 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,683 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,683 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,683 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,685 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,685 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,685 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,685 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,685 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,685 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,685 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,685 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,686 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,687 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,687 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,687 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,687 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,687 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,687 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,688 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,688 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,688 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,689 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,691 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,694 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,694 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,694 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,694 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,694 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,694 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,694 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,694 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 16:22:38,695 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-03 16:22:38,737 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 16:22:38,742 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, mLazyFiniteAutomaton=false, 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, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 16:22:38,742 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-03 16:22:38,752 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 94 transitions, 198 flow [2022-03-03 16:22:38,833 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-03-03 16:22:38,838 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-03-03 16:22:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-03 16:22:38,845 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:22:38,848 INFO L514 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-03-03 16:22:38,853 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-03 16:22:38,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:22:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash 840746016, now seen corresponding path program 1 times [2022-03-03 16:22:38,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:22:38,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567912600] [2022-03-03 16:22:38,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:22:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:22:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:22:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:22:39,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:22:39,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567912600] [2022-03-03 16:22:39,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567912600] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:22:39,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:22:39,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 16:22:39,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379287745] [2022-03-03 16:22:39,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:22:39,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-03 16:22:39,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:22:39,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-03 16:22:39,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-03 16:22:39,172 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-03-03 16:22:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:22:39,257 INFO L93 Difference]: Finished difference Result 1471 states and 3804 transitions. [2022-03-03 16:22:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-03 16:22:39,260 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-03-03 16:22:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:22:39,282 INFO L225 Difference]: With dead ends: 1471 [2022-03-03 16:22:39,282 INFO L226 Difference]: Without dead ends: 1247 [2022-03-03 16:22:39,283 INFO L932 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-03-03 16:22:39,286 INFO L933 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-03-03 16:22:39,287 INFO L934 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-03-03 16:22:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2022-03-03 16:22:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1247. [2022-03-03 16:22:39,364 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-03-03 16:22:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 3248 transitions. [2022-03-03 16:22:39,368 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 3248 transitions. Word has length 41 [2022-03-03 16:22:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:22:39,369 INFO L470 AbstractCegarLoop]: Abstraction has 1247 states and 3248 transitions. [2022-03-03 16:22:39,369 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-03-03 16:22:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 3248 transitions. [2022-03-03 16:22:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-03 16:22:39,374 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:22:39,374 INFO L514 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-03-03 16:22:39,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 16:22:39,374 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-03 16:22:39,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:22:39,375 INFO L85 PathProgramCache]: Analyzing trace with hash 88413764, now seen corresponding path program 1 times [2022-03-03 16:22:39,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:22:39,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419913018] [2022-03-03 16:22:39,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:22:39,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:22:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:22:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:22:39,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:22:39,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419913018] [2022-03-03 16:22:39,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419913018] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:22:39,570 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:22:39,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 16:22:39,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890613820] [2022-03-03 16:22:39,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:22:39,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 16:22:39,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:22:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 16:22:39,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-03 16:22:39,576 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-03-03 16:22:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:22:39,760 INFO L93 Difference]: Finished difference Result 1455 states and 3758 transitions. [2022-03-03 16:22:39,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 16:22:39,761 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-03-03 16:22:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:22:39,765 INFO L225 Difference]: With dead ends: 1455 [2022-03-03 16:22:39,765 INFO L226 Difference]: Without dead ends: 1135 [2022-03-03 16:22:39,766 INFO L932 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-03-03 16:22:39,766 INFO L933 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-03-03 16:22:39,767 INFO L934 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-03-03 16:22:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2022-03-03 16:22:39,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2022-03-03 16:22:39,786 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-03-03 16:22:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 2926 transitions. [2022-03-03 16:22:39,828 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 2926 transitions. Word has length 63 [2022-03-03 16:22:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:22:39,828 INFO L470 AbstractCegarLoop]: Abstraction has 1135 states and 2926 transitions. [2022-03-03 16:22:39,828 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-03-03 16:22:39,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2926 transitions. [2022-03-03 16:22:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-03-03 16:22:39,840 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:22:39,840 INFO L514 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-03-03 16:22:39,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 16:22:39,841 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-03 16:22:39,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:22:39,841 INFO L85 PathProgramCache]: Analyzing trace with hash -64395099, now seen corresponding path program 1 times [2022-03-03 16:22:39,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:22:39,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267181982] [2022-03-03 16:22:39,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:22:39,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:22:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:22:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:22:40,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:22:40,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267181982] [2022-03-03 16:22:40,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267181982] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:22:40,027 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:22:40,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-03 16:22:40,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211187797] [2022-03-03 16:22:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:22:40,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 16:22:40,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:22:40,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 16:22:40,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-03 16:22:40,028 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-03-03 16:22:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:22:40,257 INFO L93 Difference]: Finished difference Result 1579 states and 4058 transitions. [2022-03-03 16:22:40,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-03 16:22:40,258 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-03-03 16:22:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:22:40,261 INFO L225 Difference]: With dead ends: 1579 [2022-03-03 16:22:40,261 INFO L226 Difference]: Without dead ends: 811 [2022-03-03 16:22:40,261 INFO L932 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-03-03 16:22:40,262 INFO L933 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-03-03 16:22:40,262 INFO L934 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-03-03 16:22:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-03-03 16:22:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2022-03-03 16:22:40,281 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-03-03 16:22:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1993 transitions. [2022-03-03 16:22:40,283 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1993 transitions. Word has length 65 [2022-03-03 16:22:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:22:40,283 INFO L470 AbstractCegarLoop]: Abstraction has 811 states and 1993 transitions. [2022-03-03 16:22:40,284 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-03-03 16:22:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1993 transitions. [2022-03-03 16:22:40,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-03 16:22:40,301 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:22:40,301 INFO L514 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-03-03 16:22:40,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 16:22:40,301 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-03 16:22:40,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:22:40,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1491829723, now seen corresponding path program 1 times [2022-03-03 16:22:40,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:22:40,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572137595] [2022-03-03 16:22:40,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:22:40,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:22:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:22:40,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:22:40,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:22:40,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572137595] [2022-03-03 16:22:40,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572137595] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:22:40,583 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:22:40,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 16:22:40,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134706288] [2022-03-03 16:22:40,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:22:40,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 16:22:40,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:22:40,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 16:22:40,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-03 16:22:40,584 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-03-03 16:22:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:22:40,856 INFO L93 Difference]: Finished difference Result 954 states and 2338 transitions. [2022-03-03 16:22:40,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-03 16:22:40,857 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-03-03 16:22:40,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:22:40,859 INFO L225 Difference]: With dead ends: 954 [2022-03-03 16:22:40,859 INFO L226 Difference]: Without dead ends: 804 [2022-03-03 16:22:40,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-03-03 16:22:40,860 INFO L933 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-03-03 16:22:40,860 INFO L934 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-03-03 16:22:40,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-03-03 16:22:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2022-03-03 16:22:40,886 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-03-03 16:22:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1972 transitions. [2022-03-03 16:22:40,888 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1972 transitions. Word has length 68 [2022-03-03 16:22:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:22:40,888 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 1972 transitions. [2022-03-03 16:22:40,888 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-03-03 16:22:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1972 transitions. [2022-03-03 16:22:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-03-03 16:22:40,890 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:22:40,890 INFO L514 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-03-03 16:22:40,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 16:22:40,890 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-03 16:22:40,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:22:40,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2046926434, now seen corresponding path program 1 times [2022-03-03 16:22:40,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:22:40,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728196756] [2022-03-03 16:22:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:22:40,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:22:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:22:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:22:41,014 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:22:41,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728196756] [2022-03-03 16:22:41,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728196756] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:22:41,014 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:22:41,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 16:22:41,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081378918] [2022-03-03 16:22:41,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:22:41,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 16:22:41,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:22:41,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 16:22:41,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-03 16:22:41,015 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-03-03 16:22:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:22:41,134 INFO L93 Difference]: Finished difference Result 871 states and 2087 transitions. [2022-03-03 16:22:41,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-03 16:22:41,135 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-03-03 16:22:41,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:22:41,137 INFO L225 Difference]: With dead ends: 871 [2022-03-03 16:22:41,137 INFO L226 Difference]: Without dead ends: 641 [2022-03-03 16:22:41,138 INFO L932 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-03-03 16:22:41,138 INFO L933 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-03-03 16:22:41,138 INFO L934 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-03-03 16:22:41,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-03-03 16:22:41,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2022-03-03 16:22:41,147 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-03-03 16:22:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1507 transitions. [2022-03-03 16:22:41,149 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1507 transitions. Word has length 69 [2022-03-03 16:22:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:22:41,149 INFO L470 AbstractCegarLoop]: Abstraction has 641 states and 1507 transitions. [2022-03-03 16:22:41,149 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-03-03 16:22:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1507 transitions. [2022-03-03 16:22:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-03 16:22:41,150 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:22:41,150 INFO L514 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-03-03 16:22:41,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-03 16:22:41,151 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-03 16:22:41,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:22:41,151 INFO L85 PathProgramCache]: Analyzing trace with hash 110237412, now seen corresponding path program 1 times [2022-03-03 16:22:41,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:22:41,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545771780] [2022-03-03 16:22:41,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:22:41,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:22:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:22:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:22:41,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:22:41,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545771780] [2022-03-03 16:22:41,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545771780] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:22:41,220 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:22:41,220 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-03 16:22:41,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206570914] [2022-03-03 16:22:41,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:22:41,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 16:22:41,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:22:41,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 16:22:41,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-03 16:22:41,221 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-03-03 16:22:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:22:41,331 INFO L93 Difference]: Finished difference Result 518 states and 1155 transitions. [2022-03-03 16:22:41,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-03 16:22:41,332 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-03-03 16:22:41,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:22:41,333 INFO L225 Difference]: With dead ends: 518 [2022-03-03 16:22:41,333 INFO L226 Difference]: Without dead ends: 368 [2022-03-03 16:22:41,333 INFO L932 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-03-03 16:22:41,334 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 163 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-03-03 16:22:41,334 INFO L934 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-03-03 16:22:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-03-03 16:22:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-03-03 16:22:41,339 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-03-03 16:22:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 779 transitions. [2022-03-03 16:22:41,340 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 779 transitions. Word has length 70 [2022-03-03 16:22:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:22:41,341 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 779 transitions. [2022-03-03 16:22:41,341 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-03-03 16:22:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 779 transitions. [2022-03-03 16:22:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-03-03 16:22:41,341 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:22:41,342 INFO L514 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-03-03 16:22:41,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-03 16:22:41,342 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-03 16:22:41,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:22:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash 263497398, now seen corresponding path program 1 times [2022-03-03 16:22:41,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:22:41,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984300687] [2022-03-03 16:22:41,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:22:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:22:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 16:22:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 16:22:41,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 16:22:41,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984300687] [2022-03-03 16:22:41,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984300687] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 16:22:41,559 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 16:22:41,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-03 16:22:41,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115009200] [2022-03-03 16:22:41,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 16:22:41,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-03 16:22:41,559 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 16:22:41,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-03 16:22:41,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-03-03 16:22:41,560 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-03-03 16:22:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 16:22:41,743 INFO L93 Difference]: Finished difference Result 545 states and 1185 transitions. [2022-03-03 16:22:41,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-03 16:22:41,743 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-03-03 16:22:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 16:22:41,744 INFO L225 Difference]: With dead ends: 545 [2022-03-03 16:22:41,745 INFO L226 Difference]: Without dead ends: 304 [2022-03-03 16:22:41,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-03-03 16:22:41,747 INFO L933 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-03-03 16:22:41,747 INFO L934 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-03-03 16:22:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-03-03 16:22:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-03-03 16:22:41,752 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-03-03 16:22:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 627 transitions. [2022-03-03 16:22:41,753 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 627 transitions. Word has length 73 [2022-03-03 16:22:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 16:22:41,753 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 627 transitions. [2022-03-03 16:22:41,753 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-03-03 16:22:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 627 transitions. [2022-03-03 16:22:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-03-03 16:22:41,755 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 16:22:41,755 INFO L514 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-03-03 16:22:41,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-03 16:22:41,755 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-03 16:22:41,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 16:22:41,756 INFO L85 PathProgramCache]: Analyzing trace with hash 48629332, now seen corresponding path program 2 times [2022-03-03 16:22:41,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 16:22:41,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050613848] [2022-03-03 16:22:41,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 16:22:41,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 16:22:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-03 16:22:41,781 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-03 16:22:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-03 16:22:41,868 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-03 16:22:41,868 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-03 16:22:41,869 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-03-03 16:22:41,870 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-03-03 16:22:41,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-03-03 16:22:41,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-03-03 16:22:41,871 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-03-03 16:22:41,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-03 16:22:41,873 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-03-03 16:22:41,876 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 16:22:41,876 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 16:22:41,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 04:22:41 BasicIcfg [2022-03-03 16:22:41,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 16:22:41,988 INFO L158 Benchmark]: Toolchain (without parser) took 4672.83ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 121.6MB in the beginning and 260.4MB in the end (delta: -138.8MB). Peak memory consumption was 94.1MB. Max. memory is 8.0GB. [2022-03-03 16:22:41,989 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 16:22:41,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.54ms. Allocated memory is still 176.2MB. Free memory was 121.4MB in the beginning and 136.8MB in the end (delta: -15.4MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. [2022-03-03 16:22:41,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.60ms. Allocated memory is still 176.2MB. Free memory was 136.8MB in the beginning and 133.9MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-03 16:22:41,989 INFO L158 Benchmark]: Boogie Preprocessor took 21.75ms. Allocated memory is still 176.2MB. Free memory was 133.9MB in the beginning and 131.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 16:22:41,989 INFO L158 Benchmark]: RCFGBuilder took 762.54ms. Allocated memory is still 176.2MB. Free memory was 131.8MB in the beginning and 103.4MB in the end (delta: 28.4MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. [2022-03-03 16:22:41,990 INFO L158 Benchmark]: TraceAbstraction took 3348.47ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 102.9MB in the beginning and 260.4MB in the end (delta: -157.5MB). Peak memory consumption was 74.8MB. Max. memory is 8.0GB. [2022-03-03 16:22:41,990 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.13ms. Allocated memory is still 176.2MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 500.54ms. Allocated memory is still 176.2MB. Free memory was 121.4MB in the beginning and 136.8MB in the end (delta: -15.4MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.60ms. Allocated memory is still 176.2MB. Free memory was 136.8MB in the beginning and 133.9MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.75ms. Allocated memory is still 176.2MB. Free memory was 133.9MB in the beginning and 131.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 762.54ms. Allocated memory is still 176.2MB. Free memory was 131.8MB in the beginning and 103.4MB in the end (delta: 28.4MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3348.47ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 102.9MB in the beginning and 260.4MB in the end (delta: -157.5MB). Peak memory consumption was 74.8MB. 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=1, expression=0, 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.1s, 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.6s 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.3s SatisfiabilityAnalysisTime, 0.9s 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-03-03 16:22:42,027 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...