/usr/bin/java -Xmx16000000000 -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-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-18 09:10:53,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 09:10:53,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 09:10:53,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 09:10:53,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 09:10:53,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 09:10:53,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 09:10:53,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 09:10:53,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 09:10:53,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 09:10:53,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 09:10:53,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 09:10:53,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 09:10:53,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 09:10:53,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 09:10:53,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 09:10:53,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 09:10:53,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 09:10:53,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 09:10:53,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 09:10:53,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 09:10:53,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 09:10:53,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 09:10:53,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 09:10:53,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 09:10:53,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 09:10:53,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 09:10:53,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 09:10:53,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 09:10:53,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 09:10:53,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 09:10:53,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 09:10:53,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 09:10:53,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 09:10:53,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 09:10:53,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 09:10:53,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 09:10:53,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 09:10:53,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 09:10:53,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 09:10:53,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 09:10:53,473 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-Separate.epf [2022-01-18 09:10:53,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 09:10:53,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 09:10:53,505 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-18 09:10:53,505 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-18 09:10:53,506 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 09:10:53,506 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 09:10:53,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 09:10:53,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 09:10:53,507 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 09:10:53,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 09:10:53,508 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 09:10:53,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 09:10:53,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 09:10:53,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 09:10:53,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 09:10:53,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 09:10:53,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 09:10:53,509 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 09:10:53,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 09:10:53,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 09:10:53,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 09:10:53,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 09:10:53,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 09:10:53,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 09:10:53,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 09:10:53,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 09:10:53,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 09:10:53,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 09:10:53,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 09:10:53,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 09:10:53,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 09:10:53,510 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 09:10:53,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-18 09:10:53,511 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2022-01-18 09:10:53,511 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-01-18 09:10:53,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 09:10:53,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 09:10:53,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 09:10:53,790 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 09:10:53,791 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 09:10:53,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-18 09:10:53,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49f2aad5/ceeba4da40ad4ff68c586c52ec62ba19/FLAGb513164ae [2022-01-18 09:10:54,348 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 09:10:54,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-18 09:10:54,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49f2aad5/ceeba4da40ad4ff68c586c52ec62ba19/FLAGb513164ae [2022-01-18 09:10:54,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49f2aad5/ceeba4da40ad4ff68c586c52ec62ba19 [2022-01-18 09:10:54,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 09:10:54,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 09:10:54,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 09:10:54,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 09:10:54,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 09:10:54,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 09:10:54" (1/1) ... [2022-01-18 09:10:54,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35690fd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:10:54, skipping insertion in model container [2022-01-18 09:10:54,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 09:10:54" (1/1) ... [2022-01-18 09:10:54,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 09:10:54,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 09:10:55,048 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-01-18 09:10:55,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 09:10:55,235 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 09:10:55,255 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2022-01-18 09:10:55,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 09:10:55,318 INFO L208 MainTranslator]: Completed translation [2022-01-18 09:10:55,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:10:55 WrapperNode [2022-01-18 09:10:55,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 09:10:55,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 09:10:55,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 09:10:55,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 09:10:55,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:10:55" (1/1) ... [2022-01-18 09:10:55,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:10:55" (1/1) ... [2022-01-18 09:10:55,382 INFO L137 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 259 [2022-01-18 09:10:55,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 09:10:55,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 09:10:55,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 09:10:55,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 09:10:55,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:10:55" (1/1) ... [2022-01-18 09:10:55,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:10:55" (1/1) ... [2022-01-18 09:10:55,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:10:55" (1/1) ... [2022-01-18 09:10:55,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:10:55" (1/1) ... [2022-01-18 09:10:55,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:10:55" (1/1) ... [2022-01-18 09:10:55,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:10:55" (1/1) ... [2022-01-18 09:10:55,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:10:55" (1/1) ... [2022-01-18 09:10:55,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 09:10:55,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 09:10:55,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 09:10:55,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 09:10:55,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:10:55" (1/1) ... [2022-01-18 09:10:55,428 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 09:10:55,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 09:10:55,453 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-01-18 09:10:55,475 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-01-18 09:10:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 09:10:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 09:10:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 09:10:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 09:10:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 09:10:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-18 09:10:55,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-18 09:10:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-18 09:10:55,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-18 09:10:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 09:10:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 09:10:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 09:10:55,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 09:10:55,491 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 09:10:55,623 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 09:10:55,624 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 09:10:56,012 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 09:10:56,334 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 09:10:56,334 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-18 09:10:56,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 09:10:56 BoogieIcfgContainer [2022-01-18 09:10:56,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 09:10:56,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 09:10:56,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 09:10:56,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 09:10:56,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 09:10:54" (1/3) ... [2022-01-18 09:10:56,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3217d8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 09:10:56, skipping insertion in model container [2022-01-18 09:10:56,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 09:10:55" (2/3) ... [2022-01-18 09:10:56,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3217d8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 09:10:56, skipping insertion in model container [2022-01-18 09:10:56,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 09:10:56" (3/3) ... [2022-01-18 09:10:56,343 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-18 09:10:56,348 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-18 09:10:56,348 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 09:10:56,348 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 09:10:56,348 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 09:10:56,386 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,386 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,386 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,387 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,387 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,387 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,387 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,387 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,387 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,388 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,388 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,388 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,388 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,389 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,389 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,390 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,390 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,390 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,390 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,390 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,390 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,391 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,392 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,392 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,392 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,392 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,393 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,394 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,395 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,395 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,395 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,395 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,395 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,395 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,396 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,396 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,396 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,396 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,396 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,396 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,397 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,397 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,398 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,398 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,398 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,398 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,398 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,398 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,398 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,399 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,399 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,399 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,400 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,404 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,404 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,405 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,405 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,405 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,405 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,406 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,406 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,406 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,406 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,407 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,408 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,408 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,408 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,408 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,408 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,408 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,408 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,409 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,409 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,409 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,409 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 09:10:56,410 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 09:10:56,452 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 09:10:56,458 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 09:10:56,458 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-18 09:10:56,470 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 94 transitions, 198 flow [2022-01-18 09:10:56,572 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1727 states, 1724 states have (on average 2.679814385150812) internal successors, (4620), 1726 states have internal predecessors, (4620), 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-01-18 09:10:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 1727 states, 1724 states have (on average 2.679814385150812) internal successors, (4620), 1726 states have internal predecessors, (4620), 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-01-18 09:10:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-18 09:10:56,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:10:56,587 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] [2022-01-18 09:10:56,588 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 09:10:56,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:10:56,593 INFO L85 PathProgramCache]: Analyzing trace with hash -590582846, now seen corresponding path program 1 times [2022-01-18 09:10:56,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:10:56,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763799275] [2022-01-18 09:10:56,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:10:56,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:10:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:10:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:10:56,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:10:56,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763799275] [2022-01-18 09:10:56,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763799275] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:10:56,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:10:56,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 09:10:56,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603883229] [2022-01-18 09:10:56,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:10:56,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 09:10:56,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:10:56,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 09:10:56,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 09:10:56,943 INFO L87 Difference]: Start difference. First operand has 1727 states, 1724 states have (on average 2.679814385150812) internal successors, (4620), 1726 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:10:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:10:57,043 INFO L93 Difference]: Finished difference Result 1471 states and 3804 transitions. [2022-01-18 09:10:57,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 09:10:57,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-01-18 09:10:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:10:57,076 INFO L225 Difference]: With dead ends: 1471 [2022-01-18 09:10:57,076 INFO L226 Difference]: Without dead ends: 1247 [2022-01-18 09:10:57,079 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-01-18 09:10:57,082 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 32 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:10:57,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 131 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 09:10:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2022-01-18 09:10:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1247. [2022-01-18 09:10:57,183 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-01-18 09:10:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 3248 transitions. [2022-01-18 09:10:57,190 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 3248 transitions. Word has length 48 [2022-01-18 09:10:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:10:57,191 INFO L470 AbstractCegarLoop]: Abstraction has 1247 states and 3248 transitions. [2022-01-18 09:10:57,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:10:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 3248 transitions. [2022-01-18 09:10:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-18 09:10:57,204 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:10:57,205 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-01-18 09:10:57,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 09:10:57,206 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 09:10:57,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:10:57,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1655661633, now seen corresponding path program 1 times [2022-01-18 09:10:57,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:10:57,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873330579] [2022-01-18 09:10:57,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:10:57,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:10:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:10:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:10:57,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:10:57,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873330579] [2022-01-18 09:10:57,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873330579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:10:57,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:10:57,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-18 09:10:57,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010170558] [2022-01-18 09:10:57,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:10:57,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-18 09:10:57,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:10:57,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-18 09:10:57,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-01-18 09:10:57,672 INFO L87 Difference]: Start difference. First operand 1247 states and 3248 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 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-01-18 09:10:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:10:58,103 INFO L93 Difference]: Finished difference Result 1483 states and 3824 transitions. [2022-01-18 09:10:58,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-18 09:10:58,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 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-01-18 09:10:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:10:58,109 INFO L225 Difference]: With dead ends: 1483 [2022-01-18 09:10:58,110 INFO L226 Difference]: Without dead ends: 1163 [2022-01-18 09:10:58,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-01-18 09:10:58,115 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 267 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-18 09:10:58,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 506 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-18 09:10:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-01-18 09:10:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1163. [2022-01-18 09:10:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1162 states have (on average 2.5783132530120483) internal successors, (2996), 1162 states have internal predecessors, (2996), 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-01-18 09:10:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 2996 transitions. [2022-01-18 09:10:58,184 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 2996 transitions. Word has length 63 [2022-01-18 09:10:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:10:58,185 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 2996 transitions. [2022-01-18 09:10:58,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 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-01-18 09:10:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 2996 transitions. [2022-01-18 09:10:58,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-18 09:10:58,188 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:10:58,188 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] [2022-01-18 09:10:58,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 09:10:58,188 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 09:10:58,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:10:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash -629681119, now seen corresponding path program 1 times [2022-01-18 09:10:58,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:10:58,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135596260] [2022-01-18 09:10:58,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:10:58,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:10:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:10:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:10:58,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:10:58,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135596260] [2022-01-18 09:10:58,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135596260] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:10:58,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:10:58,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 09:10:58,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637271621] [2022-01-18 09:10:58,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:10:58,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 09:10:58,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:10:58,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 09:10:58,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-18 09:10:58,472 INFO L87 Difference]: Start difference. First operand 1163 states and 2996 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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-01-18 09:10:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:10:58,690 INFO L93 Difference]: Finished difference Result 1295 states and 3311 transitions. [2022-01-18 09:10:58,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-18 09:10:58,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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 66 [2022-01-18 09:10:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:10:58,697 INFO L225 Difference]: With dead ends: 1295 [2022-01-18 09:10:58,698 INFO L226 Difference]: Without dead ends: 1095 [2022-01-18 09:10:58,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-01-18 09:10:58,699 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 133 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:10:58,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 588 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 09:10:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2022-01-18 09:10:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1093. [2022-01-18 09:10:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1092 states have (on average 2.5641025641025643) internal successors, (2800), 1092 states have internal predecessors, (2800), 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-01-18 09:10:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 2800 transitions. [2022-01-18 09:10:58,726 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 2800 transitions. Word has length 66 [2022-01-18 09:10:58,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:10:58,726 INFO L470 AbstractCegarLoop]: Abstraction has 1093 states and 2800 transitions. [2022-01-18 09:10:58,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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-01-18 09:10:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 2800 transitions. [2022-01-18 09:10:58,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-18 09:10:58,729 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:10:58,730 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] [2022-01-18 09:10:58,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 09:10:58,730 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 09:10:58,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:10:58,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1876285282, now seen corresponding path program 1 times [2022-01-18 09:10:58,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:10:58,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462797072] [2022-01-18 09:10:58,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:10:58,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:10:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:10:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:10:58,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:10:58,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462797072] [2022-01-18 09:10:58,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462797072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:10:58,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:10:58,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 09:10:58,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781383644] [2022-01-18 09:10:58,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:10:58,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 09:10:58,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:10:58,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 09:10:58,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 09:10:58,830 INFO L87 Difference]: Start difference. First operand 1093 states and 2800 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:10:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:10:58,968 INFO L93 Difference]: Finished difference Result 1150 states and 2852 transitions. [2022-01-18 09:10:58,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 09:10:58,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-01-18 09:10:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:10:58,973 INFO L225 Difference]: With dead ends: 1150 [2022-01-18 09:10:58,973 INFO L226 Difference]: Without dead ends: 830 [2022-01-18 09:10:58,974 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-01-18 09:10:58,975 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 130 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:10:58,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 309 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 09:10:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2022-01-18 09:10:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2022-01-18 09:10:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 2.425814234016888) internal successors, (2011), 829 states have internal predecessors, (2011), 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-01-18 09:10:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2011 transitions. [2022-01-18 09:10:58,995 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2011 transitions. Word has length 67 [2022-01-18 09:10:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:10:58,996 INFO L470 AbstractCegarLoop]: Abstraction has 830 states and 2011 transitions. [2022-01-18 09:10:58,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 09:10:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2011 transitions. [2022-01-18 09:10:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-18 09:10:58,998 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:10:58,998 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-01-18 09:10:58,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 09:10:58,999 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 09:10:58,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:10:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1407439487, now seen corresponding path program 1 times [2022-01-18 09:10:58,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:10:58,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257270960] [2022-01-18 09:10:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:10:59,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:10:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:10:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:10:59,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:10:59,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257270960] [2022-01-18 09:10:59,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257270960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:10:59,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:10:59,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 09:10:59,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560328947] [2022-01-18 09:10:59,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:10:59,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 09:10:59,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:10:59,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 09:10:59,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 09:10:59,101 INFO L87 Difference]: Start difference. First operand 830 states and 2011 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-01-18 09:10:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:10:59,242 INFO L93 Difference]: Finished difference Result 617 states and 1419 transitions. [2022-01-18 09:10:59,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 09:10:59,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-01-18 09:10:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:10:59,245 INFO L225 Difference]: With dead ends: 617 [2022-01-18 09:10:59,245 INFO L226 Difference]: Without dead ends: 422 [2022-01-18 09:10:59,246 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-01-18 09:10:59,246 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 184 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:10:59,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 330 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 09:10:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-01-18 09:10:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2022-01-18 09:10:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 2.192399049881235) internal successors, (923), 421 states have internal predecessors, (923), 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-01-18 09:10:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 923 transitions. [2022-01-18 09:10:59,256 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 923 transitions. Word has length 68 [2022-01-18 09:10:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:10:59,256 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 923 transitions. [2022-01-18 09:10:59,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 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-01-18 09:10:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 923 transitions. [2022-01-18 09:10:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-18 09:10:59,258 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:10:59,258 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-01-18 09:10:59,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 09:10:59,258 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 09:10:59,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:10:59,259 INFO L85 PathProgramCache]: Analyzing trace with hash -495097472, now seen corresponding path program 1 times [2022-01-18 09:10:59,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:10:59,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839910121] [2022-01-18 09:10:59,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:10:59,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:10:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:10:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:10:59,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:10:59,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839910121] [2022-01-18 09:10:59,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839910121] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:10:59,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:10:59,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 09:10:59,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359285883] [2022-01-18 09:10:59,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:10:59,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 09:10:59,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:10:59,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 09:10:59,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 09:10:59,370 INFO L87 Difference]: Start difference. First operand 422 states and 923 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-01-18 09:10:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:10:59,480 INFO L93 Difference]: Finished difference Result 629 states and 1403 transitions. [2022-01-18 09:10:59,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 09:10:59,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-01-18 09:10:59,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:10:59,482 INFO L225 Difference]: With dead ends: 629 [2022-01-18 09:10:59,482 INFO L226 Difference]: Without dead ends: 326 [2022-01-18 09:10:59,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-18 09:10:59,484 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 496 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-01-18 09:10:59,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 496 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 09:10:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-01-18 09:10:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2022-01-18 09:10:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.1384615384615384) internal successors, (695), 325 states have internal predecessors, (695), 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-01-18 09:10:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 695 transitions. [2022-01-18 09:10:59,492 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 695 transitions. Word has length 73 [2022-01-18 09:10:59,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:10:59,492 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 695 transitions. [2022-01-18 09:10:59,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-01-18 09:10:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 695 transitions. [2022-01-18 09:10:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-18 09:10:59,493 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:10:59,493 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-01-18 09:10:59,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 09:10:59,494 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 09:10:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:10:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash -813558594, now seen corresponding path program 2 times [2022-01-18 09:10:59,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:10:59,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436044312] [2022-01-18 09:10:59,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:10:59,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:10:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 09:10:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 09:10:59,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 09:10:59,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436044312] [2022-01-18 09:10:59,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436044312] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 09:10:59,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 09:10:59,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-18 09:10:59,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267901746] [2022-01-18 09:10:59,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 09:10:59,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-18 09:10:59,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 09:10:59,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-18 09:10:59,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-18 09:10:59,731 INFO L87 Difference]: Start difference. First operand 326 states and 695 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 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-01-18 09:10:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-18 09:10:59,869 INFO L93 Difference]: Finished difference Result 503 states and 1101 transitions. [2022-01-18 09:10:59,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 09:10:59,870 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 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-01-18 09:10:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-18 09:10:59,871 INFO L225 Difference]: With dead ends: 503 [2022-01-18 09:10:59,872 INFO L226 Difference]: Without dead ends: 290 [2022-01-18 09:10:59,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-01-18 09:10:59,873 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 173 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-18 09:10:59,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 452 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-18 09:10:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-01-18 09:10:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2022-01-18 09:10:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 2.0726643598615917) internal successors, (599), 289 states have internal predecessors, (599), 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-01-18 09:10:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 599 transitions. [2022-01-18 09:10:59,880 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 599 transitions. Word has length 73 [2022-01-18 09:10:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-18 09:10:59,880 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 599 transitions. [2022-01-18 09:10:59,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 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-01-18 09:10:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 599 transitions. [2022-01-18 09:10:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-18 09:10:59,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-18 09:10:59,881 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-01-18 09:10:59,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 09:10:59,882 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-18 09:10:59,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 09:10:59,882 INFO L85 PathProgramCache]: Analyzing trace with hash -74398530, now seen corresponding path program 3 times [2022-01-18 09:10:59,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 09:10:59,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458466358] [2022-01-18 09:10:59,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 09:10:59,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 09:10:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 09:10:59,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 09:10:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 09:10:59,986 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 09:10:59,986 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 09:10:59,987 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-18 09:10:59,989 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-01-18 09:10:59,989 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-01-18 09:10:59,989 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-01-18 09:10:59,989 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-01-18 09:10:59,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 09:10:59,992 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-01-18 09:10:59,996 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 09:10:59,996 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 09:11:00,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 09:11:00 BasicIcfg [2022-01-18 09:11:00,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 09:11:00,089 INFO L158 Benchmark]: Toolchain (without parser) took 5242.24ms. Allocated memory was 383.8MB in the beginning and 543.2MB in the end (delta: 159.4MB). Free memory was 329.1MB in the beginning and 417.0MB in the end (delta: -87.9MB). Peak memory consumption was 71.8MB. Max. memory is 16.0GB. [2022-01-18 09:11:00,089 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 383.8MB. Free memory is still 347.2MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 09:11:00,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.72ms. Allocated memory is still 383.8MB. Free memory was 329.0MB in the beginning and 344.1MB in the end (delta: -15.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.0GB. [2022-01-18 09:11:00,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.15ms. Allocated memory is still 383.8MB. Free memory was 344.1MB in the beginning and 339.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 09:11:00,090 INFO L158 Benchmark]: Boogie Preprocessor took 24.25ms. Allocated memory is still 383.8MB. Free memory was 339.9MB in the beginning and 337.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 09:11:00,090 INFO L158 Benchmark]: RCFGBuilder took 927.96ms. Allocated memory is still 383.8MB. Free memory was 337.8MB in the beginning and 265.4MB in the end (delta: 72.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.0GB. [2022-01-18 09:11:00,091 INFO L158 Benchmark]: TraceAbstraction took 3751.20ms. Allocated memory was 383.8MB in the beginning and 543.2MB in the end (delta: 159.4MB). Free memory was 264.4MB in the beginning and 417.0MB in the end (delta: -152.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.0GB. [2022-01-18 09:11:00,092 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.16ms. Allocated memory is still 383.8MB. Free memory is still 347.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 470.72ms. Allocated memory is still 383.8MB. Free memory was 329.0MB in the beginning and 344.1MB in the end (delta: -15.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 63.15ms. Allocated memory is still 383.8MB. Free memory was 344.1MB in the beginning and 339.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.25ms. Allocated memory is still 383.8MB. Free memory was 339.9MB in the beginning and 337.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 927.96ms. Allocated memory is still 383.8MB. Free memory was 337.8MB in the beginning and 265.4MB in the end (delta: 72.3MB). Peak memory consumption was 71.3MB. Max. memory is 16.0GB. * TraceAbstraction took 3751.20ms. Allocated memory was 383.8MB in the beginning and 543.2MB in the end (delta: 159.4MB). Free memory was 264.4MB in the beginning and 417.0MB in the end (delta: -152.6MB). Peak memory consumption was 7.8MB. Max. memory is 16.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] [L715] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L716] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L717] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L718] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L719] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L720] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L721] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L722] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L723] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L724] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L725] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L726] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L727] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L728] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L730] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t1447; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-1, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [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=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [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=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 990 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 990 mSDsluCounter, 2812 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2325 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 548 IncrementalHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 642 mSDtfsCounter, 548 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1727occurred in iteration=0, InterpolantAutomatonStates: 66, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 531 NumberOfCodeBlocks, 531 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 2193 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-01-18 09:11:00,126 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...