/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-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 11:02:26,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 11:02:26,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 11:02:26,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 11:02:26,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 11:02:26,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 11:02:26,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 11:02:26,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 11:02:26,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 11:02:26,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 11:02:26,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 11:02:26,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 11:02:26,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 11:02:26,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 11:02:26,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 11:02:26,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 11:02:26,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 11:02:26,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 11:02:26,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 11:02:26,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 11:02:26,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 11:02:26,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 11:02:26,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 11:02:26,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 11:02:26,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 11:02:26,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 11:02:26,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 11:02:26,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 11:02:26,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 11:02:26,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 11:02:26,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 11:02:26,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 11:02:26,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 11:02:26,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 11:02:26,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 11:02:26,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 11:02:26,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 11:02:26,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 11:02:26,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 11:02:26,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 11:02:26,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 11:02:26,448 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-PN-NoLbe-After.epf [2022-01-19 11:02:26,465 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 11:02:26,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 11:02:26,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 11:02:26,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 11:02:26,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 11:02:26,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 11:02:26,467 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 11:02:26,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 11:02:26,467 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 11:02:26,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 11:02:26,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 11:02:26,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 11:02:26,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 11:02:26,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 11:02:26,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 11:02:26,468 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 11:02:26,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 11:02:26,468 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 11:02:26,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 11:02:26,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 11:02:26,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 11:02:26,468 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 11:02:26,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 11:02:26,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:02:26,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 11:02:26,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 11:02:26,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 11:02:26,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 11:02:26,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 11:02:26,469 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 11:02:26,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 11:02:26,470 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 11:02:26,470 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-19 11:02:26,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 11:02:26,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 11:02:26,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 11:02:26,651 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 11:02:26,651 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 11:02:26,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2022-01-19 11:02:26,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea9804ba/c6ea36301fc14d7c85e14863b7383993/FLAGc2fcb29b3 [2022-01-19 11:02:27,092 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 11:02:27,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2022-01-19 11:02:27,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea9804ba/c6ea36301fc14d7c85e14863b7383993/FLAGc2fcb29b3 [2022-01-19 11:02:27,448 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea9804ba/c6ea36301fc14d7c85e14863b7383993 [2022-01-19 11:02:27,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 11:02:27,451 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 11:02:27,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 11:02:27,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 11:02:27,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 11:02:27,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:02:27" (1/1) ... [2022-01-19 11:02:27,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@232eb4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:02:27, skipping insertion in model container [2022-01-19 11:02:27,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:02:27" (1/1) ... [2022-01-19 11:02:27,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 11:02:27,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 11:02:27,668 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/mix002.opt.i[944,957] [2022-01-19 11:02:27,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:02:27,875 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 11:02:27,887 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/mix002.opt.i[944,957] [2022-01-19 11:02:27,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:02:27,996 INFO L208 MainTranslator]: Completed translation [2022-01-19 11:02:27,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:02:27 WrapperNode [2022-01-19 11:02:27,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 11:02:27,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 11:02:27,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 11:02:27,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 11:02:28,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:02:27" (1/1) ... [2022-01-19 11:02:28,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:02:27" (1/1) ... [2022-01-19 11:02:28,077 INFO L137 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 283 [2022-01-19 11:02:28,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 11:02:28,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 11:02:28,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 11:02:28,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 11:02:28,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:02:27" (1/1) ... [2022-01-19 11:02:28,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:02:27" (1/1) ... [2022-01-19 11:02:28,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:02:27" (1/1) ... [2022-01-19 11:02:28,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:02:27" (1/1) ... [2022-01-19 11:02:28,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:02:27" (1/1) ... [2022-01-19 11:02:28,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:02:27" (1/1) ... [2022-01-19 11:02:28,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:02:27" (1/1) ... [2022-01-19 11:02:28,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 11:02:28,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 11:02:28,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 11:02:28,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 11:02:28,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:02:27" (1/1) ... [2022-01-19 11:02:28,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:02:28,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 11:02:28,168 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-19 11:02:28,187 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-19 11:02:28,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 11:02:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 11:02:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 11:02:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 11:02:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 11:02:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 11:02:28,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 11:02:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 11:02:28,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 11:02:28,209 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 11:02:28,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 11:02:28,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 11:02:28,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 11:02:28,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 11:02:28,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 11:02:28,211 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 11:02:28,336 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 11:02:28,337 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 11:02:28,856 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 11:02:29,154 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 11:02:29,154 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 11:02:29,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:02:29 BoogieIcfgContainer [2022-01-19 11:02:29,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 11:02:29,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 11:02:29,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 11:02:29,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 11:02:29,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 11:02:27" (1/3) ... [2022-01-19 11:02:29,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476f16c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:02:29, skipping insertion in model container [2022-01-19 11:02:29,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:02:27" (2/3) ... [2022-01-19 11:02:29,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476f16c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:02:29, skipping insertion in model container [2022-01-19 11:02:29,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:02:29" (3/3) ... [2022-01-19 11:02:29,163 INFO L111 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2022-01-19 11:02:29,168 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 11:02:29,168 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 11:02:29,168 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 11:02:29,221 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,221 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,221 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,221 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,222 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,222 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,222 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,222 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,223 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,223 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,223 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,223 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,223 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,224 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,224 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,224 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,224 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,225 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,225 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,225 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,225 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,225 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,226 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,226 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,226 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,226 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,226 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,226 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,227 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,227 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,227 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,227 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,227 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,227 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,228 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,228 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,228 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,228 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,228 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,229 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,229 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,229 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,229 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,229 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,229 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,230 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,230 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,230 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,230 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,230 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,230 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,231 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,231 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,231 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,231 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,231 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,231 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,231 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,233 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,233 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,233 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,234 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,235 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,235 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,235 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,235 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,235 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,235 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,236 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,236 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,236 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,236 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,236 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,236 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,236 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,236 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,237 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,237 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,237 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,238 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,238 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,239 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,241 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,245 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,245 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,245 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,245 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,247 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,247 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,248 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,248 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,248 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,248 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,249 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,249 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,249 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,249 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,249 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,249 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,249 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,250 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,250 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,250 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,250 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,250 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,250 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,250 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,251 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,251 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,252 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,252 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,252 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,252 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,252 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,252 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,252 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,252 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,252 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,252 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,252 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,253 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,253 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,253 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,253 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,253 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,253 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,253 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,253 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,253 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,253 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,253 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,253 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,254 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,254 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,254 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,254 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,254 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,254 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,254 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,254 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,255 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,255 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,255 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,255 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,255 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,257 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,258 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,259 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,259 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,259 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,259 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,259 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,259 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,259 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,259 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,259 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,260 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,260 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,260 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,260 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,260 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,260 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,260 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,260 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,260 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,260 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,260 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,260 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,261 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,261 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,261 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,261 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,261 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,261 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,261 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,261 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,261 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,261 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,261 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,262 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,262 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,262 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,262 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,264 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,264 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,264 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,264 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,264 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,264 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,265 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,266 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,266 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,266 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,266 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,266 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,269 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,269 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,270 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,270 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,270 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,271 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,271 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,271 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,274 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,276 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,277 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,277 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,277 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,277 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,277 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,277 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,277 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,277 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,277 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,278 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,278 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,279 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,284 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,284 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,284 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,284 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,284 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,285 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,285 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,285 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,285 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,285 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,285 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,285 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,285 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,286 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,286 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,286 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,286 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,286 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,286 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,286 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,286 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,286 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,287 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,287 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,287 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,287 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,287 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,287 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,287 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,287 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,287 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,287 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,288 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:02:29,288 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 11:02:29,341 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 11:02:29,355 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=false, mAutomataTypeConcurrency=PETRI_NET, 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-19 11:02:29,356 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 11:02:29,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2022-01-19 11:02:29,428 INFO L129 PetriNetUnfolder]: 2/119 cut-off events. [2022-01-19 11:02:29,429 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:02:29,432 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-01-19 11:02:29,432 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2022-01-19 11:02:29,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2022-01-19 11:02:29,463 INFO L129 PetriNetUnfolder]: 0/79 cut-off events. [2022-01-19 11:02:29,464 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:02:29,464 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:02:29,465 INFO L254 CegarLoopForPetriNet]: 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] [2022-01-19 11:02:29,465 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 11:02:29,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:02:29,470 INFO L85 PathProgramCache]: Analyzing trace with hash 724887777, now seen corresponding path program 1 times [2022-01-19 11:02:29,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:02:29,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2830234] [2022-01-19 11:02:29,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:02:29,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:02:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:02:29,756 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-19 11:02:29,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:02:29,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2830234] [2022-01-19 11:02:29,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2830234] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:02:29,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:02:29,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 11:02:29,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210802904] [2022-01-19 11:02:29,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:02:29,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 11:02:29,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:02:29,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 11:02:29,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 11:02:29,795 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 122 [2022-01-19 11:02:29,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 119 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-19 11:02:29,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:02:29,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 122 [2022-01-19 11:02:29,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:02:29,870 INFO L129 PetriNetUnfolder]: 14/158 cut-off events. [2022-01-19 11:02:29,870 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 11:02:29,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 158 events. 14/158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 289 event pairs, 2 based on Foata normal form. 7/156 useless extension candidates. Maximal degree in co-relation 148. Up to 25 conditions per place. [2022-01-19 11:02:29,873 INFO L132 encePairwiseOnDemand]: 117/122 looper letters, 9 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2022-01-19 11:02:29,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 117 transitions, 265 flow [2022-01-19 11:02:29,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 11:02:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 11:02:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2022-01-19 11:02:29,885 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9371584699453552 [2022-01-19 11:02:29,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2022-01-19 11:02:29,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2022-01-19 11:02:29,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:02:29,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2022-01-19 11:02:29,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-19 11:02:29,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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-19 11:02:29,898 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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-19 11:02:29,899 INFO L186 Difference]: Start difference. First operand has 127 places, 119 transitions, 247 flow. Second operand 3 states and 343 transitions. [2022-01-19 11:02:29,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 117 transitions, 265 flow [2022-01-19 11:02:29,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 117 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 11:02:29,905 INFO L242 Difference]: Finished difference. Result has 124 places, 115 transitions, 240 flow [2022-01-19 11:02:29,907 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=124, PETRI_TRANSITIONS=115} [2022-01-19 11:02:29,910 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, -3 predicate places. [2022-01-19 11:02:29,910 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 240 flow [2022-01-19 11:02:29,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-19 11:02:29,911 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:02:29,911 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:02:29,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 11:02:29,911 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 11:02:29,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:02:29,912 INFO L85 PathProgramCache]: Analyzing trace with hash 243213099, now seen corresponding path program 1 times [2022-01-19 11:02:29,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:02:29,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627944712] [2022-01-19 11:02:29,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:02:29,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:02:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:02:30,083 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-19 11:02:30,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:02:30,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627944712] [2022-01-19 11:02:30,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627944712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:02:30,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:02:30,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:02:30,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083758354] [2022-01-19 11:02:30,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:02:30,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:02:30,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:02:30,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:02:30,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:02:30,088 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 122 [2022-01-19 11:02:30,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 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-19 11:02:30,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:02:30,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 122 [2022-01-19 11:02:30,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:02:30,533 INFO L129 PetriNetUnfolder]: 162/665 cut-off events. [2022-01-19 11:02:30,533 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-01-19 11:02:30,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 665 events. 162/665 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3659 event pairs, 27 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 955. Up to 149 conditions per place. [2022-01-19 11:02:30,540 INFO L132 encePairwiseOnDemand]: 116/122 looper letters, 19 selfloop transitions, 2 changer transitions 45/153 dead transitions. [2022-01-19 11:02:30,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 153 transitions, 442 flow [2022-01-19 11:02:30,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:02:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:02:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 966 transitions. [2022-01-19 11:02:30,547 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8797814207650273 [2022-01-19 11:02:30,547 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 966 transitions. [2022-01-19 11:02:30,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 966 transitions. [2022-01-19 11:02:30,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:02:30,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 966 transitions. [2022-01-19 11:02:30,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.33333333333333) internal successors, (966), 9 states have internal predecessors, (966), 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-19 11:02:30,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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-19 11:02:30,556 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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-19 11:02:30,556 INFO L186 Difference]: Start difference. First operand has 124 places, 115 transitions, 240 flow. Second operand 9 states and 966 transitions. [2022-01-19 11:02:30,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 153 transitions, 442 flow [2022-01-19 11:02:30,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 153 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 11:02:30,561 INFO L242 Difference]: Finished difference. Result has 137 places, 103 transitions, 232 flow [2022-01-19 11:02:30,562 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=137, PETRI_TRANSITIONS=103} [2022-01-19 11:02:30,562 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 10 predicate places. [2022-01-19 11:02:30,563 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 103 transitions, 232 flow [2022-01-19 11:02:30,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 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-19 11:02:30,563 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:02:30,564 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:02:30,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 11:02:30,564 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 11:02:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:02:30,565 INFO L85 PathProgramCache]: Analyzing trace with hash 632902607, now seen corresponding path program 1 times [2022-01-19 11:02:30,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:02:30,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377977545] [2022-01-19 11:02:30,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:02:30,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:02:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:02:30,809 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-19 11:02:30,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:02:30,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377977545] [2022-01-19 11:02:30,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377977545] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:02:30,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:02:30,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:02:30,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598099139] [2022-01-19 11:02:30,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:02:30,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:02:30,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:02:30,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:02:30,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:02:30,815 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2022-01-19 11:02:30,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 103 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 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-19 11:02:30,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:02:30,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2022-01-19 11:02:30,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:02:31,267 INFO L129 PetriNetUnfolder]: 558/1162 cut-off events. [2022-01-19 11:02:31,267 INFO L130 PetriNetUnfolder]: For 311/311 co-relation queries the response was YES. [2022-01-19 11:02:31,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2422 conditions, 1162 events. 558/1162 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6052 event pairs, 309 based on Foata normal form. 30/1138 useless extension candidates. Maximal degree in co-relation 2353. Up to 479 conditions per place. [2022-01-19 11:02:31,275 INFO L132 encePairwiseOnDemand]: 116/122 looper letters, 31 selfloop transitions, 2 changer transitions 43/155 dead transitions. [2022-01-19 11:02:31,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 155 transitions, 513 flow [2022-01-19 11:02:31,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:02:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:02:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 915 transitions. [2022-01-19 11:02:31,278 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-01-19 11:02:31,278 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 915 transitions. [2022-01-19 11:02:31,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 915 transitions. [2022-01-19 11:02:31,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:02:31,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 915 transitions. [2022-01-19 11:02:31,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.66666666666667) internal successors, (915), 9 states have internal predecessors, (915), 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-19 11:02:31,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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-19 11:02:31,284 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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-19 11:02:31,284 INFO L186 Difference]: Start difference. First operand has 137 places, 103 transitions, 232 flow. Second operand 9 states and 915 transitions. [2022-01-19 11:02:31,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 155 transitions, 513 flow [2022-01-19 11:02:31,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 155 transitions, 479 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-01-19 11:02:31,292 INFO L242 Difference]: Finished difference. Result has 126 places, 103 transitions, 236 flow [2022-01-19 11:02:31,293 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=126, PETRI_TRANSITIONS=103} [2022-01-19 11:02:31,293 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, -1 predicate places. [2022-01-19 11:02:31,293 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 103 transitions, 236 flow [2022-01-19 11:02:31,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 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-19 11:02:31,294 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:02:31,294 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:02:31,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 11:02:31,295 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 11:02:31,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:02:31,295 INFO L85 PathProgramCache]: Analyzing trace with hash 900054417, now seen corresponding path program 1 times [2022-01-19 11:02:31,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:02:31,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424790842] [2022-01-19 11:02:31,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:02:31,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:02:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:02:31,454 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-19 11:02:31,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:02:31,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424790842] [2022-01-19 11:02:31,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424790842] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:02:31,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:02:31,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:02:31,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322922964] [2022-01-19 11:02:31,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:02:31,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:02:31,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:02:31,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:02:31,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:02:31,461 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2022-01-19 11:02:31,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 103 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 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-19 11:02:31,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:02:31,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2022-01-19 11:02:31,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:02:31,826 INFO L129 PetriNetUnfolder]: 394/899 cut-off events. [2022-01-19 11:02:31,826 INFO L130 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-01-19 11:02:31,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 899 events. 394/899 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4443 event pairs, 121 based on Foata normal form. 20/885 useless extension candidates. Maximal degree in co-relation 1803. Up to 316 conditions per place. [2022-01-19 11:02:31,833 INFO L132 encePairwiseOnDemand]: 112/122 looper letters, 23 selfloop transitions, 6 changer transitions 31/139 dead transitions. [2022-01-19 11:02:31,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 139 transitions, 452 flow [2022-01-19 11:02:31,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 11:02:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 11:02:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 992 transitions. [2022-01-19 11:02:31,836 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8131147540983606 [2022-01-19 11:02:31,836 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 992 transitions. [2022-01-19 11:02:31,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 992 transitions. [2022-01-19 11:02:31,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:02:31,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 992 transitions. [2022-01-19 11:02:31,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.2) internal successors, (992), 10 states have internal predecessors, (992), 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-19 11:02:31,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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-19 11:02:31,843 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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-19 11:02:31,843 INFO L186 Difference]: Start difference. First operand has 126 places, 103 transitions, 236 flow. Second operand 10 states and 992 transitions. [2022-01-19 11:02:31,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 139 transitions, 452 flow [2022-01-19 11:02:31,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 139 transitions, 418 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-01-19 11:02:31,849 INFO L242 Difference]: Finished difference. Result has 128 places, 103 transitions, 248 flow [2022-01-19 11:02:31,849 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=248, PETRI_PLACES=128, PETRI_TRANSITIONS=103} [2022-01-19 11:02:31,850 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 1 predicate places. [2022-01-19 11:02:31,850 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 103 transitions, 248 flow [2022-01-19 11:02:31,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 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-19 11:02:31,851 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:02:31,851 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:02:31,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 11:02:31,851 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 11:02:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:02:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1030069382, now seen corresponding path program 1 times [2022-01-19 11:02:31,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:02:31,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086414247] [2022-01-19 11:02:31,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:02:31,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:02:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:02:31,996 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-19 11:02:31,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:02:31,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086414247] [2022-01-19 11:02:31,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086414247] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:02:31,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:02:31,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:02:31,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259682748] [2022-01-19 11:02:31,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:02:31,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:02:31,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:02:31,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:02:31,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:02:31,999 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2022-01-19 11:02:31,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 103 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 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-19 11:02:32,000 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:02:32,000 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2022-01-19 11:02:32,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:02:32,355 INFO L129 PetriNetUnfolder]: 556/1214 cut-off events. [2022-01-19 11:02:32,355 INFO L130 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-01-19 11:02:32,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 1214 events. 556/1214 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 7860 event pairs, 20 based on Foata normal form. 0/1189 useless extension candidates. Maximal degree in co-relation 2337. Up to 343 conditions per place. [2022-01-19 11:02:32,362 INFO L132 encePairwiseOnDemand]: 112/122 looper letters, 28 selfloop transitions, 6 changer transitions 45/163 dead transitions. [2022-01-19 11:02:32,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 163 transitions, 551 flow [2022-01-19 11:02:32,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 11:02:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 11:02:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1071 transitions. [2022-01-19 11:02:32,365 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8778688524590164 [2022-01-19 11:02:32,365 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1071 transitions. [2022-01-19 11:02:32,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1071 transitions. [2022-01-19 11:02:32,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:02:32,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1071 transitions. [2022-01-19 11:02:32,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 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-19 11:02:32,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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-19 11:02:32,370 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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-19 11:02:32,370 INFO L186 Difference]: Start difference. First operand has 128 places, 103 transitions, 248 flow. Second operand 10 states and 1071 transitions. [2022-01-19 11:02:32,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 163 transitions, 551 flow [2022-01-19 11:02:32,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 163 transitions, 513 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-01-19 11:02:32,374 INFO L242 Difference]: Finished difference. Result has 128 places, 105 transitions, 278 flow [2022-01-19 11:02:32,374 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=278, PETRI_PLACES=128, PETRI_TRANSITIONS=105} [2022-01-19 11:02:32,377 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 1 predicate places. [2022-01-19 11:02:32,377 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 105 transitions, 278 flow [2022-01-19 11:02:32,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 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-19 11:02:32,378 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:02:32,378 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:02:32,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 11:02:32,378 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 11:02:32,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:02:32,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1894180393, now seen corresponding path program 1 times [2022-01-19 11:02:32,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:02:32,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568943512] [2022-01-19 11:02:32,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:02:32,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:02:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:02:32,572 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-19 11:02:32,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:02:32,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568943512] [2022-01-19 11:02:32,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568943512] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:02:32,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:02:32,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 11:02:32,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712498437] [2022-01-19 11:02:32,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:02:32,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 11:02:32,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:02:32,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 11:02:32,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 11:02:32,575 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122 [2022-01-19 11:02:32,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 105 transitions, 278 flow. Second operand has 8 states, 8 states have (on average 93.875) internal successors, (751), 8 states have internal predecessors, (751), 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-19 11:02:32,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:02:32,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122 [2022-01-19 11:02:32,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:02:32,969 INFO L129 PetriNetUnfolder]: 545/1743 cut-off events. [2022-01-19 11:02:32,969 INFO L130 PetriNetUnfolder]: For 947/986 co-relation queries the response was YES. [2022-01-19 11:02:32,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 1743 events. 545/1743 cut-off events. For 947/986 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 13011 event pairs, 247 based on Foata normal form. 18/1675 useless extension candidates. Maximal degree in co-relation 3854. Up to 397 conditions per place. [2022-01-19 11:02:32,985 INFO L132 encePairwiseOnDemand]: 110/122 looper letters, 48 selfloop transitions, 11 changer transitions 0/138 dead transitions. [2022-01-19 11:02:32,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 138 transitions, 476 flow [2022-01-19 11:02:32,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 11:02:32,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 11:02:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 788 transitions. [2022-01-19 11:02:32,988 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8073770491803278 [2022-01-19 11:02:32,988 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 788 transitions. [2022-01-19 11:02:32,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 788 transitions. [2022-01-19 11:02:32,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:02:32,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 788 transitions. [2022-01-19 11:02:32,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 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-19 11:02:32,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 122.0) internal successors, (1098), 9 states have internal predecessors, (1098), 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-19 11:02:32,992 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 122.0) internal successors, (1098), 9 states have internal predecessors, (1098), 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-19 11:02:32,992 INFO L186 Difference]: Start difference. First operand has 128 places, 105 transitions, 278 flow. Second operand 8 states and 788 transitions. [2022-01-19 11:02:32,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 138 transitions, 476 flow [2022-01-19 11:02:32,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 138 transitions, 462 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-01-19 11:02:32,998 INFO L242 Difference]: Finished difference. Result has 129 places, 109 transitions, 319 flow [2022-01-19 11:02:32,998 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=319, PETRI_PLACES=129, PETRI_TRANSITIONS=109} [2022-01-19 11:02:33,000 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 2 predicate places. [2022-01-19 11:02:33,001 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 109 transitions, 319 flow [2022-01-19 11:02:33,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.875) internal successors, (751), 8 states have internal predecessors, (751), 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-19 11:02:33,001 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:02:33,001 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:02:33,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 11:02:33,002 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 11:02:33,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:02:33,003 INFO L85 PathProgramCache]: Analyzing trace with hash -700508343, now seen corresponding path program 2 times [2022-01-19 11:02:33,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:02:33,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402027658] [2022-01-19 11:02:33,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:02:33,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:02:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:02:33,098 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-19 11:02:33,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:02:33,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402027658] [2022-01-19 11:02:33,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402027658] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:02:33,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:02:33,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:02:33,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405294186] [2022-01-19 11:02:33,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:02:33,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:02:33,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:02:33,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:02:33,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:02:33,101 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2022-01-19 11:02:33,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 109 transitions, 319 flow. Second operand has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 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-19 11:02:33,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:02:33,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2022-01-19 11:02:33,102 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:02:33,440 INFO L129 PetriNetUnfolder]: 423/1113 cut-off events. [2022-01-19 11:02:33,441 INFO L130 PetriNetUnfolder]: For 1046/1053 co-relation queries the response was YES. [2022-01-19 11:02:33,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2927 conditions, 1113 events. 423/1113 cut-off events. For 1046/1053 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7350 event pairs, 26 based on Foata normal form. 45/1136 useless extension candidates. Maximal degree in co-relation 2874. Up to 305 conditions per place. [2022-01-19 11:02:33,446 INFO L132 encePairwiseOnDemand]: 113/122 looper letters, 33 selfloop transitions, 9 changer transitions 38/165 dead transitions. [2022-01-19 11:02:33,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 165 transitions, 715 flow [2022-01-19 11:02:33,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 11:02:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 11:02:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1069 transitions. [2022-01-19 11:02:33,449 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8762295081967213 [2022-01-19 11:02:33,449 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1069 transitions. [2022-01-19 11:02:33,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1069 transitions. [2022-01-19 11:02:33,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:02:33,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1069 transitions. [2022-01-19 11:02:33,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 106.9) internal successors, (1069), 10 states have internal predecessors, (1069), 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-19 11:02:33,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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-19 11:02:33,454 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 122.0) internal successors, (1342), 11 states have internal predecessors, (1342), 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-19 11:02:33,454 INFO L186 Difference]: Start difference. First operand has 129 places, 109 transitions, 319 flow. Second operand 10 states and 1069 transitions. [2022-01-19 11:02:33,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 165 transitions, 715 flow [2022-01-19 11:02:33,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 165 transitions, 700 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-01-19 11:02:33,458 INFO L242 Difference]: Finished difference. Result has 142 places, 109 transitions, 364 flow [2022-01-19 11:02:33,459 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=364, PETRI_PLACES=142, PETRI_TRANSITIONS=109} [2022-01-19 11:02:33,459 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 15 predicate places. [2022-01-19 11:02:33,459 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 109 transitions, 364 flow [2022-01-19 11:02:33,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 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-19 11:02:33,460 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:02:33,460 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:02:33,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 11:02:33,460 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 11:02:33,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:02:33,461 INFO L85 PathProgramCache]: Analyzing trace with hash -180861148, now seen corresponding path program 1 times [2022-01-19 11:02:33,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:02:33,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5878799] [2022-01-19 11:02:33,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:02:33,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:02:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:02:33,584 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-19 11:02:33,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:02:33,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5878799] [2022-01-19 11:02:33,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5878799] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:02:33,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:02:33,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 11:02:33,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178064807] [2022-01-19 11:02:33,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:02:33,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 11:02:33,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:02:33,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 11:02:33,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 11:02:33,586 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2022-01-19 11:02:33,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 109 transitions, 364 flow. Second operand has 8 states, 8 states have (on average 101.0) internal successors, (808), 8 states have internal predecessors, (808), 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-19 11:02:33,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:02:33,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2022-01-19 11:02:33,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:02:33,829 INFO L129 PetriNetUnfolder]: 129/494 cut-off events. [2022-01-19 11:02:33,829 INFO L130 PetriNetUnfolder]: For 989/995 co-relation queries the response was YES. [2022-01-19 11:02:33,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 494 events. 129/494 cut-off events. For 989/995 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2620 event pairs, 8 based on Foata normal form. 20/499 useless extension candidates. Maximal degree in co-relation 1419. Up to 115 conditions per place. [2022-01-19 11:02:33,832 INFO L132 encePairwiseOnDemand]: 113/122 looper letters, 23 selfloop transitions, 12 changer transitions 22/141 dead transitions. [2022-01-19 11:02:33,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 141 transitions, 650 flow [2022-01-19 11:02:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 11:02:33,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 11:02:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1147 transitions. [2022-01-19 11:02:33,835 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8546944858420268 [2022-01-19 11:02:33,836 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1147 transitions. [2022-01-19 11:02:33,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1147 transitions. [2022-01-19 11:02:33,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:02:33,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1147 transitions. [2022-01-19 11:02:33,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 104.27272727272727) internal successors, (1147), 11 states have internal predecessors, (1147), 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-19 11:02:33,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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-19 11:02:33,841 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 122.0) internal successors, (1464), 12 states have internal predecessors, (1464), 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-19 11:02:33,841 INFO L186 Difference]: Start difference. First operand has 142 places, 109 transitions, 364 flow. Second operand 11 states and 1147 transitions. [2022-01-19 11:02:33,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 141 transitions, 650 flow [2022-01-19 11:02:33,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 141 transitions, 533 flow, removed 44 selfloop flow, removed 15 redundant places. [2022-01-19 11:02:33,847 INFO L242 Difference]: Finished difference. Result has 136 places, 108 transitions, 330 flow [2022-01-19 11:02:33,848 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=330, PETRI_PLACES=136, PETRI_TRANSITIONS=108} [2022-01-19 11:02:33,848 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 9 predicate places. [2022-01-19 11:02:33,848 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 108 transitions, 330 flow [2022-01-19 11:02:33,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.0) internal successors, (808), 8 states have internal predecessors, (808), 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-19 11:02:33,849 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:02:33,849 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:02:33,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 11:02:33,849 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 11:02:33,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:02:33,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2134025311, now seen corresponding path program 1 times [2022-01-19 11:02:33,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:02:33,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226858716] [2022-01-19 11:02:33,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:02:33,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:02:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:02:33,987 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-19 11:02:33,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:02:33,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226858716] [2022-01-19 11:02:33,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226858716] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:02:33,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:02:33,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:02:33,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947231196] [2022-01-19 11:02:33,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:02:33,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:02:33,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:02:33,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:02:33,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:02:33,989 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2022-01-19 11:02:33,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 108 transitions, 330 flow. Second operand has 7 states, 7 states have (on average 101.57142857142857) internal successors, (711), 7 states have internal predecessors, (711), 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-19 11:02:33,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:02:33,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2022-01-19 11:02:33,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:02:34,138 INFO L129 PetriNetUnfolder]: 44/306 cut-off events. [2022-01-19 11:02:34,138 INFO L130 PetriNetUnfolder]: For 202/212 co-relation queries the response was YES. [2022-01-19 11:02:34,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 306 events. 44/306 cut-off events. For 202/212 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1204 event pairs, 11 based on Foata normal form. 1/297 useless extension candidates. Maximal degree in co-relation 581. Up to 44 conditions per place. [2022-01-19 11:02:34,140 INFO L132 encePairwiseOnDemand]: 116/122 looper letters, 18 selfloop transitions, 1 changer transitions 13/122 dead transitions. [2022-01-19 11:02:34,140 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 122 transitions, 428 flow [2022-01-19 11:02:34,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 11:02:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 11:02:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 726 transitions. [2022-01-19 11:02:34,142 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8501170960187353 [2022-01-19 11:02:34,142 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 726 transitions. [2022-01-19 11:02:34,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 726 transitions. [2022-01-19 11:02:34,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:02:34,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 726 transitions. [2022-01-19 11:02:34,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.71428571428571) internal successors, (726), 7 states have internal predecessors, (726), 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-19 11:02:34,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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-19 11:02:34,146 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 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-19 11:02:34,146 INFO L186 Difference]: Start difference. First operand has 136 places, 108 transitions, 330 flow. Second operand 7 states and 726 transitions. [2022-01-19 11:02:34,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 122 transitions, 428 flow [2022-01-19 11:02:34,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 342 flow, removed 24 selfloop flow, removed 16 redundant places. [2022-01-19 11:02:34,149 INFO L242 Difference]: Finished difference. Result has 126 places, 108 transitions, 259 flow [2022-01-19 11:02:34,150 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=126, PETRI_TRANSITIONS=108} [2022-01-19 11:02:34,150 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, -1 predicate places. [2022-01-19 11:02:34,150 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 108 transitions, 259 flow [2022-01-19 11:02:34,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.57142857142857) internal successors, (711), 7 states have internal predecessors, (711), 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-19 11:02:34,151 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:02:34,151 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:02:34,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 11:02:34,151 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 11:02:34,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:02:34,151 INFO L85 PathProgramCache]: Analyzing trace with hash -630733513, now seen corresponding path program 2 times [2022-01-19 11:02:34,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:02:34,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187067008] [2022-01-19 11:02:34,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:02:34,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:02:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:02:34,502 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-19 11:02:34,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:02:34,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187067008] [2022-01-19 11:02:34,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187067008] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:02:34,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:02:34,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 11:02:34,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060966271] [2022-01-19 11:02:34,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:02:34,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 11:02:34,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:02:34,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 11:02:34,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-19 11:02:34,505 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 122 [2022-01-19 11:02:34,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 108 transitions, 259 flow. Second operand has 13 states, 13 states have (on average 94.84615384615384) internal successors, (1233), 13 states have internal predecessors, (1233), 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-19 11:02:34,506 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:02:34,506 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 122 [2022-01-19 11:02:34,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:02:34,784 INFO L129 PetriNetUnfolder]: 19/218 cut-off events. [2022-01-19 11:02:34,785 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-01-19 11:02:34,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 218 events. 19/218 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 588 event pairs, 0 based on Foata normal form. 1/213 useless extension candidates. Maximal degree in co-relation 323. Up to 18 conditions per place. [2022-01-19 11:02:34,786 INFO L132 encePairwiseOnDemand]: 108/122 looper letters, 15 selfloop transitions, 9 changer transitions 11/119 dead transitions. [2022-01-19 11:02:34,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 119 transitions, 359 flow [2022-01-19 11:02:34,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 11:02:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 11:02:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1524 transitions. [2022-01-19 11:02:34,790 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7807377049180327 [2022-01-19 11:02:34,790 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1524 transitions. [2022-01-19 11:02:34,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1524 transitions. [2022-01-19 11:02:34,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:02:34,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1524 transitions. [2022-01-19 11:02:34,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 95.25) internal successors, (1524), 16 states have internal predecessors, (1524), 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-19 11:02:34,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 122.0) internal successors, (2074), 17 states have internal predecessors, (2074), 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-19 11:02:34,797 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 122.0) internal successors, (2074), 17 states have internal predecessors, (2074), 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-19 11:02:34,797 INFO L186 Difference]: Start difference. First operand has 126 places, 108 transitions, 259 flow. Second operand 16 states and 1524 transitions. [2022-01-19 11:02:34,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 119 transitions, 359 flow [2022-01-19 11:02:34,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 119 transitions, 344 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-01-19 11:02:34,800 INFO L242 Difference]: Finished difference. Result has 139 places, 108 transitions, 288 flow [2022-01-19 11:02:34,800 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=288, PETRI_PLACES=139, PETRI_TRANSITIONS=108} [2022-01-19 11:02:34,800 INFO L334 CegarLoopForPetriNet]: 127 programPoint places, 12 predicate places. [2022-01-19 11:02:34,801 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 108 transitions, 288 flow [2022-01-19 11:02:34,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 94.84615384615384) internal successors, (1233), 13 states have internal predecessors, (1233), 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-19 11:02:34,801 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:02:34,801 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:02:34,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 11:02:34,802 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 11:02:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:02:34,802 INFO L85 PathProgramCache]: Analyzing trace with hash 327782475, now seen corresponding path program 3 times [2022-01-19 11:02:34,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:02:34,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626333734] [2022-01-19 11:02:34,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:02:34,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:02:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:02:34,857 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 11:02:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:02:34,966 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 11:02:34,966 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 11:02:34,967 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 11:02:34,968 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-19 11:02:34,968 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 11:02:34,968 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-19 11:02:34,969 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-19 11:02:34,969 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 11:02:34,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 11:02:34,972 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2022-01-19 11:02:34,976 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 11:02:34,976 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 11:02:35,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 11:02:35 BasicIcfg [2022-01-19 11:02:35,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 11:02:35,139 INFO L158 Benchmark]: Toolchain (without parser) took 7687.15ms. Allocated memory was 362.8MB in the beginning and 534.8MB in the end (delta: 172.0MB). Free memory was 308.5MB in the beginning and 437.0MB in the end (delta: -128.5MB). Peak memory consumption was 45.4MB. Max. memory is 16.0GB. [2022-01-19 11:02:35,139 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 362.8MB. Free memory is still 326.3MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 11:02:35,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.42ms. Allocated memory is still 362.8MB. Free memory was 308.2MB in the beginning and 321.8MB in the end (delta: -13.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.0GB. [2022-01-19 11:02:35,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.19ms. Allocated memory is still 362.8MB. Free memory was 321.8MB in the beginning and 318.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 11:02:35,140 INFO L158 Benchmark]: Boogie Preprocessor took 55.45ms. Allocated memory is still 362.8MB. Free memory was 318.7MB in the beginning and 316.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 11:02:35,140 INFO L158 Benchmark]: RCFGBuilder took 1022.28ms. Allocated memory is still 362.8MB. Free memory was 316.6MB in the beginning and 219.0MB in the end (delta: 97.5MB). Peak memory consumption was 98.6MB. Max. memory is 16.0GB. [2022-01-19 11:02:35,140 INFO L158 Benchmark]: TraceAbstraction took 5980.22ms. Allocated memory was 362.8MB in the beginning and 534.8MB in the end (delta: 172.0MB). Free memory was 219.0MB in the beginning and 437.0MB in the end (delta: -217.9MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 11:02:35,143 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.10ms. Allocated memory is still 362.8MB. Free memory is still 326.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 544.42ms. Allocated memory is still 362.8MB. Free memory was 308.2MB in the beginning and 321.8MB in the end (delta: -13.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 80.19ms. Allocated memory is still 362.8MB. Free memory was 321.8MB in the beginning and 318.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 55.45ms. Allocated memory is still 362.8MB. Free memory was 318.7MB in the beginning and 316.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1022.28ms. Allocated memory is still 362.8MB. Free memory was 316.6MB in the beginning and 219.0MB in the end (delta: 97.5MB). Peak memory consumption was 98.6MB. Max. memory is 16.0GB. * TraceAbstraction took 5980.22ms. Allocated memory was 362.8MB in the beginning and 534.8MB in the end (delta: 172.0MB). Free memory was 219.0MB in the beginning and 437.0MB in the end (delta: -217.9MB). There was no memory consumed. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L719] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L721] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L723] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L724] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L725] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L727] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L729] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L731] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L732] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L733] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L734] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L735] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L736] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L737] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L742] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L743] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L744] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L745] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L746] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L747] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t41; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t41={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] FCALL, FORK 0 pthread_create(&t41, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t41, ((void *)0), P0, ((void *)0))=-2, t41={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t42; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t41={5:0}, t42={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] FCALL, FORK 0 pthread_create(&t42, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t42, ((void *)0), P1, ((void *)0))=-1, t41={5:0}, t42={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t43; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t43, ((void *)0), P2, ((void *)0))=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L821] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L821] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L822] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L822] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L823] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L823] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L824] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L824] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L825] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L826] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L827] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EAX = z [L829] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L836] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L836] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L837] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L838] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L839] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L840] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=3, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L876] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=3, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 482 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 482 mSDsluCounter, 499 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 849 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1083 IncrementalHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 111 mSDtfsCounter, 1083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=7, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 963 NumberOfCodeBlocks, 963 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 857 ConstructedInterpolants, 0 QuantifiedInterpolants, 3182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-19 11:02:35,181 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...