./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/safe029_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:58:42,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:58:42,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:58:42,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:58:42,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:58:42,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:58:42,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:58:42,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:58:42,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:58:42,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:58:42,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:58:42,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:58:42,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:58:42,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:58:42,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:58:42,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:58:42,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:58:42,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:58:42,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:58:42,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:58:42,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:58:42,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:58:42,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:58:42,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:58:42,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:58:42,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:58:42,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:58:42,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:58:42,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:58:43,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:58:43,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:58:43,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:58:43,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:58:43,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:58:43,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:58:43,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:58:43,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:58:43,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:58:43,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:58:43,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:58:43,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:58:43,010 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:58:43,033 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:58:43,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:58:43,034 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:58:43,034 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:58:43,035 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:58:43,035 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:58:43,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:58:43,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:58:43,036 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:58:43,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:58:43,036 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:58:43,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:58:43,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:58:43,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:58:43,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:58:43,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:58:43,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:58:43,037 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:58:43,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:58:43,038 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:58:43,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:58:43,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:58:43,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:58:43,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:58:43,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:58:43,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:58:43,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:58:43,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:58:43,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:58:43,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:58:43,039 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:58:43,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:58:43,040 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:58:43,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:58:43,040 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:58:43,040 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 -> 7db5da573de5a20455a36e013b1614f5d7f4dede9c4027ebf8a62a657a5ca5e2 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 -> AFTER [2023-08-30 16:58:43,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:58:43,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:58:43,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:58:43,265 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:58:43,266 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:58:43,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:58:44,141 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:58:44,373 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:58:44,374 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:58:44,386 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/800f8b0c9/121db61ab84e45b798bd8b8e842bdbc4/FLAG2442ff0a0 [2023-08-30 16:58:44,395 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/800f8b0c9/121db61ab84e45b798bd8b8e842bdbc4 [2023-08-30 16:58:44,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:58:44,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:58:44,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:58:44,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:58:44,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:58:44,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:58:44" (1/1) ... [2023-08-30 16:58:44,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5215b0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44, skipping insertion in model container [2023-08-30 16:58:44,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:58:44" (1/1) ... [2023-08-30 16:58:44,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:58:44,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:58:44,588 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-30 16:58:44,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:58:44,755 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:58:44,763 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-30 16:58:44,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:58:44,840 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:58:44,841 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:58:44,845 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:58:44,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44 WrapperNode [2023-08-30 16:58:44,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:58:44,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:58:44,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:58:44,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:58:44,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44" (1/1) ... [2023-08-30 16:58:44,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44" (1/1) ... [2023-08-30 16:58:44,896 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-08-30 16:58:44,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:58:44,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:58:44,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:58:44,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:58:44,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44" (1/1) ... [2023-08-30 16:58:44,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44" (1/1) ... [2023-08-30 16:58:44,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44" (1/1) ... [2023-08-30 16:58:44,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44" (1/1) ... [2023-08-30 16:58:44,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44" (1/1) ... [2023-08-30 16:58:44,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44" (1/1) ... [2023-08-30 16:58:44,919 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44" (1/1) ... [2023-08-30 16:58:44,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44" (1/1) ... [2023-08-30 16:58:44,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:58:44,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:58:44,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:58:44,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:58:44,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44" (1/1) ... [2023-08-30 16:58:44,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:58:44,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:58:44,952 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 16:58:44,972 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 16:58:44,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:58:44,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:58:44,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:58:44,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:58:44,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:58:44,980 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:58:44,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:58:44,980 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:58:44,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:58:44,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:58:44,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:58:44,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:58:44,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:58:44,981 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 16:58:45,095 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:58:45,097 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:58:45,286 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:58:45,381 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:58:45,381 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:58:45,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:58:45 BoogieIcfgContainer [2023-08-30 16:58:45,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:58:45,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:58:45,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:58:45,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:58:45,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:58:44" (1/3) ... [2023-08-30 16:58:45,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18914070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:58:45, skipping insertion in model container [2023-08-30 16:58:45,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:58:44" (2/3) ... [2023-08-30 16:58:45,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18914070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:58:45, skipping insertion in model container [2023-08-30 16:58:45,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:58:45" (3/3) ... [2023-08-30 16:58:45,388 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:58:45,392 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:58:45,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:58:45,398 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:58:45,398 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:58:45,437 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:58:45,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2023-08-30 16:58:45,508 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2023-08-30 16:58:45,509 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:58:45,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-08-30 16:58:45,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2023-08-30 16:58:45,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2023-08-30 16:58:45,527 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:58:45,536 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 174 flow [2023-08-30 16:58:45,539 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 174 flow [2023-08-30 16:58:45,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 174 flow [2023-08-30 16:58:45,560 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2023-08-30 16:58:45,560 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:58:45,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-08-30 16:58:45,562 INFO L119 LiptonReduction]: Number of co-enabled transitions 1034 [2023-08-30 16:58:47,759 INFO L134 LiptonReduction]: Checked pairs total: 2756 [2023-08-30 16:58:47,760 INFO L136 LiptonReduction]: Total number of compositions: 76 [2023-08-30 16:58:47,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:58:47,772 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;@32bb46a8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:58:47,772 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 16:58:47,774 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-30 16:58:47,774 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:58:47,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:47,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:58:47,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:58:47,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:47,778 INFO L85 PathProgramCache]: Analyzing trace with hash 393810, now seen corresponding path program 1 times [2023-08-30 16:58:47,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:47,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318400109] [2023-08-30 16:58:47,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:47,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:48,001 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 16:58:48,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:48,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318400109] [2023-08-30 16:58:48,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318400109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:48,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:48,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:58:48,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264020057] [2023-08-30 16:58:48,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:48,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:58:48,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:48,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:58:48,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:58:48,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 162 [2023-08-30 16:58:48,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 16:58:48,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:48,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 162 [2023-08-30 16:58:48,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:48,140 INFO L130 PetriNetUnfolder]: 159/311 cut-off events. [2023-08-30 16:58:48,141 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 16:58:48,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 311 events. 159/311 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1410 event pairs, 18 based on Foata normal form. 16/293 useless extension candidates. Maximal degree in co-relation 595. Up to 232 conditions per place. [2023-08-30 16:58:48,144 INFO L137 encePairwiseOnDemand]: 158/162 looper letters, 21 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2023-08-30 16:58:48,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 121 flow [2023-08-30 16:58:48,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:58:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:58:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2023-08-30 16:58:48,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-08-30 16:58:48,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 252 transitions. [2023-08-30 16:58:48,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 252 transitions. [2023-08-30 16:58:48,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:48,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 252 transitions. [2023-08-30 16:58:48,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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 16:58:48,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 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 16:58:48,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 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 16:58:48,168 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 252 transitions. [2023-08-30 16:58:48,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 121 flow [2023-08-30 16:58:48,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:58:48,171 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-08-30 16:58:48,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-30 16:58:48,175 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-08-30 16:58:48,175 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-08-30 16:58:48,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 16:58:48,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:48,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:48,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:58:48,177 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:58:48,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:48,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1209529008, now seen corresponding path program 1 times [2023-08-30 16:58:48,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:48,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872988937] [2023-08-30 16:58:48,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:48,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:48,928 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 16:58:48,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:48,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872988937] [2023-08-30 16:58:48,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872988937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:48,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:48,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:58:48,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174994215] [2023-08-30 16:58:48,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:48,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:58:48,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:48,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:58:48,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:58:48,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 162 [2023-08-30 16:58:48,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:48,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:48,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 162 [2023-08-30 16:58:48,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:49,131 INFO L130 PetriNetUnfolder]: 175/341 cut-off events. [2023-08-30 16:58:49,131 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2023-08-30 16:58:49,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 341 events. 175/341 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1434 event pairs, 48 based on Foata normal form. 23/364 useless extension candidates. Maximal degree in co-relation 692. Up to 231 conditions per place. [2023-08-30 16:58:49,133 INFO L137 encePairwiseOnDemand]: 154/162 looper letters, 23 selfloop transitions, 8 changer transitions 16/48 dead transitions. [2023-08-30 16:58:49,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 48 transitions, 208 flow [2023-08-30 16:58:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:58:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:58:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 519 transitions. [2023-08-30 16:58:49,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4576719576719577 [2023-08-30 16:58:49,136 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 519 transitions. [2023-08-30 16:58:49,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 519 transitions. [2023-08-30 16:58:49,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:49,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 519 transitions. [2023-08-30 16:58:49,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 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 16:58:49,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 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 16:58:49,140 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 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 16:58:49,140 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 7 states and 519 transitions. [2023-08-30 16:58:49,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 48 transitions, 208 flow [2023-08-30 16:58:49,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 48 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:58:49,142 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 95 flow [2023-08-30 16:58:49,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=95, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-08-30 16:58:49,142 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2023-08-30 16:58:49,143 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 95 flow [2023-08-30 16:58:49,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:49,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:49,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:49,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:58:49,143 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:58:49,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:49,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1159300945, now seen corresponding path program 1 times [2023-08-30 16:58:49,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:49,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779219200] [2023-08-30 16:58:49,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:49,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:49,396 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 16:58:49,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:49,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779219200] [2023-08-30 16:58:49,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779219200] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:49,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:49,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:58:49,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809602114] [2023-08-30 16:58:49,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:49,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:58:49,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:49,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:58:49,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:58:49,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 162 [2023-08-30 16:58:49,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 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 16:58:49,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:49,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 162 [2023-08-30 16:58:49,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:49,517 INFO L130 PetriNetUnfolder]: 190/352 cut-off events. [2023-08-30 16:58:49,517 INFO L131 PetriNetUnfolder]: For 362/373 co-relation queries the response was YES. [2023-08-30 16:58:49,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 352 events. 190/352 cut-off events. For 362/373 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1387 event pairs, 62 based on Foata normal form. 29/381 useless extension candidates. Maximal degree in co-relation 1068. Up to 295 conditions per place. [2023-08-30 16:58:49,519 INFO L137 encePairwiseOnDemand]: 157/162 looper letters, 24 selfloop transitions, 3 changer transitions 11/40 dead transitions. [2023-08-30 16:58:49,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 232 flow [2023-08-30 16:58:49,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:58:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:58:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 398 transitions. [2023-08-30 16:58:49,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49135802469135803 [2023-08-30 16:58:49,521 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 398 transitions. [2023-08-30 16:58:49,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 398 transitions. [2023-08-30 16:58:49,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:49,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 398 transitions. [2023-08-30 16:58:49,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 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 16:58:49,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 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 16:58:49,524 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 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 16:58:49,524 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 95 flow. Second operand 5 states and 398 transitions. [2023-08-30 16:58:49,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 232 flow [2023-08-30 16:58:49,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 228 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 16:58:49,527 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 118 flow [2023-08-30 16:58:49,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-08-30 16:58:49,527 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2023-08-30 16:58:49,527 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 118 flow [2023-08-30 16:58:49,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 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 16:58:49,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:49,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:49,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:58:49,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:58:49,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1583242462, now seen corresponding path program 1 times [2023-08-30 16:58:49,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:49,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72384973] [2023-08-30 16:58:49,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:49,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:50,049 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 16:58:50,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:50,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72384973] [2023-08-30 16:58:50,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72384973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:50,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:50,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:58:50,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447397313] [2023-08-30 16:58:50,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:50,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:58:50,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:50,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:58:50,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:58:50,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 162 [2023-08-30 16:58:50,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 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 16:58:50,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:50,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 162 [2023-08-30 16:58:50,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:50,213 INFO L130 PetriNetUnfolder]: 226/436 cut-off events. [2023-08-30 16:58:50,213 INFO L131 PetriNetUnfolder]: For 710/730 co-relation queries the response was YES. [2023-08-30 16:58:50,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 436 events. 226/436 cut-off events. For 710/730 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2058 event pairs, 45 based on Foata normal form. 27/453 useless extension candidates. Maximal degree in co-relation 1464. Up to 197 conditions per place. [2023-08-30 16:58:50,215 INFO L137 encePairwiseOnDemand]: 155/162 looper letters, 29 selfloop transitions, 8 changer transitions 10/49 dead transitions. [2023-08-30 16:58:50,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 49 transitions, 314 flow [2023-08-30 16:58:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:58:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:58:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 445 transitions. [2023-08-30 16:58:50,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45781893004115226 [2023-08-30 16:58:50,217 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 445 transitions. [2023-08-30 16:58:50,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 445 transitions. [2023-08-30 16:58:50,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:50,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 445 transitions. [2023-08-30 16:58:50,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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 16:58:50,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 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 16:58:50,220 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 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 16:58:50,220 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 118 flow. Second operand 6 states and 445 transitions. [2023-08-30 16:58:50,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 49 transitions, 314 flow [2023-08-30 16:58:50,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 306 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 16:58:50,222 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 162 flow [2023-08-30 16:58:50,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-30 16:58:50,223 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2023-08-30 16:58:50,223 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 162 flow [2023-08-30 16:58:50,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 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 16:58:50,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:50,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:50,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:58:50,224 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:58:50,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1582259359, now seen corresponding path program 1 times [2023-08-30 16:58:50,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:50,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278678350] [2023-08-30 16:58:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:50,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:50,509 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 16:58:50,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:50,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278678350] [2023-08-30 16:58:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278678350] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:50,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:50,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:58:50,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691837830] [2023-08-30 16:58:50,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:50,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:58:50,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:50,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:58:50,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:58:50,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 162 [2023-08-30 16:58:50,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 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 16:58:50,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:50,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 162 [2023-08-30 16:58:50,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:50,640 INFO L130 PetriNetUnfolder]: 218/424 cut-off events. [2023-08-30 16:58:50,640 INFO L131 PetriNetUnfolder]: For 936/947 co-relation queries the response was YES. [2023-08-30 16:58:50,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 424 events. 218/424 cut-off events. For 936/947 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1865 event pairs, 80 based on Foata normal form. 37/461 useless extension candidates. Maximal degree in co-relation 1516. Up to 333 conditions per place. [2023-08-30 16:58:50,643 INFO L137 encePairwiseOnDemand]: 156/162 looper letters, 31 selfloop transitions, 7 changer transitions 12/52 dead transitions. [2023-08-30 16:58:50,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 385 flow [2023-08-30 16:58:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:58:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:58:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 465 transitions. [2023-08-30 16:58:50,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2023-08-30 16:58:50,644 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 465 transitions. [2023-08-30 16:58:50,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 465 transitions. [2023-08-30 16:58:50,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:50,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 465 transitions. [2023-08-30 16:58:50,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 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 16:58:50,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 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 16:58:50,647 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 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 16:58:50,647 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 162 flow. Second operand 6 states and 465 transitions. [2023-08-30 16:58:50,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 385 flow [2023-08-30 16:58:50,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 370 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 16:58:50,650 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 202 flow [2023-08-30 16:58:50,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-30 16:58:50,651 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2023-08-30 16:58:50,651 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 202 flow [2023-08-30 16:58:50,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.0) internal successors, (365), 5 states have internal predecessors, (365), 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 16:58:50,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:50,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:50,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:58:50,652 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:58:50,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1395423914, now seen corresponding path program 1 times [2023-08-30 16:58:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:50,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562203317] [2023-08-30 16:58:50,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:51,196 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 16:58:51,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:51,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562203317] [2023-08-30 16:58:51,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562203317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:51,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:51,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:58:51,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895359022] [2023-08-30 16:58:51,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:51,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:58:51,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:51,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:58:51,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:58:51,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 162 [2023-08-30 16:58:51,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 66.66666666666667) internal successors, (400), 6 states have internal predecessors, (400), 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 16:58:51,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:51,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 162 [2023-08-30 16:58:51,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:51,466 INFO L130 PetriNetUnfolder]: 234/440 cut-off events. [2023-08-30 16:58:51,466 INFO L131 PetriNetUnfolder]: For 1217/1217 co-relation queries the response was YES. [2023-08-30 16:58:51,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 440 events. 234/440 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1841 event pairs, 98 based on Foata normal form. 17/457 useless extension candidates. Maximal degree in co-relation 1769. Up to 325 conditions per place. [2023-08-30 16:58:51,469 INFO L137 encePairwiseOnDemand]: 152/162 looper letters, 32 selfloop transitions, 20 changer transitions 18/70 dead transitions. [2023-08-30 16:58:51,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 579 flow [2023-08-30 16:58:51,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:58:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:58:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 644 transitions. [2023-08-30 16:58:51,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44170096021947874 [2023-08-30 16:58:51,472 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 644 transitions. [2023-08-30 16:58:51,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 644 transitions. [2023-08-30 16:58:51,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:51,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 644 transitions. [2023-08-30 16:58:51,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 71.55555555555556) internal successors, (644), 9 states have internal predecessors, (644), 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 16:58:51,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 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 16:58:51,476 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 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 16:58:51,476 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 202 flow. Second operand 9 states and 644 transitions. [2023-08-30 16:58:51,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 579 flow [2023-08-30 16:58:51,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 552 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-30 16:58:51,480 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 333 flow [2023-08-30 16:58:51,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=333, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-08-30 16:58:51,482 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2023-08-30 16:58:51,483 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 333 flow [2023-08-30 16:58:51,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.66666666666667) internal successors, (400), 6 states have internal predecessors, (400), 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 16:58:51,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:51,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:51,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:58:51,484 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:58:51,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1806774398, now seen corresponding path program 1 times [2023-08-30 16:58:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:51,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160598414] [2023-08-30 16:58:51,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:51,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:51,788 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 16:58:51,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:51,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160598414] [2023-08-30 16:58:51,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160598414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:51,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:51,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:58:51,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844280989] [2023-08-30 16:58:51,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:51,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:58:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:51,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:58:51,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:58:51,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 162 [2023-08-30 16:58:51,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 333 flow. Second operand has 7 states, 7 states have (on average 65.57142857142857) internal successors, (459), 7 states have internal predecessors, (459), 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 16:58:51,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:51,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 162 [2023-08-30 16:58:51,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:52,070 INFO L130 PetriNetUnfolder]: 253/487 cut-off events. [2023-08-30 16:58:52,070 INFO L131 PetriNetUnfolder]: For 2712/2712 co-relation queries the response was YES. [2023-08-30 16:58:52,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2300 conditions, 487 events. 253/487 cut-off events. For 2712/2712 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2185 event pairs, 70 based on Foata normal form. 29/516 useless extension candidates. Maximal degree in co-relation 2270. Up to 280 conditions per place. [2023-08-30 16:58:52,073 INFO L137 encePairwiseOnDemand]: 152/162 looper letters, 33 selfloop transitions, 28 changer transitions 30/91 dead transitions. [2023-08-30 16:58:52,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 91 transitions, 908 flow [2023-08-30 16:58:52,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 16:58:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 16:58:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 772 transitions. [2023-08-30 16:58:52,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4332210998877666 [2023-08-30 16:58:52,075 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 772 transitions. [2023-08-30 16:58:52,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 772 transitions. [2023-08-30 16:58:52,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:52,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 772 transitions. [2023-08-30 16:58:52,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 70.18181818181819) internal successors, (772), 11 states have internal predecessors, (772), 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 16:58:52,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 162.0) internal successors, (1944), 12 states have internal predecessors, (1944), 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 16:58:52,079 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 162.0) internal successors, (1944), 12 states have internal predecessors, (1944), 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 16:58:52,079 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 333 flow. Second operand 11 states and 772 transitions. [2023-08-30 16:58:52,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 91 transitions, 908 flow [2023-08-30 16:58:52,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 866 flow, removed 21 selfloop flow, removed 4 redundant places. [2023-08-30 16:58:52,085 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 500 flow [2023-08-30 16:58:52,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=500, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2023-08-30 16:58:52,086 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 35 predicate places. [2023-08-30 16:58:52,086 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 500 flow [2023-08-30 16:58:52,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 65.57142857142857) internal successors, (459), 7 states have internal predecessors, (459), 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 16:58:52,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:52,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:52,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:58:52,087 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:58:52,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1126334558, now seen corresponding path program 1 times [2023-08-30 16:58:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:52,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620661281] [2023-08-30 16:58:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:52,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:52,216 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 16:58:52,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:52,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620661281] [2023-08-30 16:58:52,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620661281] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:52,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:52,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:58:52,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140847799] [2023-08-30 16:58:52,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:52,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:58:52,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:52,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:58:52,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:58:52,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 162 [2023-08-30 16:58:52,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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 16:58:52,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:52,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 162 [2023-08-30 16:58:52,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:52,260 INFO L130 PetriNetUnfolder]: 56/150 cut-off events. [2023-08-30 16:58:52,260 INFO L131 PetriNetUnfolder]: For 1086/1099 co-relation queries the response was YES. [2023-08-30 16:58:52,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 150 events. 56/150 cut-off events. For 1086/1099 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 568 event pairs, 13 based on Foata normal form. 24/173 useless extension candidates. Maximal degree in co-relation 840. Up to 106 conditions per place. [2023-08-30 16:58:52,261 INFO L137 encePairwiseOnDemand]: 158/162 looper letters, 32 selfloop transitions, 3 changer transitions 3/43 dead transitions. [2023-08-30 16:58:52,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 43 transitions, 509 flow [2023-08-30 16:58:52,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:58:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:58:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2023-08-30 16:58:52,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897119341563786 [2023-08-30 16:58:52,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 238 transitions. [2023-08-30 16:58:52,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 238 transitions. [2023-08-30 16:58:52,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:52,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 238 transitions. [2023-08-30 16:58:52,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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 16:58:52,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 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 16:58:52,265 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 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 16:58:52,265 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 500 flow. Second operand 3 states and 238 transitions. [2023-08-30 16:58:52,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 43 transitions, 509 flow [2023-08-30 16:58:52,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 430 flow, removed 23 selfloop flow, removed 14 redundant places. [2023-08-30 16:58:52,268 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 288 flow [2023-08-30 16:58:52,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-30 16:58:52,269 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2023-08-30 16:58:52,269 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 288 flow [2023-08-30 16:58:52,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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 16:58:52,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:52,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:52,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:58:52,270 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:58:52,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash 197603184, now seen corresponding path program 1 times [2023-08-30 16:58:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:52,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117829295] [2023-08-30 16:58:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:52,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:52,403 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 16:58:52,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:52,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117829295] [2023-08-30 16:58:52,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117829295] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:52,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:52,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:58:52,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270425601] [2023-08-30 16:58:52,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:52,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:58:52,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:52,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:58:52,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:58:52,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 162 [2023-08-30 16:58:52,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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 16:58:52,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:52,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 162 [2023-08-30 16:58:52,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:52,443 INFO L130 PetriNetUnfolder]: 20/69 cut-off events. [2023-08-30 16:58:52,443 INFO L131 PetriNetUnfolder]: For 244/245 co-relation queries the response was YES. [2023-08-30 16:58:52,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 69 events. 20/69 cut-off events. For 244/245 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 194 event pairs, 4 based on Foata normal form. 11/79 useless extension candidates. Maximal degree in co-relation 339. Up to 31 conditions per place. [2023-08-30 16:58:52,444 INFO L137 encePairwiseOnDemand]: 158/162 looper letters, 22 selfloop transitions, 5 changer transitions 9/39 dead transitions. [2023-08-30 16:58:52,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 396 flow [2023-08-30 16:58:52,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:58:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:58:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2023-08-30 16:58:52,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783950617283951 [2023-08-30 16:58:52,445 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 310 transitions. [2023-08-30 16:58:52,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 310 transitions. [2023-08-30 16:58:52,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:52,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 310 transitions. [2023-08-30 16:58:52,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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 16:58:52,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 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 16:58:52,447 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 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 16:58:52,448 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 288 flow. Second operand 4 states and 310 transitions. [2023-08-30 16:58:52,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 396 flow [2023-08-30 16:58:52,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 331 flow, removed 23 selfloop flow, removed 4 redundant places. [2023-08-30 16:58:52,449 INFO L231 Difference]: Finished difference. Result has 47 places, 24 transitions, 162 flow [2023-08-30 16:58:52,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=24} [2023-08-30 16:58:52,450 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2023-08-30 16:58:52,450 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 24 transitions, 162 flow [2023-08-30 16:58:52,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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 16:58:52,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:52,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:52,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:58:52,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:58:52,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:52,451 INFO L85 PathProgramCache]: Analyzing trace with hash -440561854, now seen corresponding path program 1 times [2023-08-30 16:58:52,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:52,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999450010] [2023-08-30 16:58:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:52,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:58:53,000 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 16:58:53,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:58:53,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999450010] [2023-08-30 16:58:53,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999450010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:58:53,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:58:53,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 16:58:53,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132207526] [2023-08-30 16:58:53,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:58:53,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 16:58:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:58:53,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 16:58:53,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-30 16:58:53,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 162 [2023-08-30 16:58:53,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 24 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 69.66666666666667) internal successors, (627), 9 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:53,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:58:53,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 162 [2023-08-30 16:58:53,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:58:53,184 INFO L130 PetriNetUnfolder]: 15/56 cut-off events. [2023-08-30 16:58:53,184 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2023-08-30 16:58:53,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 56 events. 15/56 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 1 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 235. Up to 28 conditions per place. [2023-08-30 16:58:53,184 INFO L137 encePairwiseOnDemand]: 155/162 looper letters, 18 selfloop transitions, 4 changer transitions 15/38 dead transitions. [2023-08-30 16:58:53,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 38 transitions, 308 flow [2023-08-30 16:58:53,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:58:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:58:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 575 transitions. [2023-08-30 16:58:53,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44367283950617287 [2023-08-30 16:58:53,186 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 575 transitions. [2023-08-30 16:58:53,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 575 transitions. [2023-08-30 16:58:53,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:58:53,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 575 transitions. [2023-08-30 16:58:53,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 71.875) internal successors, (575), 8 states have internal predecessors, (575), 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 16:58:53,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 162.0) internal successors, (1458), 9 states have internal predecessors, (1458), 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 16:58:53,189 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 162.0) internal successors, (1458), 9 states have internal predecessors, (1458), 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 16:58:53,189 INFO L175 Difference]: Start difference. First operand has 47 places, 24 transitions, 162 flow. Second operand 8 states and 575 transitions. [2023-08-30 16:58:53,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 38 transitions, 308 flow [2023-08-30 16:58:53,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 38 transitions, 251 flow, removed 12 selfloop flow, removed 11 redundant places. [2023-08-30 16:58:53,190 INFO L231 Difference]: Finished difference. Result has 44 places, 20 transitions, 103 flow [2023-08-30 16:58:53,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=103, PETRI_PLACES=44, PETRI_TRANSITIONS=20} [2023-08-30 16:58:53,191 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2023-08-30 16:58:53,191 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 20 transitions, 103 flow [2023-08-30 16:58:53,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 69.66666666666667) internal successors, (627), 9 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:58:53,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:58:53,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:53,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:58:53,191 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-30 16:58:53,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:58:53,192 INFO L85 PathProgramCache]: Analyzing trace with hash 879104578, now seen corresponding path program 2 times [2023-08-30 16:58:53,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:58:53,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577205411] [2023-08-30 16:58:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:58:53,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:58:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:58:53,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:58:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:58:53,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:58:53,257 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:58:53,258 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-30 16:58:53,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-30 16:58:53,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-30 16:58:53,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-30 16:58:53,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-30 16:58:53,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:58:53,259 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:58:53,263 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:58:53,263 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:58:53,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:58:53 BasicIcfg [2023-08-30 16:58:53,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:58:53,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:58:53,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:58:53,308 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:58:53,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:58:45" (3/4) ... [2023-08-30 16:58:53,309 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:58:53,367 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:58:53,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:58:53,368 INFO L158 Benchmark]: Toolchain (without parser) took 8971.27ms. Allocated memory was 79.7MB in the beginning and 285.2MB in the end (delta: 205.5MB). Free memory was 55.9MB in the beginning and 182.1MB in the end (delta: -126.2MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2023-08-30 16:58:53,369 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 62.9MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:58:53,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.07ms. Allocated memory is still 79.7MB. Free memory was 55.7MB in the beginning and 51.1MB in the end (delta: 4.6MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2023-08-30 16:58:53,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.62ms. Allocated memory is still 79.7MB. Free memory was 51.1MB in the beginning and 48.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:58:53,369 INFO L158 Benchmark]: Boogie Preprocessor took 24.84ms. Allocated memory is still 79.7MB. Free memory was 48.5MB in the beginning and 46.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:58:53,369 INFO L158 Benchmark]: RCFGBuilder took 460.89ms. Allocated memory is still 79.7MB. Free memory was 46.8MB in the beginning and 42.5MB in the end (delta: 4.3MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2023-08-30 16:58:53,369 INFO L158 Benchmark]: TraceAbstraction took 7923.73ms. Allocated memory was 79.7MB in the beginning and 285.2MB in the end (delta: 205.5MB). Free memory was 41.6MB in the beginning and 188.4MB in the end (delta: -146.8MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2023-08-30 16:58:53,370 INFO L158 Benchmark]: Witness Printer took 60.10ms. Allocated memory is still 285.2MB. Free memory was 188.4MB in the beginning and 182.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-08-30 16:58:53,370 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.27ms. Allocated memory is still 62.9MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.07ms. Allocated memory is still 79.7MB. Free memory was 55.7MB in the beginning and 51.1MB in the end (delta: 4.6MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.62ms. Allocated memory is still 79.7MB. Free memory was 51.1MB in the beginning and 48.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.84ms. Allocated memory is still 79.7MB. Free memory was 48.5MB in the beginning and 46.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 460.89ms. Allocated memory is still 79.7MB. Free memory was 46.8MB in the beginning and 42.5MB in the end (delta: 4.3MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7923.73ms. Allocated memory was 79.7MB in the beginning and 285.2MB in the end (delta: 205.5MB). Free memory was 41.6MB in the beginning and 188.4MB in the end (delta: -146.8MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. * Witness Printer took 60.10ms. Allocated memory is still 285.2MB. Free memory was 188.4MB in the beginning and 182.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 89 PlacesBefore, 26 PlacesAfterwards, 84 TransitionsBefore, 20 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 2756 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1130, independent: 1006, independent conditional: 0, independent unconditional: 1006, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 555, independent: 533, independent conditional: 0, independent unconditional: 533, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1130, independent: 473, independent conditional: 0, independent unconditional: 473, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 555, unknown conditional: 0, unknown unconditional: 555] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=-2, t2473={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=-1, t2473={5:0}, t2474={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 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}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3: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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L821] 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}, __unbuffered_cnt=2, 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=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 793]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 104 locations, 5 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.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 432 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 317 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 397 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 45 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=500occurred in iteration=7, InterpolantAutomatonStates: 62, 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, 3.4s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 1158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:58:53,394 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