./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.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 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:13:24,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:13:24,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:13:24,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:13:24,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:13:24,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:13:24,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:13:24,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:13:24,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:13:24,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:13:24,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:13:24,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:13:24,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:13:24,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:13:24,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:13:25,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:13:25,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:13:25,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:13:25,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:13:25,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:13:25,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:13:25,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:13:25,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:13:25,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:13:25,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:13:25,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:13:25,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:13:25,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:13:25,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:13:25,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:13:25,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:13:25,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:13:25,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:13:25,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:13:25,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:13:25,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:13:25,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:13:25,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:13:25,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:13:25,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:13:25,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:13:25,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:13:25,054 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:13:25,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:13:25,055 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:13:25,055 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:13:25,056 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:13:25,056 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:13:25,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:13:25,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:13:25,057 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:13:25,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:13:25,057 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:13:25,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:13:25,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:13:25,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:13:25,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:13:25,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:13:25,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:13:25,059 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:13:25,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:13:25,059 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:13:25,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:13:25,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:13:25,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:13:25,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:13:25,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:13:25,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:13:25,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:13:25,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:13:25,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:13:25,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:13:25,061 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:13:25,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:13:25,061 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:13:25,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:13:25,061 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:13:25,061 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 23:13:25,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:13:25,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:13:25,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:13:25,325 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:13:25,325 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:13:25,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2023-08-30 23:13:26,310 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:13:26,536 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:13:26,536 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2023-08-30 23:13:26,562 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19492cdaa/2ce9ac23d47f4aa18e38f96b51d0242e/FLAGc7b8b95fa [2023-08-30 23:13:26,571 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19492cdaa/2ce9ac23d47f4aa18e38f96b51d0242e [2023-08-30 23:13:26,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:13:26,573 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:13:26,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:13:26,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:13:26,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:13:26,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:13:26" (1/1) ... [2023-08-30 23:13:26,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af63f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26, skipping insertion in model container [2023-08-30 23:13:26,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:13:26" (1/1) ... [2023-08-30 23:13:26,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:13:26,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:13:26,718 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038.opt.i[944,957] [2023-08-30 23:13:26,883 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:13:26,892 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:13:26,900 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038.opt.i[944,957] [2023-08-30 23:13:26,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:13:26,990 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:13:26,990 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:13:26,995 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:13:26,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26 WrapperNode [2023-08-30 23:13:26,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:13:27,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:13:27,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:13:27,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:13:27,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26" (1/1) ... [2023-08-30 23:13:27,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26" (1/1) ... [2023-08-30 23:13:27,058 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2023-08-30 23:13:27,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:13:27,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:13:27,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:13:27,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:13:27,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26" (1/1) ... [2023-08-30 23:13:27,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26" (1/1) ... [2023-08-30 23:13:27,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26" (1/1) ... [2023-08-30 23:13:27,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26" (1/1) ... [2023-08-30 23:13:27,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26" (1/1) ... [2023-08-30 23:13:27,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26" (1/1) ... [2023-08-30 23:13:27,096 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26" (1/1) ... [2023-08-30 23:13:27,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26" (1/1) ... [2023-08-30 23:13:27,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:13:27,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:13:27,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:13:27,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:13:27,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26" (1/1) ... [2023-08-30 23:13:27,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:13:27,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:13:27,131 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) [2023-08-30 23:13:27,156 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 [2023-08-30 23:13:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:13:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:13:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:13:27,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:13:27,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:13:27,163 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:13:27,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:13:27,163 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:13:27,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:13:27,163 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:13:27,164 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:13:27,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:13:27,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:13:27,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:13:27,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:13:27,165 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:13:27,283 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:13:27,284 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:13:27,483 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:13:27,624 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:13:27,624 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:13:27,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:13:27 BoogieIcfgContainer [2023-08-30 23:13:27,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:13:27,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:13:27,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:13:27,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:13:27,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:13:26" (1/3) ... [2023-08-30 23:13:27,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1efa84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:13:27, skipping insertion in model container [2023-08-30 23:13:27,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:13:26" (2/3) ... [2023-08-30 23:13:27,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1efa84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:13:27, skipping insertion in model container [2023-08-30 23:13:27,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:13:27" (3/3) ... [2023-08-30 23:13:27,631 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2023-08-30 23:13:27,636 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:13:27,641 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:13:27,641 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:13:27,641 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:13:27,693 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:13:27,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2023-08-30 23:13:27,775 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2023-08-30 23:13:27,775 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:13:27,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 23:13:27,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2023-08-30 23:13:27,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2023-08-30 23:13:27,786 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:13:27,796 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2023-08-30 23:13:27,798 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2023-08-30 23:13:27,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2023-08-30 23:13:27,817 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2023-08-30 23:13:27,817 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:13:27,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-08-30 23:13:27,819 INFO L119 LiptonReduction]: Number of co-enabled transitions 1840 [2023-08-30 23:13:30,659 INFO L134 LiptonReduction]: Checked pairs total: 4417 [2023-08-30 23:13:30,659 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-30 23:13:30,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:13:30,673 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7e7c2197, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:13:30,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 23:13:30,677 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2023-08-30 23:13:30,677 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:13:30,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:30,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:30,677 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:13:30,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:30,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1466018698, now seen corresponding path program 1 times [2023-08-30 23:13:30,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:30,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250719722] [2023-08-30 23:13:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:30,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:30,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:30,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250719722] [2023-08-30 23:13:30,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250719722] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:30,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:30,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:13:30,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110976744] [2023-08-30 23:13:30,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:31,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:13:31,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:31,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:13:31,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:13:31,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 204 [2023-08-30 23:13:31,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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) [2023-08-30 23:13:31,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:31,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 204 [2023-08-30 23:13:31,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:31,185 INFO L130 PetriNetUnfolder]: 615/1080 cut-off events. [2023-08-30 23:13:31,186 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2023-08-30 23:13:31,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2051 conditions, 1080 events. 615/1080 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5565 event pairs, 129 based on Foata normal form. 0/1031 useless extension candidates. Maximal degree in co-relation 2040. Up to 703 conditions per place. [2023-08-30 23:13:31,195 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 25 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2023-08-30 23:13:31,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 131 flow [2023-08-30 23:13:31,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:13:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:13:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-08-30 23:13:31,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5326797385620915 [2023-08-30 23:13:31,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-08-30 23:13:31,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-08-30 23:13:31,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:31,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-08-30 23:13:31,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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) [2023-08-30 23:13:31,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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) [2023-08-30 23:13:31,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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) [2023-08-30 23:13:31,228 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 326 transitions. [2023-08-30 23:13:31,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 131 flow [2023-08-30 23:13:31,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 23:13:31,234 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-08-30 23:13:31,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-30 23:13:31,238 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-08-30 23:13:31,238 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-08-30 23:13:31,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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) [2023-08-30 23:13:31,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:31,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:31,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:13:31,242 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:13:31,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:31,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1360677354, now seen corresponding path program 1 times [2023-08-30 23:13:31,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:31,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070249987] [2023-08-30 23:13:31,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:31,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:31,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:31,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070249987] [2023-08-30 23:13:31,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070249987] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:31,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:31,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:13:31,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114697550] [2023-08-30 23:13:31,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:31,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:13:31,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:31,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:13:31,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:13:31,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 204 [2023-08-30 23:13:31,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 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) [2023-08-30 23:13:31,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:31,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 204 [2023-08-30 23:13:31,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:31,734 INFO L130 PetriNetUnfolder]: 1637/2514 cut-off events. [2023-08-30 23:13:31,735 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2023-08-30 23:13:31,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5210 conditions, 2514 events. 1637/2514 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12139 event pairs, 509 based on Foata normal form. 140/2654 useless extension candidates. Maximal degree in co-relation 5200. Up to 1523 conditions per place. [2023-08-30 23:13:31,743 INFO L137 encePairwiseOnDemand]: 196/204 looper letters, 31 selfloop transitions, 6 changer transitions 23/60 dead transitions. [2023-08-30 23:13:31,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 60 transitions, 258 flow [2023-08-30 23:13:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:13:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:13:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-08-30 23:13:31,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5019607843137255 [2023-08-30 23:13:31,746 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-08-30 23:13:31,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-08-30 23:13:31,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:31,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-08-30 23:13:31,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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) [2023-08-30 23:13:31,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 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) [2023-08-30 23:13:31,751 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 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) [2023-08-30 23:13:31,751 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 5 states and 512 transitions. [2023-08-30 23:13:31,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 60 transitions, 258 flow [2023-08-30 23:13:31,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 60 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:13:31,754 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 108 flow [2023-08-30 23:13:31,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-30 23:13:31,755 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-08-30 23:13:31,755 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 108 flow [2023-08-30 23:13:31,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 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) [2023-08-30 23:13:31,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:31,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:31,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:13:31,756 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:13:31,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:31,758 INFO L85 PathProgramCache]: Analyzing trace with hash -768695640, now seen corresponding path program 1 times [2023-08-30 23:13:31,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:31,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729694267] [2023-08-30 23:13:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:31,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:31,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:31,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729694267] [2023-08-30 23:13:31,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729694267] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:31,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:31,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:13:31,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485426854] [2023-08-30 23:13:31,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:31,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:13:31,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:31,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:13:31,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:13:31,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 204 [2023-08-30 23:13:31,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 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) [2023-08-30 23:13:31,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:31,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 204 [2023-08-30 23:13:31,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:32,128 INFO L130 PetriNetUnfolder]: 1131/1825 cut-off events. [2023-08-30 23:13:32,128 INFO L131 PetriNetUnfolder]: For 1387/1404 co-relation queries the response was YES. [2023-08-30 23:13:32,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4994 conditions, 1825 events. 1131/1825 cut-off events. For 1387/1404 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9070 event pairs, 373 based on Foata normal form. 106/1917 useless extension candidates. Maximal degree in co-relation 4980. Up to 1083 conditions per place. [2023-08-30 23:13:32,136 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 27 selfloop transitions, 3 changer transitions 16/50 dead transitions. [2023-08-30 23:13:32,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 50 transitions, 286 flow [2023-08-30 23:13:32,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:13:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:13:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2023-08-30 23:13:32,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107843137254902 [2023-08-30 23:13:32,138 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 521 transitions. [2023-08-30 23:13:32,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 521 transitions. [2023-08-30 23:13:32,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:32,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 521 transitions. [2023-08-30 23:13:32,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 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) [2023-08-30 23:13:32,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 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) [2023-08-30 23:13:32,141 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 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) [2023-08-30 23:13:32,141 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 108 flow. Second operand 5 states and 521 transitions. [2023-08-30 23:13:32,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 50 transitions, 286 flow [2023-08-30 23:13:32,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 50 transitions, 262 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 23:13:32,147 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 109 flow [2023-08-30 23:13:32,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-30 23:13:32,148 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-08-30 23:13:32,151 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 109 flow [2023-08-30 23:13:32,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 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) [2023-08-30 23:13:32,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:32,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:32,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:13:32,151 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:13:32,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:32,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1584886610, now seen corresponding path program 1 times [2023-08-30 23:13:32,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:32,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558673316] [2023-08-30 23:13:32,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:32,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:32,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:32,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558673316] [2023-08-30 23:13:32,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558673316] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:32,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:32,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:13:32,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575173191] [2023-08-30 23:13:32,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:32,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:13:32,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:32,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:13:32,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:13:32,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 204 [2023-08-30 23:13:32,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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) [2023-08-30 23:13:32,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:32,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 204 [2023-08-30 23:13:32,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:32,585 INFO L130 PetriNetUnfolder]: 1300/2027 cut-off events. [2023-08-30 23:13:32,585 INFO L131 PetriNetUnfolder]: For 1606/1606 co-relation queries the response was YES. [2023-08-30 23:13:32,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5617 conditions, 2027 events. 1300/2027 cut-off events. For 1606/1606 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9549 event pairs, 285 based on Foata normal form. 94/2121 useless extension candidates. Maximal degree in co-relation 5600. Up to 1227 conditions per place. [2023-08-30 23:13:32,592 INFO L137 encePairwiseOnDemand]: 196/204 looper letters, 41 selfloop transitions, 10 changer transitions 23/74 dead transitions. [2023-08-30 23:13:32,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 74 transitions, 416 flow [2023-08-30 23:13:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:13:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:13:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 705 transitions. [2023-08-30 23:13:32,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49369747899159666 [2023-08-30 23:13:32,597 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 705 transitions. [2023-08-30 23:13:32,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 705 transitions. [2023-08-30 23:13:32,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:32,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 705 transitions. [2023-08-30 23:13:32,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 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) [2023-08-30 23:13:32,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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) [2023-08-30 23:13:32,601 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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) [2023-08-30 23:13:32,601 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 109 flow. Second operand 7 states and 705 transitions. [2023-08-30 23:13:32,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 74 transitions, 416 flow [2023-08-30 23:13:32,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 74 transitions, 398 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-30 23:13:32,606 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 162 flow [2023-08-30 23:13:32,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-30 23:13:32,607 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2023-08-30 23:13:32,607 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 162 flow [2023-08-30 23:13:32,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 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) [2023-08-30 23:13:32,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:32,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:32,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:13:32,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:13:32,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:32,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1888150180, now seen corresponding path program 1 times [2023-08-30 23:13:32,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:32,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320623448] [2023-08-30 23:13:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:32,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:32,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320623448] [2023-08-30 23:13:32,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320623448] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:32,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:32,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:13:32,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800989782] [2023-08-30 23:13:32,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:32,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:13:32,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:32,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:13:32,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:13:32,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 204 [2023-08-30 23:13:32,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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) [2023-08-30 23:13:32,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:32,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 204 [2023-08-30 23:13:32,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:32,931 INFO L130 PetriNetUnfolder]: 697/1184 cut-off events. [2023-08-30 23:13:32,932 INFO L131 PetriNetUnfolder]: For 1478/1524 co-relation queries the response was YES. [2023-08-30 23:13:32,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3546 conditions, 1184 events. 697/1184 cut-off events. For 1478/1524 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6028 event pairs, 152 based on Foata normal form. 115/1265 useless extension candidates. Maximal degree in co-relation 3527. Up to 738 conditions per place. [2023-08-30 23:13:32,936 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 42 selfloop transitions, 7 changer transitions 12/69 dead transitions. [2023-08-30 23:13:32,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 69 transitions, 458 flow [2023-08-30 23:13:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:13:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:13:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-08-30 23:13:32,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5088235294117647 [2023-08-30 23:13:32,939 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-08-30 23:13:32,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-08-30 23:13:32,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:32,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-08-30 23:13:32,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 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) [2023-08-30 23:13:32,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 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) [2023-08-30 23:13:32,943 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 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) [2023-08-30 23:13:32,943 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 162 flow. Second operand 5 states and 519 transitions. [2023-08-30 23:13:32,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 69 transitions, 458 flow [2023-08-30 23:13:32,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 69 transitions, 444 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-30 23:13:32,946 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 208 flow [2023-08-30 23:13:32,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-08-30 23:13:32,947 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2023-08-30 23:13:32,947 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 208 flow [2023-08-30 23:13:32,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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) [2023-08-30 23:13:32,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:32,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:32,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:13:32,948 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:13:32,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:32,948 INFO L85 PathProgramCache]: Analyzing trace with hash -319697471, now seen corresponding path program 1 times [2023-08-30 23:13:32,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:32,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689627624] [2023-08-30 23:13:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:32,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:33,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:33,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689627624] [2023-08-30 23:13:33,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689627624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:33,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:33,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:13:33,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797790136] [2023-08-30 23:13:33,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:33,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:13:33,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:33,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:13:33,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:13:33,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 204 [2023-08-30 23:13:33,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 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) [2023-08-30 23:13:33,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:33,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 204 [2023-08-30 23:13:33,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:33,245 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L809-->L816: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_81 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_14 256) 0)))) (let ((.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_71 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_82 256) 0)) .cse5)) (.cse4 (and .cse0 .cse5))) (and (= v_~y$r_buff1_thd3~0_13 (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_70 256) 0)) .cse1)) 0 v_~y$r_buff1_thd3~0_14)) (= (ite .cse2 v_~y$w_buff0~0_33 (ite .cse3 v_~y$w_buff1~0_26 v_~y~0_57)) v_~y~0_56) (= v_~y$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_71)) (= v_~y$w_buff0_used~0_81 (ite .cse2 0 v_~y$w_buff0_used~0_82)) (= (ite .cse4 0 v_~y$r_buff0_thd3~0_19) v_~y$r_buff0_thd3~0_18)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_57, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_81, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_70} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][46], [111#L816true, Black: 130#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 161#true, Black: 127#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 164#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 163#(= ~__unbuffered_cnt~0 0), 71#P0EXITtrue, 105#L849true, 173#(= ~x~0 1), 146#true, Black: 138#(= ~__unbuffered_p2_EAX~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 46#L779true, Black: 148#(= ~x~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))]) [2023-08-30 23:13:33,246 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2023-08-30 23:13:33,246 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 23:13:33,246 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 23:13:33,246 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-08-30 23:13:33,262 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L849-->L18: Formula: (and (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EAX~0_22 0) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_6 1) (= v_~x~0_11 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_10 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_6, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_17|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_6, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [Black: 130#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 161#true, 83#L18true, 59#L809true, Black: 127#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 164#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 163#(= ~__unbuffered_cnt~0 0), 71#P0EXITtrue, 146#true, Black: 138#(= ~__unbuffered_p2_EAX~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 46#L779true, 176#(and (= ~x~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 148#(= ~x~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))]) [2023-08-30 23:13:33,262 INFO L383 tUnfolder$Statistics]: this new event has 17 ancestors and is not cut-off event [2023-08-30 23:13:33,262 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-30 23:13:33,262 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-30 23:13:33,262 INFO L386 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-08-30 23:13:33,263 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L809-->L816: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_81 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_14 256) 0)))) (let ((.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_71 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_82 256) 0)) .cse5)) (.cse4 (and .cse0 .cse5))) (and (= v_~y$r_buff1_thd3~0_13 (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_70 256) 0)) .cse1)) 0 v_~y$r_buff1_thd3~0_14)) (= (ite .cse2 v_~y$w_buff0~0_33 (ite .cse3 v_~y$w_buff1~0_26 v_~y~0_57)) v_~y~0_56) (= v_~y$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_71)) (= v_~y$w_buff0_used~0_81 (ite .cse2 0 v_~y$w_buff0_used~0_82)) (= (ite .cse4 0 v_~y$r_buff0_thd3~0_19) v_~y$r_buff0_thd3~0_18)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_57, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_81, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_33, ~y~0=v_~y~0_56, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_70} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][46], [111#L816true, Black: 130#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 161#true, Black: 127#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 164#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 163#(= ~__unbuffered_cnt~0 0), 71#P0EXITtrue, 105#L849true, 173#(= ~x~0 1), 146#true, Black: 138#(= ~__unbuffered_p2_EAX~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 35#P1EXITtrue, Black: 148#(= ~x~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))]) [2023-08-30 23:13:33,263 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 23:13:33,264 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 23:13:33,264 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 23:13:33,264 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 23:13:33,272 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L849-->L18: Formula: (and (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EAX~0_22 0) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_6 1) (= v_~x~0_11 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_10 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_6, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_17|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_6, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [Black: 130#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 161#true, 83#L18true, 59#L809true, Black: 127#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1))), Black: 164#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 163#(= ~__unbuffered_cnt~0 0), 71#P0EXITtrue, 146#true, Black: 138#(= ~__unbuffered_p2_EAX~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 35#P1EXITtrue, 176#(and (= ~x~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 148#(= ~x~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)))]) [2023-08-30 23:13:33,273 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2023-08-30 23:13:33,273 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-30 23:13:33,273 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-30 23:13:33,273 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-30 23:13:33,281 INFO L130 PetriNetUnfolder]: 907/1596 cut-off events. [2023-08-30 23:13:33,281 INFO L131 PetriNetUnfolder]: For 2321/2329 co-relation queries the response was YES. [2023-08-30 23:13:33,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5821 conditions, 1596 events. 907/1596 cut-off events. For 2321/2329 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8756 event pairs, 373 based on Foata normal form. 38/1564 useless extension candidates. Maximal degree in co-relation 5800. Up to 713 conditions per place. [2023-08-30 23:13:33,287 INFO L137 encePairwiseOnDemand]: 200/204 looper letters, 38 selfloop transitions, 5 changer transitions 19/67 dead transitions. [2023-08-30 23:13:33,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 487 flow [2023-08-30 23:13:33,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:13:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:13:33,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2023-08-30 23:13:33,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117647058823529 [2023-08-30 23:13:33,297 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2023-08-30 23:13:33,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2023-08-30 23:13:33,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:33,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2023-08-30 23:13:33,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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) [2023-08-30 23:13:33,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 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) [2023-08-30 23:13:33,301 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 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) [2023-08-30 23:13:33,301 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 208 flow. Second operand 5 states and 522 transitions. [2023-08-30 23:13:33,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 487 flow [2023-08-30 23:13:33,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:13:33,306 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 213 flow [2023-08-30 23:13:33,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2023-08-30 23:13:33,308 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2023-08-30 23:13:33,308 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 213 flow [2023-08-30 23:13:33,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 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) [2023-08-30 23:13:33,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:33,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:33,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:13:33,309 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:13:33,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:33,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1848432698, now seen corresponding path program 1 times [2023-08-30 23:13:33,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:33,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727010714] [2023-08-30 23:13:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:33,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:33,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:33,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727010714] [2023-08-30 23:13:33,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727010714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:33,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:33,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:13:33,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999367740] [2023-08-30 23:13:33,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:33,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:13:33,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:33,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:13:33,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:13:33,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 204 [2023-08-30 23:13:33,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 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) [2023-08-30 23:13:33,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:33,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 204 [2023-08-30 23:13:33,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:33,644 INFO L130 PetriNetUnfolder]: 467/873 cut-off events. [2023-08-30 23:13:33,644 INFO L131 PetriNetUnfolder]: For 1402/1460 co-relation queries the response was YES. [2023-08-30 23:13:33,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3174 conditions, 873 events. 467/873 cut-off events. For 1402/1460 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4591 event pairs, 70 based on Foata normal form. 116/977 useless extension candidates. Maximal degree in co-relation 3150. Up to 336 conditions per place. [2023-08-30 23:13:33,647 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 44 selfloop transitions, 9 changer transitions 28/89 dead transitions. [2023-08-30 23:13:33,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 89 transitions, 685 flow [2023-08-30 23:13:33,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:13:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:13:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 723 transitions. [2023-08-30 23:13:33,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063025210084033 [2023-08-30 23:13:33,649 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 723 transitions. [2023-08-30 23:13:33,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 723 transitions. [2023-08-30 23:13:33,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:33,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 723 transitions. [2023-08-30 23:13:33,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 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) [2023-08-30 23:13:33,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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) [2023-08-30 23:13:33,653 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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) [2023-08-30 23:13:33,653 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 213 flow. Second operand 7 states and 723 transitions. [2023-08-30 23:13:33,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 89 transitions, 685 flow [2023-08-30 23:13:33,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 89 transitions, 652 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-30 23:13:33,657 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 259 flow [2023-08-30 23:13:33,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-30 23:13:33,657 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2023-08-30 23:13:33,657 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 259 flow [2023-08-30 23:13:33,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 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) [2023-08-30 23:13:33,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:33,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:33,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:13:33,658 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:13:33,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:33,658 INFO L85 PathProgramCache]: Analyzing trace with hash 47243411, now seen corresponding path program 1 times [2023-08-30 23:13:33,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:33,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271331450] [2023-08-30 23:13:33,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:33,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:33,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:33,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271331450] [2023-08-30 23:13:33,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271331450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:33,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:33,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:13:33,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106902008] [2023-08-30 23:13:33,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:33,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:13:33,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:33,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:13:33,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:13:33,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 204 [2023-08-30 23:13:33,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 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) [2023-08-30 23:13:33,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:33,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 204 [2023-08-30 23:13:33,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:33,956 INFO L130 PetriNetUnfolder]: 332/643 cut-off events. [2023-08-30 23:13:33,956 INFO L131 PetriNetUnfolder]: For 1381/1449 co-relation queries the response was YES. [2023-08-30 23:13:33,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2565 conditions, 643 events. 332/643 cut-off events. For 1381/1449 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3288 event pairs, 56 based on Foata normal form. 65/700 useless extension candidates. Maximal degree in co-relation 2540. Up to 236 conditions per place. [2023-08-30 23:13:33,958 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 37 selfloop transitions, 12 changer transitions 25/81 dead transitions. [2023-08-30 23:13:33,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 638 flow [2023-08-30 23:13:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 23:13:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 23:13:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 909 transitions. [2023-08-30 23:13:33,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950980392156863 [2023-08-30 23:13:33,960 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 909 transitions. [2023-08-30 23:13:33,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 909 transitions. [2023-08-30 23:13:33,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:33,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 909 transitions. [2023-08-30 23:13:33,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.0) internal successors, (909), 9 states have internal predecessors, (909), 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) [2023-08-30 23:13:33,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 204.0) internal successors, (2040), 10 states have internal predecessors, (2040), 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) [2023-08-30 23:13:33,965 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 204.0) internal successors, (2040), 10 states have internal predecessors, (2040), 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) [2023-08-30 23:13:33,965 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 259 flow. Second operand 9 states and 909 transitions. [2023-08-30 23:13:33,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 638 flow [2023-08-30 23:13:33,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 594 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-30 23:13:33,969 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 232 flow [2023-08-30 23:13:33,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2023-08-30 23:13:33,970 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places. [2023-08-30 23:13:33,970 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 232 flow [2023-08-30 23:13:33,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 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) [2023-08-30 23:13:33,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:33,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:33,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:13:33,971 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:13:33,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:33,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1370885384, now seen corresponding path program 1 times [2023-08-30 23:13:33,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:33,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608967408] [2023-08-30 23:13:33,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:33,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:34,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608967408] [2023-08-30 23:13:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608967408] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:34,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:34,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:13:34,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051549349] [2023-08-30 23:13:34,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:34,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:13:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:34,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:13:34,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:13:34,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 204 [2023-08-30 23:13:34,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 34 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 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) [2023-08-30 23:13:34,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:34,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 204 [2023-08-30 23:13:34,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:34,463 INFO L130 PetriNetUnfolder]: 284/530 cut-off events. [2023-08-30 23:13:34,464 INFO L131 PetriNetUnfolder]: For 1449/1449 co-relation queries the response was YES. [2023-08-30 23:13:34,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 530 events. 284/530 cut-off events. For 1449/1449 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2309 event pairs, 12 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 2247. Up to 207 conditions per place. [2023-08-30 23:13:34,466 INFO L137 encePairwiseOnDemand]: 193/204 looper letters, 44 selfloop transitions, 23 changer transitions 27/94 dead transitions. [2023-08-30 23:13:34,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 826 flow [2023-08-30 23:13:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 23:13:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 23:13:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 841 transitions. [2023-08-30 23:13:34,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45806100217864926 [2023-08-30 23:13:34,468 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 841 transitions. [2023-08-30 23:13:34,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 841 transitions. [2023-08-30 23:13:34,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:34,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 841 transitions. [2023-08-30 23:13:34,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.44444444444444) internal successors, (841), 9 states have internal predecessors, (841), 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) [2023-08-30 23:13:34,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 204.0) internal successors, (2040), 10 states have internal predecessors, (2040), 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) [2023-08-30 23:13:34,473 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 204.0) internal successors, (2040), 10 states have internal predecessors, (2040), 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) [2023-08-30 23:13:34,473 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 232 flow. Second operand 9 states and 841 transitions. [2023-08-30 23:13:34,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 826 flow [2023-08-30 23:13:34,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 94 transitions, 662 flow, removed 44 selfloop flow, removed 9 redundant places. [2023-08-30 23:13:34,477 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 320 flow [2023-08-30 23:13:34,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=320, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-08-30 23:13:34,478 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2023-08-30 23:13:34,478 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 320 flow [2023-08-30 23:13:34,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 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) [2023-08-30 23:13:34,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:34,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:34,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:13:34,479 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:13:34,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:34,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1708731838, now seen corresponding path program 2 times [2023-08-30 23:13:34,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:34,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680253564] [2023-08-30 23:13:34,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:34,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:34,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:34,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680253564] [2023-08-30 23:13:34,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680253564] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:34,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:34,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:13:34,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915016626] [2023-08-30 23:13:34,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:34,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:13:34,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:34,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:13:34,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:13:34,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 204 [2023-08-30 23:13:34,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 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) [2023-08-30 23:13:34,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:34,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 204 [2023-08-30 23:13:34,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:34,759 INFO L130 PetriNetUnfolder]: 174/351 cut-off events. [2023-08-30 23:13:34,759 INFO L131 PetriNetUnfolder]: For 765/765 co-relation queries the response was YES. [2023-08-30 23:13:34,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 351 events. 174/351 cut-off events. For 765/765 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1355 event pairs, 17 based on Foata normal form. 1/352 useless extension candidates. Maximal degree in co-relation 1474. Up to 151 conditions per place. [2023-08-30 23:13:34,760 INFO L137 encePairwiseOnDemand]: 196/204 looper letters, 29 selfloop transitions, 5 changer transitions 45/79 dead transitions. [2023-08-30 23:13:34,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 646 flow [2023-08-30 23:13:34,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:13:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:13:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2023-08-30 23:13:34,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4677871148459384 [2023-08-30 23:13:34,762 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 668 transitions. [2023-08-30 23:13:34,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 668 transitions. [2023-08-30 23:13:34,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:34,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 668 transitions. [2023-08-30 23:13:34,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:34,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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) [2023-08-30 23:13:34,766 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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) [2023-08-30 23:13:34,766 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 320 flow. Second operand 7 states and 668 transitions. [2023-08-30 23:13:34,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 79 transitions, 646 flow [2023-08-30 23:13:34,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 79 transitions, 632 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-30 23:13:34,769 INFO L231 Difference]: Finished difference. Result has 58 places, 27 transitions, 155 flow [2023-08-30 23:13:34,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=155, PETRI_PLACES=58, PETRI_TRANSITIONS=27} [2023-08-30 23:13:34,769 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2023-08-30 23:13:34,769 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 27 transitions, 155 flow [2023-08-30 23:13:34,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 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) [2023-08-30 23:13:34,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:34,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:34,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:13:34,770 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:13:34,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:34,771 INFO L85 PathProgramCache]: Analyzing trace with hash -258742974, now seen corresponding path program 3 times [2023-08-30 23:13:34,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:34,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63646446] [2023-08-30 23:13:34,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:34,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:13:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:13:35,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:13:35,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63646446] [2023-08-30 23:13:35,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63646446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:13:35,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:13:35,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:13:35,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340535398] [2023-08-30 23:13:35,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:13:35,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:13:35,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:13:35,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:13:35,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:13:35,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 204 [2023-08-30 23:13:35,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 27 transitions, 155 flow. Second operand has 7 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:35,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:13:35,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 204 [2023-08-30 23:13:35,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:13:35,353 INFO L130 PetriNetUnfolder]: 32/92 cut-off events. [2023-08-30 23:13:35,354 INFO L131 PetriNetUnfolder]: For 274/274 co-relation queries the response was YES. [2023-08-30 23:13:35,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 92 events. 32/92 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 250 event pairs, 4 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 381. Up to 40 conditions per place. [2023-08-30 23:13:35,354 INFO L137 encePairwiseOnDemand]: 198/204 looper letters, 25 selfloop transitions, 3 changer transitions 15/46 dead transitions. [2023-08-30 23:13:35,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 46 transitions, 355 flow [2023-08-30 23:13:35,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:13:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:13:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 681 transitions. [2023-08-30 23:13:35,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47689075630252103 [2023-08-30 23:13:35,356 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 681 transitions. [2023-08-30 23:13:35,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 681 transitions. [2023-08-30 23:13:35,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:13:35,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 681 transitions. [2023-08-30 23:13:35,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 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) [2023-08-30 23:13:35,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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) [2023-08-30 23:13:35,359 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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) [2023-08-30 23:13:35,359 INFO L175 Difference]: Start difference. First operand has 58 places, 27 transitions, 155 flow. Second operand 7 states and 681 transitions. [2023-08-30 23:13:35,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 46 transitions, 355 flow [2023-08-30 23:13:35,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 280 flow, removed 11 selfloop flow, removed 19 redundant places. [2023-08-30 23:13:35,360 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 116 flow [2023-08-30 23:13:35,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2023-08-30 23:13:35,361 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2023-08-30 23:13:35,361 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 116 flow [2023-08-30 23:13:35,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:13:35,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:13:35,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:35,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:13:35,361 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 23:13:35,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:13:35,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1308297412, now seen corresponding path program 4 times [2023-08-30 23:13:35,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:13:35,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559405202] [2023-08-30 23:13:35,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:13:35,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:13:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:13:35,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:13:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:13:35,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:13:35,418 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:13:35,418 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 23:13:35,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 23:13:35,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 23:13:35,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 23:13:35,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 23:13:35,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 23:13:35,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:13:35,421 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:13:35,424 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:13:35,424 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:13:35,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:13:35 BasicIcfg [2023-08-30 23:13:35,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:13:35,463 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:13:35,463 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:13:35,463 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:13:35,464 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:13:27" (3/4) ... [2023-08-30 23:13:35,465 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:13:35,520 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:13:35,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:13:35,521 INFO L158 Benchmark]: Toolchain (without parser) took 8948.06ms. Allocated memory was 90.2MB in the beginning and 276.8MB in the end (delta: 186.6MB). Free memory was 66.9MB in the beginning and 202.3MB in the end (delta: -135.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2023-08-30 23:13:35,521 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 62.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:13:35,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.67ms. Allocated memory is still 90.2MB. Free memory was 66.7MB in the beginning and 66.1MB in the end (delta: 599.0kB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2023-08-30 23:13:35,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.09ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 63.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:13:35,522 INFO L158 Benchmark]: Boogie Preprocessor took 47.03ms. Allocated memory is still 90.2MB. Free memory was 63.5MB in the beginning and 61.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:13:35,523 INFO L158 Benchmark]: RCFGBuilder took 519.21ms. Allocated memory is still 90.2MB. Free memory was 61.9MB in the beginning and 63.3MB in the end (delta: -1.5MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2023-08-30 23:13:35,523 INFO L158 Benchmark]: TraceAbstraction took 7835.63ms. Allocated memory was 90.2MB in the beginning and 276.8MB in the end (delta: 186.6MB). Free memory was 62.3MB in the beginning and 211.7MB in the end (delta: -149.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-08-30 23:13:35,523 INFO L158 Benchmark]: Witness Printer took 57.66ms. Allocated memory is still 276.8MB. Free memory was 211.7MB in the beginning and 202.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-08-30 23:13:35,524 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 62.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.67ms. Allocated memory is still 90.2MB. Free memory was 66.7MB in the beginning and 66.1MB in the end (delta: 599.0kB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.09ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 63.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.03ms. Allocated memory is still 90.2MB. Free memory was 63.5MB in the beginning and 61.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 519.21ms. Allocated memory is still 90.2MB. Free memory was 61.9MB in the beginning and 63.3MB in the end (delta: -1.5MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7835.63ms. Allocated memory was 90.2MB in the beginning and 276.8MB in the end (delta: 186.6MB). Free memory was 62.3MB in the beginning and 211.7MB in the end (delta: -149.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 57.66ms. Allocated memory is still 276.8MB. Free memory was 211.7MB in the beginning and 202.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 115 PlacesBefore, 33 PlacesAfterwards, 107 TransitionsBefore, 24 TransitionsAfterwards, 1840 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 4417 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1989, independent: 1829, independent conditional: 0, independent unconditional: 1829, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1017, independent: 988, independent conditional: 0, independent unconditional: 988, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1989, independent: 841, independent conditional: 0, independent unconditional: 841, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 1017, unknown conditional: 0, unknown unconditional: 1017] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1004, ((void *)0), P0, ((void *)0))=-1, t1004={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1005, ((void *)0), P1, ((void *)0))=0, t1004={5:0}, t1005={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1006, ((void *)0), P2, ((void *)0))=1, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 838]: 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: 836]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 545 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 431 mSDsluCounter, 319 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 221 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1289 IncrementalHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 98 mSDtfsCounter, 1289 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=320occurred in iteration=9, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 1117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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! [2023-08-30 23:13:35,539 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