./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 02:49:27,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 02:49:27,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 02:49:28,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 02:49:28,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 02:49:28,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 02:49:28,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 02:49:28,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 02:49:28,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 02:49:28,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 02:49:28,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 02:49:28,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 02:49:28,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 02:49:28,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 02:49:28,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 02:49:28,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 02:49:28,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 02:49:28,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 02:49:28,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 02:49:28,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 02:49:28,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 02:49:28,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 02:49:28,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 02:49:28,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 02:49:28,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 02:49:28,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 02:49:28,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 02:49:28,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 02:49:28,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 02:49:28,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 02:49:28,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 02:49:28,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 02:49:28,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 02:49:28,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 02:49:28,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 02:49:28,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 02:49:28,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 02:49:28,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 02:49:28,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 02:49:28,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 02:49:28,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 02:49:28,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 02:49:28,122 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 02:49:28,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 02:49:28,124 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 02:49:28,124 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 02:49:28,125 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 02:49:28,125 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 02:49:28,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 02:49:28,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 02:49:28,126 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 02:49:28,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 02:49:28,127 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 02:49:28,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 02:49:28,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 02:49:28,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 02:49:28,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 02:49:28,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 02:49:28,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 02:49:28,129 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 02:49:28,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 02:49:28,129 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 02:49:28,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 02:49:28,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 02:49:28,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 02:49:28,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 02:49:28,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:49:28,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 02:49:28,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 02:49:28,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 02:49:28,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 02:49:28,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 02:49:28,140 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 02:49:28,140 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 02:49:28,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 02:49:28,141 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76dbb78f4fe406633111c7d7e2c1e8bd933a1f67e6e1cf5d4cbd1b0379bfe086 [2021-12-28 02:49:28,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 02:49:28,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 02:49:28,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 02:49:28,485 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 02:49:28,485 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 02:49:28,486 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2021-12-28 02:49:28,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e814fe55/4ea2e93f44204b3ea5620afd37a157a8/FLAGb3dcd0fcd [2021-12-28 02:49:29,078 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 02:49:29,079 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2021-12-28 02:49:29,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e814fe55/4ea2e93f44204b3ea5620afd37a157a8/FLAGb3dcd0fcd [2021-12-28 02:49:29,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e814fe55/4ea2e93f44204b3ea5620afd37a157a8 [2021-12-28 02:49:29,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 02:49:29,570 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 02:49:29,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 02:49:29,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 02:49:29,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 02:49:29,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:49:29" (1/1) ... [2021-12-28 02:49:29,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be137ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:29, skipping insertion in model container [2021-12-28 02:49:29,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:49:29" (1/1) ... [2021-12-28 02:49:29,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 02:49:29,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 02:49:29,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2021-12-28 02:49:29,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:49:30,001 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 02:49:30,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2021-12-28 02:49:30,080 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 02:49:30,118 INFO L208 MainTranslator]: Completed translation [2021-12-28 02:49:30,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:30 WrapperNode [2021-12-28 02:49:30,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 02:49:30,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 02:49:30,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 02:49:30,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 02:49:30,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:30" (1/1) ... [2021-12-28 02:49:30,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:30" (1/1) ... [2021-12-28 02:49:30,202 INFO L137 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 192 [2021-12-28 02:49:30,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 02:49:30,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 02:49:30,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 02:49:30,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 02:49:30,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:30" (1/1) ... [2021-12-28 02:49:30,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:30" (1/1) ... [2021-12-28 02:49:30,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:30" (1/1) ... [2021-12-28 02:49:30,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:30" (1/1) ... [2021-12-28 02:49:30,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:30" (1/1) ... [2021-12-28 02:49:30,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:30" (1/1) ... [2021-12-28 02:49:30,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:30" (1/1) ... [2021-12-28 02:49:30,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 02:49:30,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 02:49:30,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 02:49:30,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 02:49:30,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:30" (1/1) ... [2021-12-28 02:49:30,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 02:49:30,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 02:49:30,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 02:49:30,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 02:49:30,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 02:49:30,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-28 02:49:30,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 02:49:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 02:49:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 02:49:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-28 02:49:30,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-28 02:49:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-28 02:49:30,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-28 02:49:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-28 02:49:30,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-28 02:49:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-12-28 02:49:30,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-12-28 02:49:30,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 02:49:30,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-28 02:49:30,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 02:49:30,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 02:49:30,475 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-28 02:49:30,666 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 02:49:30,667 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 02:49:31,218 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 02:49:31,502 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 02:49:31,503 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 02:49:31,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:49:31 BoogieIcfgContainer [2021-12-28 02:49:31,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 02:49:31,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 02:49:31,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 02:49:31,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 02:49:31,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:49:29" (1/3) ... [2021-12-28 02:49:31,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a236232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:49:31, skipping insertion in model container [2021-12-28 02:49:31,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:49:30" (2/3) ... [2021-12-28 02:49:31,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a236232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:49:31, skipping insertion in model container [2021-12-28 02:49:31,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:49:31" (3/3) ... [2021-12-28 02:49:31,512 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2021-12-28 02:49:31,517 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-28 02:49:31,517 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 02:49:31,517 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-28 02:49:31,518 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-28 02:49:31,558 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,558 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,559 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,559 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,559 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,559 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,559 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,559 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,560 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,560 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,560 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,560 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,561 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,561 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,561 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,561 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,562 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,562 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,562 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,562 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,562 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,562 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,563 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,563 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,563 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,563 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,564 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,564 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,564 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,564 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,565 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,565 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,565 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,565 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,566 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,566 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,566 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,566 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,566 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,566 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,567 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,567 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,567 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,567 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,567 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,568 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,568 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,568 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,568 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,569 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,569 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,569 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,569 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,569 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,569 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,570 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,570 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,570 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,571 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,571 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,571 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,571 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,572 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,572 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,572 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,572 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,572 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,573 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,574 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,574 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,574 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,575 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,575 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,575 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,575 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,575 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,576 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,576 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,576 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,576 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,577 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,577 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,577 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,577 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,577 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,578 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,578 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,578 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,578 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,578 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,578 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,579 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,579 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,579 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,579 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,579 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,579 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,579 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,580 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,581 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,581 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,581 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,581 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,581 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,581 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,581 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,582 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,582 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,582 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,582 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,582 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,582 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,582 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,583 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,583 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,583 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,583 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,583 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,583 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,583 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,586 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,586 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,586 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,586 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,587 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,587 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,587 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,587 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,587 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,587 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,587 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,588 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,588 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,588 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,588 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,588 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,588 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,588 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,589 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,589 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,589 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,589 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,589 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,589 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,590 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,590 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,590 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,590 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,590 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,590 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,590 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,591 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,591 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,591 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,591 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,591 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,591 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,591 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,594 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,594 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,594 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,595 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,595 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,595 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,595 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,596 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,596 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,596 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,596 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,596 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,596 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,597 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,597 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,597 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,598 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,598 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,600 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,601 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,601 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,601 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,601 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,601 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,601 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,602 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,602 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,602 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,611 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,612 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,612 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,612 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,612 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,612 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,612 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,613 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,613 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,613 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,613 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,613 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,614 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,614 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,614 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,615 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,615 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,615 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,615 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,615 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,615 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,616 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,616 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,616 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,616 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,616 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,616 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,617 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,617 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,617 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,617 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,617 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,617 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,618 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,618 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,618 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,618 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,618 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,618 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,619 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,619 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,619 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,619 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,619 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,619 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,620 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,621 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,621 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,621 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,621 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,621 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,621 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,621 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,622 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,622 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 02:49:31,622 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-28 02:49:31,663 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 02:49:31,669 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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 [2021-12-28 02:49:31,670 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-12-28 02:49:31,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2021-12-28 02:49:31,721 INFO L129 PetriNetUnfolder]: 2/132 cut-off events. [2021-12-28 02:49:31,721 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-28 02:49:31,725 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2021-12-28 02:49:31,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2021-12-28 02:49:31,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2021-12-28 02:49:31,737 INFO L129 PetriNetUnfolder]: 0/50 cut-off events. [2021-12-28 02:49:31,738 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-28 02:49:31,738 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:31,738 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] [2021-12-28 02:49:31,739 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:31,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1142825894, now seen corresponding path program 1 times [2021-12-28 02:49:31,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:31,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427239110] [2021-12-28 02:49:31,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:31,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:32,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:32,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427239110] [2021-12-28 02:49:32,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427239110] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:32,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:32,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 02:49:32,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084615619] [2021-12-28 02:49:32,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:32,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 02:49:32,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:32,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 02:49:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 02:49:32,127 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 136 [2021-12-28 02:49:32,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:32,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:32,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 136 [2021-12-28 02:49:32,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:32,376 INFO L129 PetriNetUnfolder]: 162/546 cut-off events. [2021-12-28 02:49:32,377 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-12-28 02:49:32,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 546 events. 162/546 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2881 event pairs, 34 based on Foata normal form. 45/560 useless extension candidates. Maximal degree in co-relation 795. Up to 191 conditions per place. [2021-12-28 02:49:32,385 INFO L132 encePairwiseOnDemand]: 131/136 looper letters, 18 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2021-12-28 02:49:32,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 333 flow [2021-12-28 02:49:32,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 02:49:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-28 02:49:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2021-12-28 02:49:32,402 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9436274509803921 [2021-12-28 02:49:32,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2021-12-28 02:49:32,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2021-12-28 02:49:32,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:32,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2021-12-28 02:49:32,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:32,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:32,420 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:32,422 INFO L186 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 385 transitions. [2021-12-28 02:49:32,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 333 flow [2021-12-28 02:49:32,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 136 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-28 02:49:32,430 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2021-12-28 02:49:32,432 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2021-12-28 02:49:32,435 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2021-12-28 02:49:32,435 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2021-12-28 02:49:32,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:32,436 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:32,436 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] [2021-12-28 02:49:32,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 02:49:32,437 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:32,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:32,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1080347648, now seen corresponding path program 1 times [2021-12-28 02:49:32,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:32,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872131813] [2021-12-28 02:49:32,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:32,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:32,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:32,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872131813] [2021-12-28 02:49:32,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872131813] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:32,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:32,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:49:32,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320134806] [2021-12-28 02:49:32,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:32,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:49:32,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:32,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:49:32,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:49:32,607 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2021-12-28 02:49:32,608 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:32,608 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:32,608 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2021-12-28 02:49:32,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:33,891 INFO L129 PetriNetUnfolder]: 2125/5419 cut-off events. [2021-12-28 02:49:33,892 INFO L130 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2021-12-28 02:49:33,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8744 conditions, 5419 events. 2125/5419 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 47798 event pairs, 1020 based on Foata normal form. 0/5256 useless extension candidates. Maximal degree in co-relation 8688. Up to 1734 conditions per place. [2021-12-28 02:49:33,928 INFO L132 encePairwiseOnDemand]: 129/136 looper letters, 27 selfloop transitions, 3 changer transitions 65/189 dead transitions. [2021-12-28 02:49:33,928 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 189 transitions, 574 flow [2021-12-28 02:49:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:49:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:49:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1083 transitions. [2021-12-28 02:49:33,932 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8848039215686274 [2021-12-28 02:49:33,932 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1083 transitions. [2021-12-28 02:49:33,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1083 transitions. [2021-12-28 02:49:33,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:33,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1083 transitions. [2021-12-28 02:49:33,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.33333333333333) internal successors, (1083), 9 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:33,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:33,941 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:33,941 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 9 states and 1083 transitions. [2021-12-28 02:49:33,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 189 transitions, 574 flow [2021-12-28 02:49:33,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 189 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-28 02:49:33,946 INFO L242 Difference]: Finished difference. Result has 152 places, 116 transitions, 279 flow [2021-12-28 02:49:33,946 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=279, PETRI_PLACES=152, PETRI_TRANSITIONS=116} [2021-12-28 02:49:33,947 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 9 predicate places. [2021-12-28 02:49:33,947 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 116 transitions, 279 flow [2021-12-28 02:49:33,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:33,948 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:33,948 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] [2021-12-28 02:49:33,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 02:49:33,949 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:33,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:33,949 INFO L85 PathProgramCache]: Analyzing trace with hash -203435521, now seen corresponding path program 1 times [2021-12-28 02:49:33,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:33,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198711986] [2021-12-28 02:49:33,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:33,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:34,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:34,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198711986] [2021-12-28 02:49:34,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198711986] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:34,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:34,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:49:34,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520411791] [2021-12-28 02:49:34,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:34,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:49:34,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:34,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:49:34,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:49:34,123 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2021-12-28 02:49:34,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 116 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:34,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:34,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2021-12-28 02:49:34,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:35,743 INFO L129 PetriNetUnfolder]: 4967/8970 cut-off events. [2021-12-28 02:49:35,743 INFO L130 PetriNetUnfolder]: For 1699/1699 co-relation queries the response was YES. [2021-12-28 02:49:35,800 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17751 conditions, 8970 events. 4967/8970 cut-off events. For 1699/1699 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 70821 event pairs, 309 based on Foata normal form. 0/8651 useless extension candidates. Maximal degree in co-relation 17688. Up to 2617 conditions per place. [2021-12-28 02:49:35,853 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 77 selfloop transitions, 18 changer transitions 10/198 dead transitions. [2021-12-28 02:49:35,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 198 transitions, 659 flow [2021-12-28 02:49:35,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 02:49:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-28 02:49:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1197 transitions. [2021-12-28 02:49:35,857 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8801470588235294 [2021-12-28 02:49:35,857 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1197 transitions. [2021-12-28 02:49:35,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1197 transitions. [2021-12-28 02:49:35,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:35,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1197 transitions. [2021-12-28 02:49:35,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.7) internal successors, (1197), 10 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:35,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:35,866 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:35,866 INFO L186 Difference]: Start difference. First operand has 152 places, 116 transitions, 279 flow. Second operand 10 states and 1197 transitions. [2021-12-28 02:49:35,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 198 transitions, 659 flow [2021-12-28 02:49:35,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 198 transitions, 650 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-12-28 02:49:35,893 INFO L242 Difference]: Finished difference. Result has 143 places, 132 transitions, 402 flow [2021-12-28 02:49:35,894 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=402, PETRI_PLACES=143, PETRI_TRANSITIONS=132} [2021-12-28 02:49:35,895 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 0 predicate places. [2021-12-28 02:49:35,895 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 402 flow [2021-12-28 02:49:35,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:35,896 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:35,896 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] [2021-12-28 02:49:35,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 02:49:35,896 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:35,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:35,897 INFO L85 PathProgramCache]: Analyzing trace with hash 69267629, now seen corresponding path program 1 times [2021-12-28 02:49:35,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:35,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543735846] [2021-12-28 02:49:35,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:35,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:36,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:36,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543735846] [2021-12-28 02:49:36,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543735846] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:36,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:36,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 02:49:36,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732368055] [2021-12-28 02:49:36,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:36,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 02:49:36,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:36,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 02:49:36,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 02:49:36,104 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2021-12-28 02:49:36,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:36,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:36,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2021-12-28 02:49:36,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:38,511 INFO L129 PetriNetUnfolder]: 5576/13211 cut-off events. [2021-12-28 02:49:38,512 INFO L130 PetriNetUnfolder]: For 8699/9673 co-relation queries the response was YES. [2021-12-28 02:49:38,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30918 conditions, 13211 events. 5576/13211 cut-off events. For 8699/9673 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 134724 event pairs, 1814 based on Foata normal form. 266/12766 useless extension candidates. Maximal degree in co-relation 30847. Up to 3697 conditions per place. [2021-12-28 02:49:38,708 INFO L132 encePairwiseOnDemand]: 126/136 looper letters, 75 selfloop transitions, 25 changer transitions 0/205 dead transitions. [2021-12-28 02:49:38,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 205 transitions, 828 flow [2021-12-28 02:49:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 02:49:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 02:49:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1053 transitions. [2021-12-28 02:49:38,712 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8602941176470589 [2021-12-28 02:49:38,712 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1053 transitions. [2021-12-28 02:49:38,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1053 transitions. [2021-12-28 02:49:38,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:38,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1053 transitions. [2021-12-28 02:49:38,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:38,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:38,720 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:38,720 INFO L186 Difference]: Start difference. First operand has 143 places, 132 transitions, 402 flow. Second operand 9 states and 1053 transitions. [2021-12-28 02:49:38,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 205 transitions, 828 flow [2021-12-28 02:49:38,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 205 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-28 02:49:38,858 INFO L242 Difference]: Finished difference. Result has 158 places, 155 transitions, 642 flow [2021-12-28 02:49:38,859 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=642, PETRI_PLACES=158, PETRI_TRANSITIONS=155} [2021-12-28 02:49:38,859 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 15 predicate places. [2021-12-28 02:49:38,860 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 155 transitions, 642 flow [2021-12-28 02:49:38,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:38,860 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:38,860 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] [2021-12-28 02:49:38,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 02:49:38,861 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:38,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:38,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1220493915, now seen corresponding path program 1 times [2021-12-28 02:49:38,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:38,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367963611] [2021-12-28 02:49:38,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:38,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:39,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:39,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367963611] [2021-12-28 02:49:39,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367963611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:39,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:39,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:49:39,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153800021] [2021-12-28 02:49:39,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:39,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:49:39,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:39,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:49:39,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:49:39,049 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2021-12-28 02:49:39,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 155 transitions, 642 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:39,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:39,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2021-12-28 02:49:39,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:42,726 INFO L129 PetriNetUnfolder]: 13252/23665 cut-off events. [2021-12-28 02:49:42,726 INFO L130 PetriNetUnfolder]: For 42935/44852 co-relation queries the response was YES. [2021-12-28 02:49:42,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72731 conditions, 23665 events. 13252/23665 cut-off events. For 42935/44852 co-relation queries the response was YES. Maximal size of possible extension queue 1423. Compared 208939 event pairs, 936 based on Foata normal form. 413/23293 useless extension candidates. Maximal degree in co-relation 72654. Up to 4835 conditions per place. [2021-12-28 02:49:43,015 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 121 selfloop transitions, 36 changer transitions 3/272 dead transitions. [2021-12-28 02:49:43,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 272 transitions, 1522 flow [2021-12-28 02:49:43,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 02:49:43,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-28 02:49:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1559 transitions. [2021-12-28 02:49:43,020 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8817873303167421 [2021-12-28 02:49:43,021 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1559 transitions. [2021-12-28 02:49:43,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1559 transitions. [2021-12-28 02:49:43,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:43,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1559 transitions. [2021-12-28 02:49:43,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.92307692307692) internal successors, (1559), 13 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:43,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:43,030 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:43,031 INFO L186 Difference]: Start difference. First operand has 158 places, 155 transitions, 642 flow. Second operand 13 states and 1559 transitions. [2021-12-28 02:49:43,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 272 transitions, 1522 flow [2021-12-28 02:49:43,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 272 transitions, 1494 flow, removed 14 selfloop flow, removed 0 redundant places. [2021-12-28 02:49:43,443 INFO L242 Difference]: Finished difference. Result has 176 places, 172 transitions, 883 flow [2021-12-28 02:49:43,443 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=883, PETRI_PLACES=176, PETRI_TRANSITIONS=172} [2021-12-28 02:49:43,444 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 33 predicate places. [2021-12-28 02:49:43,445 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 172 transitions, 883 flow [2021-12-28 02:49:43,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:43,445 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:43,445 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] [2021-12-28 02:49:43,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 02:49:43,446 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:43,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash -541134712, now seen corresponding path program 1 times [2021-12-28 02:49:43,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:43,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328529324] [2021-12-28 02:49:43,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:43,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:43,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:43,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:43,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328529324] [2021-12-28 02:49:43,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328529324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:43,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:43,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 02:49:43,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226706149] [2021-12-28 02:49:43,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:43,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 02:49:43,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:43,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 02:49:43,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 02:49:43,602 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2021-12-28 02:49:43,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 172 transitions, 883 flow. Second operand has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:43,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:43,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2021-12-28 02:49:43,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:47,054 INFO L129 PetriNetUnfolder]: 12258/21727 cut-off events. [2021-12-28 02:49:47,054 INFO L130 PetriNetUnfolder]: For 74543/76364 co-relation queries the response was YES. [2021-12-28 02:49:47,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80488 conditions, 21727 events. 12258/21727 cut-off events. For 74543/76364 co-relation queries the response was YES. Maximal size of possible extension queue 1423. Compared 192300 event pairs, 641 based on Foata normal form. 285/21346 useless extension candidates. Maximal degree in co-relation 80402. Up to 4615 conditions per place. [2021-12-28 02:49:47,252 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 116 selfloop transitions, 56 changer transitions 47/317 dead transitions. [2021-12-28 02:49:47,252 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 317 transitions, 2161 flow [2021-12-28 02:49:47,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 02:49:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-12-28 02:49:47,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1922 transitions. [2021-12-28 02:49:47,257 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8832720588235294 [2021-12-28 02:49:47,258 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1922 transitions. [2021-12-28 02:49:47,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1922 transitions. [2021-12-28 02:49:47,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:47,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1922 transitions. [2021-12-28 02:49:47,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 120.125) internal successors, (1922), 16 states have internal predecessors, (1922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:47,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:47,270 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:47,270 INFO L186 Difference]: Start difference. First operand has 176 places, 172 transitions, 883 flow. Second operand 16 states and 1922 transitions. [2021-12-28 02:49:47,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 317 transitions, 2161 flow [2021-12-28 02:49:50,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 317 transitions, 2056 flow, removed 44 selfloop flow, removed 4 redundant places. [2021-12-28 02:49:50,415 INFO L242 Difference]: Finished difference. Result has 191 places, 184 transitions, 1157 flow [2021-12-28 02:49:50,415 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1157, PETRI_PLACES=191, PETRI_TRANSITIONS=184} [2021-12-28 02:49:50,416 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 48 predicate places. [2021-12-28 02:49:50,416 INFO L470 AbstractCegarLoop]: Abstraction has has 191 places, 184 transitions, 1157 flow [2021-12-28 02:49:50,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:50,417 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:50,417 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, 1, 1, 1, 1] [2021-12-28 02:49:50,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 02:49:50,417 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash 995923428, now seen corresponding path program 1 times [2021-12-28 02:49:50,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:50,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477303904] [2021-12-28 02:49:50,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:50,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:50,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:50,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477303904] [2021-12-28 02:49:50,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477303904] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:50,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:50,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 02:49:50,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108147025] [2021-12-28 02:49:50,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:50,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 02:49:50,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:50,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 02:49:50,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 02:49:50,622 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2021-12-28 02:49:50,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 184 transitions, 1157 flow. Second operand has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:50,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:50,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2021-12-28 02:49:50,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:53,891 INFO L129 PetriNetUnfolder]: 12300/21521 cut-off events. [2021-12-28 02:49:53,891 INFO L130 PetriNetUnfolder]: For 75781/77776 co-relation queries the response was YES. [2021-12-28 02:49:54,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79129 conditions, 21521 events. 12300/21521 cut-off events. For 75781/77776 co-relation queries the response was YES. Maximal size of possible extension queue 1424. Compared 188781 event pairs, 801 based on Foata normal form. 136/20924 useless extension candidates. Maximal degree in co-relation 79094. Up to 2657 conditions per place. [2021-12-28 02:49:54,100 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 102 selfloop transitions, 61 changer transitions 41/302 dead transitions. [2021-12-28 02:49:54,101 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 302 transitions, 2186 flow [2021-12-28 02:49:54,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 02:49:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-28 02:49:54,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2234 transitions. [2021-12-28 02:49:54,107 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8645510835913313 [2021-12-28 02:49:54,107 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2234 transitions. [2021-12-28 02:49:54,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2234 transitions. [2021-12-28 02:49:54,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:54,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2234 transitions. [2021-12-28 02:49:54,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 117.57894736842105) internal successors, (2234), 19 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:54,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:54,119 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:54,119 INFO L186 Difference]: Start difference. First operand has 191 places, 184 transitions, 1157 flow. Second operand 19 states and 2234 transitions. [2021-12-28 02:49:54,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 302 transitions, 2186 flow [2021-12-28 02:49:57,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 302 transitions, 1731 flow, removed 169 selfloop flow, removed 19 redundant places. [2021-12-28 02:49:57,146 INFO L242 Difference]: Finished difference. Result has 191 places, 183 transitions, 963 flow [2021-12-28 02:49:57,146 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=963, PETRI_PLACES=191, PETRI_TRANSITIONS=183} [2021-12-28 02:49:57,147 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 48 predicate places. [2021-12-28 02:49:57,147 INFO L470 AbstractCegarLoop]: Abstraction has has 191 places, 183 transitions, 963 flow [2021-12-28 02:49:57,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:57,148 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:57,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:57,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 02:49:57,148 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:57,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1167598721, now seen corresponding path program 1 times [2021-12-28 02:49:57,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:57,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952704547] [2021-12-28 02:49:57,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:57,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:49:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:49:57,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:49:57,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952704547] [2021-12-28 02:49:57,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952704547] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:49:57,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:49:57,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:49:57,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953793394] [2021-12-28 02:49:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:49:57,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:49:57,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:49:57,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:49:57,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:49:57,308 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 136 [2021-12-28 02:49:57,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 183 transitions, 963 flow. Second operand has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:57,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:49:57,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 136 [2021-12-28 02:49:57,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:49:58,465 INFO L129 PetriNetUnfolder]: 3349/10598 cut-off events. [2021-12-28 02:49:58,465 INFO L130 PetriNetUnfolder]: For 24103/25453 co-relation queries the response was YES. [2021-12-28 02:49:58,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33784 conditions, 10598 events. 3349/10598 cut-off events. For 24103/25453 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 134983 event pairs, 85 based on Foata normal form. 3/9875 useless extension candidates. Maximal degree in co-relation 33699. Up to 1100 conditions per place. [2021-12-28 02:49:58,693 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 48 selfloop transitions, 20 changer transitions 5/221 dead transitions. [2021-12-28 02:49:58,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 221 transitions, 1283 flow [2021-12-28 02:49:58,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 02:49:58,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-28 02:49:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 894 transitions. [2021-12-28 02:49:58,695 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8216911764705882 [2021-12-28 02:49:58,695 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 894 transitions. [2021-12-28 02:49:58,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 894 transitions. [2021-12-28 02:49:58,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:49:58,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 894 transitions. [2021-12-28 02:49:58,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:58,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 136.0) internal successors, (1224), 9 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:58,700 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 136.0) internal successors, (1224), 9 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:58,700 INFO L186 Difference]: Start difference. First operand has 191 places, 183 transitions, 963 flow. Second operand 8 states and 894 transitions. [2021-12-28 02:49:58,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 221 transitions, 1283 flow [2021-12-28 02:49:59,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 221 transitions, 1123 flow, removed 34 selfloop flow, removed 17 redundant places. [2021-12-28 02:49:59,697 INFO L242 Difference]: Finished difference. Result has 184 places, 197 transitions, 1005 flow [2021-12-28 02:49:59,698 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1005, PETRI_PLACES=184, PETRI_TRANSITIONS=197} [2021-12-28 02:49:59,698 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 41 predicate places. [2021-12-28 02:49:59,699 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 197 transitions, 1005 flow [2021-12-28 02:49:59,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:49:59,699 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:49:59,699 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:49:59,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 02:49:59,700 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:49:59,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:49:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash -821569325, now seen corresponding path program 2 times [2021-12-28 02:49:59,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:49:59,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237901376] [2021-12-28 02:49:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:49:59,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:49:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:00,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:00,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237901376] [2021-12-28 02:50:00,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237901376] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:00,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:00,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 02:50:00,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980434324] [2021-12-28 02:50:00,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:00,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 02:50:00,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:00,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 02:50:00,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-28 02:50:00,057 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 136 [2021-12-28 02:50:00,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 197 transitions, 1005 flow. Second operand has 13 states, 13 states have (on average 98.6923076923077) internal successors, (1283), 13 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:00,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:00,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 136 [2021-12-28 02:50:00,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:01,723 INFO L129 PetriNetUnfolder]: 4049/12998 cut-off events. [2021-12-28 02:50:01,723 INFO L130 PetriNetUnfolder]: For 21054/21449 co-relation queries the response was YES. [2021-12-28 02:50:01,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37238 conditions, 12998 events. 4049/12998 cut-off events. For 21054/21449 co-relation queries the response was YES. Maximal size of possible extension queue 1626. Compared 173752 event pairs, 156 based on Foata normal form. 7/12257 useless extension candidates. Maximal degree in co-relation 37208. Up to 1396 conditions per place. [2021-12-28 02:50:01,955 INFO L132 encePairwiseOnDemand]: 120/136 looper letters, 73 selfloop transitions, 40 changer transitions 5/259 dead transitions. [2021-12-28 02:50:01,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 259 transitions, 1572 flow [2021-12-28 02:50:01,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 02:50:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-28 02:50:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1335 transitions. [2021-12-28 02:50:01,959 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7550904977375565 [2021-12-28 02:50:01,959 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1335 transitions. [2021-12-28 02:50:01,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1335 transitions. [2021-12-28 02:50:01,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:01,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1335 transitions. [2021-12-28 02:50:01,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.6923076923077) internal successors, (1335), 13 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:01,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:01,965 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:01,965 INFO L186 Difference]: Start difference. First operand has 184 places, 197 transitions, 1005 flow. Second operand 13 states and 1335 transitions. [2021-12-28 02:50:01,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 259 transitions, 1572 flow [2021-12-28 02:50:03,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 259 transitions, 1562 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-12-28 02:50:03,535 INFO L242 Difference]: Finished difference. Result has 196 places, 216 transitions, 1266 flow [2021-12-28 02:50:03,535 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1266, PETRI_PLACES=196, PETRI_TRANSITIONS=216} [2021-12-28 02:50:03,536 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 53 predicate places. [2021-12-28 02:50:03,536 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 216 transitions, 1266 flow [2021-12-28 02:50:03,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 98.6923076923077) internal successors, (1283), 13 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:03,537 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:03,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:03,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 02:50:03,538 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:50:03,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:03,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1214126211, now seen corresponding path program 3 times [2021-12-28 02:50:03,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:03,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928875640] [2021-12-28 02:50:03,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:03,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 02:50:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 02:50:03,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 02:50:03,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928875640] [2021-12-28 02:50:03,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928875640] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 02:50:03,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 02:50:03,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 02:50:03,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331747508] [2021-12-28 02:50:03,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 02:50:03,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 02:50:03,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 02:50:03,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 02:50:03,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 02:50:03,710 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2021-12-28 02:50:03,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 216 transitions, 1266 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:03,712 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 02:50:03,712 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2021-12-28 02:50:03,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 02:50:06,140 INFO L129 PetriNetUnfolder]: 6415/20414 cut-off events. [2021-12-28 02:50:06,141 INFO L130 PetriNetUnfolder]: For 35242/36042 co-relation queries the response was YES. [2021-12-28 02:50:06,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59157 conditions, 20414 events. 6415/20414 cut-off events. For 35242/36042 co-relation queries the response was YES. Maximal size of possible extension queue 2551. Compared 291542 event pairs, 165 based on Foata normal form. 77/19274 useless extension candidates. Maximal degree in co-relation 59123. Up to 2014 conditions per place. [2021-12-28 02:50:06,532 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 47 selfloop transitions, 4 changer transitions 24/252 dead transitions. [2021-12-28 02:50:06,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 252 transitions, 1651 flow [2021-12-28 02:50:06,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 02:50:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-28 02:50:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 811 transitions. [2021-12-28 02:50:06,535 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.851890756302521 [2021-12-28 02:50:06,535 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 811 transitions. [2021-12-28 02:50:06,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 811 transitions. [2021-12-28 02:50:06,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 02:50:06,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 811 transitions. [2021-12-28 02:50:06,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:06,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:06,540 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:06,540 INFO L186 Difference]: Start difference. First operand has 196 places, 216 transitions, 1266 flow. Second operand 7 states and 811 transitions. [2021-12-28 02:50:06,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 252 transitions, 1651 flow [2021-12-28 02:50:10,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 252 transitions, 1613 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-12-28 02:50:10,640 INFO L242 Difference]: Finished difference. Result has 197 places, 209 transitions, 1186 flow [2021-12-28 02:50:10,641 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1186, PETRI_PLACES=197, PETRI_TRANSITIONS=209} [2021-12-28 02:50:10,641 INFO L334 CegarLoopForPetriNet]: 143 programPoint places, 54 predicate places. [2021-12-28 02:50:10,641 INFO L470 AbstractCegarLoop]: Abstraction has has 197 places, 209 transitions, 1186 flow [2021-12-28 02:50:10,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 02:50:10,642 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 02:50:10,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:10,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 02:50:10,643 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-12-28 02:50:10,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 02:50:10,643 INFO L85 PathProgramCache]: Analyzing trace with hash 174363065, now seen corresponding path program 4 times [2021-12-28 02:50:10,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 02:50:10,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915267548] [2021-12-28 02:50:10,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 02:50:10,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 02:50:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:50:10,702 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 02:50:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 02:50:10,819 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 02:50:10,819 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 02:50:10,820 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-12-28 02:50:10,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-12-28 02:50:10,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-12-28 02:50:10,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-12-28 02:50:10,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-12-28 02:50:10,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-12-28 02:50:10,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-12-28 02:50:10,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 02:50:10,827 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 02:50:10,832 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-28 02:50:10,832 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 02:50:11,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:50:11 BasicIcfg [2021-12-28 02:50:11,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 02:50:11,021 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 02:50:11,021 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 02:50:11,021 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 02:50:11,021 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:49:31" (3/4) ... [2021-12-28 02:50:11,023 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 02:50:11,194 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 02:50:11,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 02:50:11,196 INFO L158 Benchmark]: Toolchain (without parser) took 41624.98ms. Allocated memory was 48.2MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 32.5MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 4.7GB. Max. memory is 16.1GB. [2021-12-28 02:50:11,196 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 30.2MB in the beginning and 30.2MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 02:50:11,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.03ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 32.4MB in the beginning and 28.6MB in the end (delta: 3.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 02:50:11,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.79ms. Allocated memory is still 58.7MB. Free memory was 28.4MB in the beginning and 39.7MB in the end (delta: -11.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2021-12-28 02:50:11,197 INFO L158 Benchmark]: Boogie Preprocessor took 61.17ms. Allocated memory is still 58.7MB. Free memory was 39.5MB in the beginning and 37.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 02:50:11,197 INFO L158 Benchmark]: RCFGBuilder took 1240.74ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.1MB in the beginning and 43.6MB in the end (delta: -6.5MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2021-12-28 02:50:11,197 INFO L158 Benchmark]: TraceAbstraction took 39513.57ms. Allocated memory was 71.3MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 43.1MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 4.6GB. Max. memory is 16.1GB. [2021-12-28 02:50:11,197 INFO L158 Benchmark]: Witness Printer took 174.27ms. Allocated memory is still 7.1GB. Free memory was 2.5GB in the beginning and 2.4GB in the end (delta: 53.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2021-12-28 02:50:11,200 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.20ms. Allocated memory is still 48.2MB. Free memory was 30.2MB in the beginning and 30.2MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.03ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 32.4MB in the beginning and 28.6MB in the end (delta: 3.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.79ms. Allocated memory is still 58.7MB. Free memory was 28.4MB in the beginning and 39.7MB in the end (delta: -11.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.17ms. Allocated memory is still 58.7MB. Free memory was 39.5MB in the beginning and 37.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1240.74ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.1MB in the beginning and 43.6MB in the end (delta: -6.5MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 39513.57ms. Allocated memory was 71.3MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 43.1MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 4.6GB. Max. memory is 16.1GB. * Witness Printer took 174.27ms. Allocated memory is still 7.1GB. Free memory was 2.5GB in the beginning and 2.4GB in the end (delta: 53.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L719] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0] [L720] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L721] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L722] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L723] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L724] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L725] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0] [L726] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0] [L727] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L728] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L729] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L730] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0] [L731] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0] [L732] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L733] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L734] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L735] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L736] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L737] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L738] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L740] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1353; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1353, ((void *)0), P0, ((void *)0))=-3, t1353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1354; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1354, ((void *)0), P1, ((void *)0))=-2, t1353={5:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1355; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1355, ((void *)0), P2, ((void *)0))=-1, t1353={5:0}, t1354={6:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1356; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1356, ((void *)0), P3, ((void *)0))=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=0, z=0] [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L786] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=0, weak$$choice2=0, x=2, y=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L828] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L829] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L830] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L830] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L831] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L832] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L833] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=49, weak$$choice2=0, x=2, y=1, z=1] [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L806] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=49, weak$$choice2=0, x=2, y=1, z=1] [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=49, weak$$choice2=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=49, weak$$choice2=0, x=2, y=1, z=1] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=49, weak$$choice2=0, x=2, y=1, z=1] [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=49, weak$$choice2=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=49, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 868]: 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: 862]: 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: 866]: 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: 864]: 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 9 procedures, 172 locations, 7 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: 39.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 36.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 918 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 918 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1289 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1715 IncrementalHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 113 mSDtfsCounter, 1715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1266occurred in iteration=9, InterpolantAutomatonStates: 107, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1016 NumberOfCodeBlocks, 1016 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 901 ConstructedInterpolants, 0 QuantifiedInterpolants, 3469 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! [2021-12-28 02:50:11,253 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE