./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.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/mix011_tso.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 a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef --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:44:02,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:44:02,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:44:02,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:44:02,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:44:02,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:44:02,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:44:02,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:44:02,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:44:02,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:44:02,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:44:02,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:44:02,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:44:02,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:44:02,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:44:02,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:44:02,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:44:02,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:44:02,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:44:02,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:44:02,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:44:03,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:44:03,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:44:03,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:44:03,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:44:03,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:44:03,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:44:03,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:44:03,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:44:03,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:44:03,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:44:03,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:44:03,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:44:03,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:44:03,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:44:03,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:44:03,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:44:03,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:44:03,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:44:03,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:44:03,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:44:03,018 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:44:03,038 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:44:03,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:44:03,039 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:44:03,039 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:44:03,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:44:03,040 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:44:03,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:44:03,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:44:03,041 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:44:03,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:44:03,042 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:44:03,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:44:03,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:44:03,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:44:03,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:44:03,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:44:03,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:44:03,043 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:44:03,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:44:03,043 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:44:03,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:44:03,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:44:03,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:44:03,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:44:03,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:44:03,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:44:03,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:44:03,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:44:03,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:44:03,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:44:03,046 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:44:03,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:44:03,046 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:44:03,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:44:03,046 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:44:03,047 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 -> a4d86e141dde5935b04f74715dd2fbb14b0de9136d07674e0b6c5447ac95e0ef 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:44:03,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:44:03,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:44:03,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:44:03,376 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:44:03,376 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:44:03,378 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2023-08-30 16:44:04,451 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:44:04,728 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:44:04,729 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2023-08-30 16:44:04,739 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62428fd59/ccddf8ea892147a9ab18a1ec46c010ba/FLAGd334376f4 [2023-08-30 16:44:04,754 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62428fd59/ccddf8ea892147a9ab18a1ec46c010ba [2023-08-30 16:44:04,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:44:04,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:44:04,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:44:04,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:44:04,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:44:04,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:44:04" (1/1) ... [2023-08-30 16:44:04,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f7f942b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:44:04, skipping insertion in model container [2023-08-30 16:44:04,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:44:04" (1/1) ... [2023-08-30 16:44:04,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:44:04,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:44:04,942 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/mix011_tso.oepc.i[949,962] [2023-08-30 16:44:05,165 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:44:05,174 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:44:05,184 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/mix011_tso.oepc.i[949,962] [2023-08-30 16:44:05,246 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:44:05,282 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:44:05,282 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:44:05,288 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:44:05,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:44:05 WrapperNode [2023-08-30 16:44:05,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:44:05,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:44:05,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:44:05,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:44:05,297 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:44:05" (1/1) ... [2023-08-30 16:44:05,328 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:44:05" (1/1) ... [2023-08-30 16:44:05,361 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 154 [2023-08-30 16:44:05,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:44:05,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:44:05,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:44:05,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:44:05,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:44:05" (1/1) ... [2023-08-30 16:44:05,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:44:05" (1/1) ... [2023-08-30 16:44:05,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:44:05" (1/1) ... [2023-08-30 16:44:05,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:44:05" (1/1) ... [2023-08-30 16:44:05,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:44:05" (1/1) ... [2023-08-30 16:44:05,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:44:05" (1/1) ... [2023-08-30 16:44:05,405 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:44:05" (1/1) ... [2023-08-30 16:44:05,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:44:05" (1/1) ... [2023-08-30 16:44:05,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:44:05,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:44:05,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:44:05,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:44:05,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:44:05" (1/1) ... [2023-08-30 16:44:05,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:44:05,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:44:05,447 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:44:05,450 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:44:05,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:44:05,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:44:05,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:44:05,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:44:05,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:44:05,477 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:44:05,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:44:05,478 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:44:05,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:44:05,478 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:44:05,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:44:05,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:44:05,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:44:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:44:05,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:44:05,480 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:44:05,606 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:44:05,616 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:44:05,977 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:44:06,112 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:44:06,112 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:44:06,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:44:06 BoogieIcfgContainer [2023-08-30 16:44:06,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:44:06,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:44:06,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:44:06,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:44:06,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:44:04" (1/3) ... [2023-08-30 16:44:06,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da668dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:44:06, skipping insertion in model container [2023-08-30 16:44:06,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:44:05" (2/3) ... [2023-08-30 16:44:06,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da668dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:44:06, skipping insertion in model container [2023-08-30 16:44:06,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:44:06" (3/3) ... [2023-08-30 16:44:06,124 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2023-08-30 16:44:06,131 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:44:06,140 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:44:06,140 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:44:06,140 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:44:06,194 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:44:06,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2023-08-30 16:44:06,298 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2023-08-30 16:44:06,298 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:44:06,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-08-30 16:44:06,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2023-08-30 16:44:06,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2023-08-30 16:44:06,312 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:44:06,331 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2023-08-30 16:44:06,334 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2023-08-30 16:44:06,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2023-08-30 16:44:06,373 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2023-08-30 16:44:06,374 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:44:06,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-08-30 16:44:06,377 INFO L119 LiptonReduction]: Number of co-enabled transitions 2198 [2023-08-30 16:44:09,957 INFO L134 LiptonReduction]: Checked pairs total: 6126 [2023-08-30 16:44:09,958 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-30 16:44:09,970 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:44:09,975 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;@34b81578, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:44:09,976 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 16:44:09,980 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-08-30 16:44:09,980 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:44:09,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:44:09,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 16:44:09,982 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:44:09,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:44:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash 469443053, now seen corresponding path program 1 times [2023-08-30 16:44:09,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:44:09,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440486596] [2023-08-30 16:44:09,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:09,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:44:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:44:10,371 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:44:10,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:44:10,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440486596] [2023-08-30 16:44:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440486596] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:44:10,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:44:10,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:44:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319167188] [2023-08-30 16:44:10,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:44:10,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:44:10,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:44:10,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:44:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:44:10,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 210 [2023-08-30 16:44:10,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:44:10,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:44:10,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 210 [2023-08-30 16:44:10,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:44:10,785 INFO L130 PetriNetUnfolder]: 999/1737 cut-off events. [2023-08-30 16:44:10,785 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-30 16:44:10,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3272 conditions, 1737 events. 999/1737 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10200 event pairs, 165 based on Foata normal form. 64/1652 useless extension candidates. Maximal degree in co-relation 3261. Up to 1195 conditions per place. [2023-08-30 16:44:10,801 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 29 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2023-08-30 16:44:10,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 162 flow [2023-08-30 16:44:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:44:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:44:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2023-08-30 16:44:10,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5365079365079365 [2023-08-30 16:44:10,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 338 transitions. [2023-08-30 16:44:10,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions. [2023-08-30 16:44:10,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:44:10,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions. [2023-08-30 16:44:10,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:44:10,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:44:10,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:44:10,841 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 338 transitions. [2023-08-30 16:44:10,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 162 flow [2023-08-30 16:44:10,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 16:44:10,846 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2023-08-30 16:44:10,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-08-30 16:44:10,851 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2023-08-30 16:44:10,852 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2023-08-30 16:44:10,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:44:10,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:44:10,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:44:10,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:44:10,856 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:44:10,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:44:10,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1746900338, now seen corresponding path program 1 times [2023-08-30 16:44:10,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:44:10,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437307903] [2023-08-30 16:44:10,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:10,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:44:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:44:11,556 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:44:11,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:44:11,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437307903] [2023-08-30 16:44:11,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437307903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:44:11,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:44:11,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:44:11,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817111636] [2023-08-30 16:44:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:44:11,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:44:11,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:44:11,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:44:11,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:44:11,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-30 16:44:11,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 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:44:11,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:44:11,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-30 16:44:11,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:44:11,996 INFO L130 PetriNetUnfolder]: 1683/2509 cut-off events. [2023-08-30 16:44:11,997 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2023-08-30 16:44:11,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5183 conditions, 2509 events. 1683/2509 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11857 event pairs, 423 based on Foata normal form. 144/2652 useless extension candidates. Maximal degree in co-relation 5173. Up to 1665 conditions per place. [2023-08-30 16:44:12,007 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 33 selfloop transitions, 2 changer transitions 22/58 dead transitions. [2023-08-30 16:44:12,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 58 transitions, 244 flow [2023-08-30 16:44:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:44:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:44:12,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2023-08-30 16:44:12,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47523809523809524 [2023-08-30 16:44:12,009 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 499 transitions. [2023-08-30 16:44:12,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 499 transitions. [2023-08-30 16:44:12,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:44:12,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 499 transitions. [2023-08-30 16:44:12,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 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:44:12,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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:44:12,014 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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:44:12,014 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 499 transitions. [2023-08-30 16:44:12,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 58 transitions, 244 flow [2023-08-30 16:44:12,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 58 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:44:12,016 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 66 flow [2023-08-30 16:44:12,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2023-08-30 16:44:12,017 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2023-08-30 16:44:12,017 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 66 flow [2023-08-30 16:44:12,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 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:44:12,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:44:12,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:44:12,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:44:12,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:44:12,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:44:12,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1380918308, now seen corresponding path program 1 times [2023-08-30 16:44:12,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:44:12,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874698006] [2023-08-30 16:44:12,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:12,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:44:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:44:12,572 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:44:12,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:44:12,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874698006] [2023-08-30 16:44:12,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874698006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:44:12,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:44:12,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:44:12,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942883135] [2023-08-30 16:44:12,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:44:12,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:44:12,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:44:12,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:44:12,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:44:12,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 210 [2023-08-30 16:44:12,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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:44:12,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:44:12,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 210 [2023-08-30 16:44:12,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:44:12,993 INFO L130 PetriNetUnfolder]: 916/1477 cut-off events. [2023-08-30 16:44:12,993 INFO L131 PetriNetUnfolder]: For 302/302 co-relation queries the response was YES. [2023-08-30 16:44:12,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 1477 events. 916/1477 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7165 event pairs, 409 based on Foata normal form. 60/1516 useless extension candidates. Maximal degree in co-relation 3184. Up to 1182 conditions per place. [2023-08-30 16:44:13,002 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 36 selfloop transitions, 12 changer transitions 20/72 dead transitions. [2023-08-30 16:44:13,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 310 flow [2023-08-30 16:44:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:44:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:44:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 815 transitions. [2023-08-30 16:44:13,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2023-08-30 16:44:13,005 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 815 transitions. [2023-08-30 16:44:13,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 815 transitions. [2023-08-30 16:44:13,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:44:13,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 815 transitions. [2023-08-30 16:44:13,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.875) internal successors, (815), 8 states have internal predecessors, (815), 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:44:13,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 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:44:13,012 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 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:44:13,012 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 66 flow. Second operand 8 states and 815 transitions. [2023-08-30 16:44:13,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 310 flow [2023-08-30 16:44:13,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 72 transitions, 302 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 16:44:13,019 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 144 flow [2023-08-30 16:44:13,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=144, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-30 16:44:13,020 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2023-08-30 16:44:13,023 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 144 flow [2023-08-30 16:44:13,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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:44:13,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:44:13,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:44:13,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:44:13,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:44:13,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:44:13,026 INFO L85 PathProgramCache]: Analyzing trace with hash -560277340, now seen corresponding path program 2 times [2023-08-30 16:44:13,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:44:13,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120830036] [2023-08-30 16:44:13,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:13,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:44:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:44:13,469 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:44:13,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:44:13,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120830036] [2023-08-30 16:44:13,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120830036] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:44:13,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:44:13,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:44:13,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150761555] [2023-08-30 16:44:13,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:44:13,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:44:13,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:44:13,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:44:13,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:44:13,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-08-30 16:44:13,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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:44:13,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:44:13,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-08-30 16:44:13,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:44:13,906 INFO L130 PetriNetUnfolder]: 1796/2708 cut-off events. [2023-08-30 16:44:13,906 INFO L131 PetriNetUnfolder]: For 2732/2767 co-relation queries the response was YES. [2023-08-30 16:44:13,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7586 conditions, 2708 events. 1796/2708 cut-off events. For 2732/2767 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12345 event pairs, 501 based on Foata normal form. 155/2859 useless extension candidates. Maximal degree in co-relation 7569. Up to 1682 conditions per place. [2023-08-30 16:44:13,954 INFO L137 encePairwiseOnDemand]: 206/210 looper letters, 56 selfloop transitions, 4 changer transitions 6/69 dead transitions. [2023-08-30 16:44:13,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 396 flow [2023-08-30 16:44:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:44:13,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:44:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2023-08-30 16:44:13,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695238095238095 [2023-08-30 16:44:13,961 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 493 transitions. [2023-08-30 16:44:13,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 493 transitions. [2023-08-30 16:44:13,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:44:13,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 493 transitions. [2023-08-30 16:44:13,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 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:44:13,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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:44:13,966 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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:44:13,967 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 144 flow. Second operand 5 states and 493 transitions. [2023-08-30 16:44:13,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 69 transitions, 396 flow [2023-08-30 16:44:13,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 69 transitions, 392 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 16:44:13,982 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 170 flow [2023-08-30 16:44:13,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-08-30 16:44:13,983 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2023-08-30 16:44:13,984 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 170 flow [2023-08-30 16:44:13,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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:44:13,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:44:13,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:44:13,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:44:13,985 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:44:13,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:44:13,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1314519449, now seen corresponding path program 1 times [2023-08-30 16:44:13,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:44:13,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110595763] [2023-08-30 16:44:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:44:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:44:14,513 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:44:14,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:44:14,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110595763] [2023-08-30 16:44:14,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110595763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:44:14,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:44:14,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:44:14,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727176699] [2023-08-30 16:44:14,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:44:14,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:44:14,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:44:14,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:44:14,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:44:14,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 210 [2023-08-30 16:44:14,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 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:44:14,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:44:14,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 210 [2023-08-30 16:44:14,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:44:14,856 INFO L130 PetriNetUnfolder]: 1002/1696 cut-off events. [2023-08-30 16:44:14,856 INFO L131 PetriNetUnfolder]: For 1946/2055 co-relation queries the response was YES. [2023-08-30 16:44:14,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4845 conditions, 1696 events. 1002/1696 cut-off events. For 1946/2055 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9001 event pairs, 468 based on Foata normal form. 83/1758 useless extension candidates. Maximal degree in co-relation 4825. Up to 1178 conditions per place. [2023-08-30 16:44:14,867 INFO L137 encePairwiseOnDemand]: 203/210 looper letters, 42 selfloop transitions, 11 changer transitions 19/76 dead transitions. [2023-08-30 16:44:14,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 450 flow [2023-08-30 16:44:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:44:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:44:14,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions. [2023-08-30 16:44:14,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2023-08-30 16:44:14,870 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 642 transitions. [2023-08-30 16:44:14,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions. [2023-08-30 16:44:14,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:44:14,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions. [2023-08-30 16:44:14,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 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:44:14,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:44:14,874 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:44:14,875 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 170 flow. Second operand 6 states and 642 transitions. [2023-08-30 16:44:14,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 450 flow [2023-08-30 16:44:14,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:44:14,912 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 223 flow [2023-08-30 16:44:14,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-30 16:44:14,915 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2023-08-30 16:44:14,915 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 223 flow [2023-08-30 16:44:14,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 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:44:14,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:44:14,916 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:44:14,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:44:14,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:44:14,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:44:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash 83022597, now seen corresponding path program 1 times [2023-08-30 16:44:14,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:44:14,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106264000] [2023-08-30 16:44:14,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:44:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:44:15,481 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:44:15,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:44:15,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106264000] [2023-08-30 16:44:15,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106264000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:44:15,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:44:15,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:44:15,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115343290] [2023-08-30 16:44:15,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:44:15,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:44:15,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:44:15,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:44:15,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:44:15,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-08-30 16:44:15,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 223 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 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:44:15,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:44:15,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-08-30 16:44:15,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:44:15,941 INFO L130 PetriNetUnfolder]: 899/1499 cut-off events. [2023-08-30 16:44:15,941 INFO L131 PetriNetUnfolder]: For 3373/3497 co-relation queries the response was YES. [2023-08-30 16:44:15,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5131 conditions, 1499 events. 899/1499 cut-off events. For 3373/3497 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7555 event pairs, 174 based on Foata normal form. 49/1521 useless extension candidates. Maximal degree in co-relation 5106. Up to 892 conditions per place. [2023-08-30 16:44:15,952 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 48 selfloop transitions, 20 changer transitions 12/84 dead transitions. [2023-08-30 16:44:15,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 573 flow [2023-08-30 16:44:15,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:44:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:44:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 740 transitions. [2023-08-30 16:44:15,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2023-08-30 16:44:15,956 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 740 transitions. [2023-08-30 16:44:15,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 740 transitions. [2023-08-30 16:44:15,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:44:15,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 740 transitions. [2023-08-30 16:44:15,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 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:44:15,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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:44:15,960 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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:44:15,960 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 223 flow. Second operand 7 states and 740 transitions. [2023-08-30 16:44:15,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 573 flow [2023-08-30 16:44:15,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 84 transitions, 557 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-30 16:44:15,971 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 341 flow [2023-08-30 16:44:15,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=341, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-30 16:44:15,973 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2023-08-30 16:44:15,973 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 341 flow [2023-08-30 16:44:15,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 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:44:15,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:44:15,974 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:44:15,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:44:15,974 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:44:15,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:44:15,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1572932886, now seen corresponding path program 1 times [2023-08-30 16:44:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:44:15,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651025426] [2023-08-30 16:44:15,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:15,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:44:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:44:16,350 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:44:16,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:44:16,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651025426] [2023-08-30 16:44:16,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651025426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:44:16,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:44:16,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:44:16,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918762420] [2023-08-30 16:44:16,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:44:16,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:44:16,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:44:16,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:44:16,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:44:16,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-08-30 16:44:16,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 341 flow. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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:44:16,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:44:16,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-08-30 16:44:16,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:44:17,038 INFO L130 PetriNetUnfolder]: 2604/3939 cut-off events. [2023-08-30 16:44:17,039 INFO L131 PetriNetUnfolder]: For 12875/12957 co-relation queries the response was YES. [2023-08-30 16:44:17,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15205 conditions, 3939 events. 2604/3939 cut-off events. For 12875/12957 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 19748 event pairs, 238 based on Foata normal form. 136/4069 useless extension candidates. Maximal degree in co-relation 15179. Up to 2110 conditions per place. [2023-08-30 16:44:17,069 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 83 selfloop transitions, 16 changer transitions 15/119 dead transitions. [2023-08-30 16:44:17,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 119 transitions, 1060 flow [2023-08-30 16:44:17,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:44:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:44:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 673 transitions. [2023-08-30 16:44:17,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45782312925170066 [2023-08-30 16:44:17,072 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 673 transitions. [2023-08-30 16:44:17,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 673 transitions. [2023-08-30 16:44:17,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:44:17,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 673 transitions. [2023-08-30 16:44:17,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 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:44:17,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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:44:17,077 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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:44:17,077 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 341 flow. Second operand 7 states and 673 transitions. [2023-08-30 16:44:17,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 119 transitions, 1060 flow [2023-08-30 16:44:17,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 119 transitions, 963 flow, removed 35 selfloop flow, removed 2 redundant places. [2023-08-30 16:44:17,099 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 468 flow [2023-08-30 16:44:17,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=468, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2023-08-30 16:44:17,099 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2023-08-30 16:44:17,100 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 468 flow [2023-08-30 16:44:17,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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:44:17,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:44:17,100 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:44:17,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:44:17,101 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:44:17,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:44:17,101 INFO L85 PathProgramCache]: Analyzing trace with hash -907411786, now seen corresponding path program 2 times [2023-08-30 16:44:17,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:44:17,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740785388] [2023-08-30 16:44:17,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:17,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:44:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:44:17,278 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:44:17,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:44:17,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740785388] [2023-08-30 16:44:17,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740785388] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:44:17,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:44:17,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:44:17,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898684345] [2023-08-30 16:44:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:44:17,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:44:17,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:44:17,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:44:17,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:44:17,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 210 [2023-08-30 16:44:17,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:44:17,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:44:17,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 210 [2023-08-30 16:44:17,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:44:17,482 INFO L130 PetriNetUnfolder]: 692/1248 cut-off events. [2023-08-30 16:44:17,483 INFO L131 PetriNetUnfolder]: For 6090/6143 co-relation queries the response was YES. [2023-08-30 16:44:17,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5394 conditions, 1248 events. 692/1248 cut-off events. For 6090/6143 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6790 event pairs, 148 based on Foata normal form. 78/1303 useless extension candidates. Maximal degree in co-relation 5363. Up to 977 conditions per place. [2023-08-30 16:44:17,494 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 56 selfloop transitions, 4 changer transitions 3/74 dead transitions. [2023-08-30 16:44:17,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 672 flow [2023-08-30 16:44:17,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:44:17,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:44:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-30 16:44:17,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2023-08-30 16:44:17,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-30 16:44:17,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-30 16:44:17,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:44:17,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-30 16:44:17,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:44:17,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:44:17,500 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:44:17,500 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 468 flow. Second operand 3 states and 324 transitions. [2023-08-30 16:44:17,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 672 flow [2023-08-30 16:44:17,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 642 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-08-30 16:44:17,510 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 410 flow [2023-08-30 16:44:17,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2023-08-30 16:44:17,512 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2023-08-30 16:44:17,512 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 410 flow [2023-08-30 16:44:17,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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:44:17,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:44:17,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:44:17,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:44:17,513 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:44:17,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:44:17,514 INFO L85 PathProgramCache]: Analyzing trace with hash 676153165, now seen corresponding path program 1 times [2023-08-30 16:44:17,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:44:17,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335743143] [2023-08-30 16:44:17,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:17,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:44:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:44:17,744 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:44:17,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:44:17,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335743143] [2023-08-30 16:44:17,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335743143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:44:17,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:44:17,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:44:17,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268989801] [2023-08-30 16:44:17,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:44:17,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:44:17,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:44:17,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:44:17,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:44:17,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 210 [2023-08-30 16:44:17,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 410 flow. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 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:44:17,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:44:17,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 210 [2023-08-30 16:44:17,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:44:17,905 INFO L130 PetriNetUnfolder]: 306/637 cut-off events. [2023-08-30 16:44:17,906 INFO L131 PetriNetUnfolder]: For 1891/1937 co-relation queries the response was YES. [2023-08-30 16:44:17,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2616 conditions, 637 events. 306/637 cut-off events. For 1891/1937 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3216 event pairs, 59 based on Foata normal form. 80/707 useless extension candidates. Maximal degree in co-relation 2584. Up to 194 conditions per place. [2023-08-30 16:44:17,915 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 61 selfloop transitions, 7 changer transitions 4/83 dead transitions. [2023-08-30 16:44:17,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 725 flow [2023-08-30 16:44:17,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:44:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:44:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2023-08-30 16:44:17,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2023-08-30 16:44:17,917 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2023-08-30 16:44:17,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2023-08-30 16:44:17,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:44:17,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2023-08-30 16:44:17,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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:44:17,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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:44:17,921 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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:44:17,921 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 410 flow. Second operand 4 states and 432 transitions. [2023-08-30 16:44:17,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 725 flow [2023-08-30 16:44:17,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 721 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:44:17,927 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 427 flow [2023-08-30 16:44:17,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=427, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-08-30 16:44:17,928 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2023-08-30 16:44:17,928 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 427 flow [2023-08-30 16:44:17,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 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:44:17,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:44:17,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:44:17,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:44:17,929 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:44:17,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:44:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash -686732120, now seen corresponding path program 1 times [2023-08-30 16:44:17,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:44:17,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440646776] [2023-08-30 16:44:17,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:17,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:44:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:44:18,203 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:44:18,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:44:18,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440646776] [2023-08-30 16:44:18,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440646776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:44:18,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:44:18,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:44:18,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142056402] [2023-08-30 16:44:18,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:44:18,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:44:18,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:44:18,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:44:18,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:44:18,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 210 [2023-08-30 16:44:18,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 427 flow. Second operand has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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:44:18,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:44:18,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 210 [2023-08-30 16:44:18,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:44:18,338 INFO L130 PetriNetUnfolder]: 249/510 cut-off events. [2023-08-30 16:44:18,339 INFO L131 PetriNetUnfolder]: For 1831/1877 co-relation queries the response was YES. [2023-08-30 16:44:18,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2147 conditions, 510 events. 249/510 cut-off events. For 1831/1877 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2544 event pairs, 50 based on Foata normal form. 38/538 useless extension candidates. Maximal degree in co-relation 2121. Up to 188 conditions per place. [2023-08-30 16:44:18,342 INFO L137 encePairwiseOnDemand]: 205/210 looper letters, 45 selfloop transitions, 10 changer transitions 20/82 dead transitions. [2023-08-30 16:44:18,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 82 transitions, 735 flow [2023-08-30 16:44:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:44:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:44:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2023-08-30 16:44:18,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5038095238095238 [2023-08-30 16:44:18,345 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 529 transitions. [2023-08-30 16:44:18,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 529 transitions. [2023-08-30 16:44:18,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:44:18,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 529 transitions. [2023-08-30 16:44:18,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 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:44:18,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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:44:18,349 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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:44:18,349 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 427 flow. Second operand 5 states and 529 transitions. [2023-08-30 16:44:18,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 82 transitions, 735 flow [2023-08-30 16:44:18,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 82 transitions, 698 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-08-30 16:44:18,358 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 294 flow [2023-08-30 16:44:18,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2023-08-30 16:44:18,359 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2023-08-30 16:44:18,360 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 294 flow [2023-08-30 16:44:18,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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:44:18,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:44:18,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:44:18,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:44:18,361 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:44:18,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:44:18,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1028320864, now seen corresponding path program 1 times [2023-08-30 16:44:18,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:44:18,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347880749] [2023-08-30 16:44:18,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:44:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:44:18,789 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:44:18,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:44:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347880749] [2023-08-30 16:44:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347880749] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:44:18,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:44:18,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:44:18,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92214839] [2023-08-30 16:44:18,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:44:18,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:44:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:44:18,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:44:18,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:44:18,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-08-30 16:44:18,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 294 flow. Second operand has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 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:44:18,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:44:18,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-08-30 16:44:18,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:44:19,126 INFO L130 PetriNetUnfolder]: 419/769 cut-off events. [2023-08-30 16:44:19,127 INFO L131 PetriNetUnfolder]: For 2106/2118 co-relation queries the response was YES. [2023-08-30 16:44:19,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3102 conditions, 769 events. 419/769 cut-off events. For 2106/2118 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3444 event pairs, 106 based on Foata normal form. 13/779 useless extension candidates. Maximal degree in co-relation 3074. Up to 476 conditions per place. [2023-08-30 16:44:19,131 INFO L137 encePairwiseOnDemand]: 203/210 looper letters, 41 selfloop transitions, 3 changer transitions 46/92 dead transitions. [2023-08-30 16:44:19,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 92 transitions, 780 flow [2023-08-30 16:44:19,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:44:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:44:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 660 transitions. [2023-08-30 16:44:19,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2023-08-30 16:44:19,133 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 660 transitions. [2023-08-30 16:44:19,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 660 transitions. [2023-08-30 16:44:19,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:44:19,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 660 transitions. [2023-08-30 16:44:19,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 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:44:19,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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:44:19,138 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 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:44:19,138 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 294 flow. Second operand 7 states and 660 transitions. [2023-08-30 16:44:19,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 92 transitions, 780 flow [2023-08-30 16:44:19,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 639 flow, removed 32 selfloop flow, removed 13 redundant places. [2023-08-30 16:44:19,145 INFO L231 Difference]: Finished difference. Result has 60 places, 36 transitions, 188 flow [2023-08-30 16:44:19,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=60, PETRI_TRANSITIONS=36} [2023-08-30 16:44:19,146 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2023-08-30 16:44:19,146 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 36 transitions, 188 flow [2023-08-30 16:44:19,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 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:44:19,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:44:19,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:44:19,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:44:19,146 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-30 16:44:19,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:44:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1125040908, now seen corresponding path program 2 times [2023-08-30 16:44:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:44:19,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585264140] [2023-08-30 16:44:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:44:19,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:44:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:44:19,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:44:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:44:19,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:44:19,275 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:44:19,276 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-30 16:44:19,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-30 16:44:19,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-30 16:44:19,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-30 16:44:19,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-30 16:44:19,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-30 16:44:19,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:44:19,279 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 16:44:19,284 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:44:19,284 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:44:19,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:44:19 BasicIcfg [2023-08-30 16:44:19,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:44:19,343 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:44:19,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:44:19,344 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:44:19,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:44:06" (3/4) ... [2023-08-30 16:44:19,345 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:44:19,439 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:44:19,439 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:44:19,440 INFO L158 Benchmark]: Toolchain (without parser) took 14682.21ms. Allocated memory was 88.1MB in the beginning and 434.1MB in the end (delta: 346.0MB). Free memory was 64.4MB in the beginning and 375.4MB in the end (delta: -311.0MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2023-08-30 16:44:19,440 INFO L158 Benchmark]: CDTParser took 0.18ms. 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:44:19,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.51ms. Allocated memory is still 88.1MB. Free memory was 64.2MB in the beginning and 60.8MB in the end (delta: 3.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-08-30 16:44:19,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.40ms. Allocated memory is still 88.1MB. Free memory was 60.8MB in the beginning and 57.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:44:19,440 INFO L158 Benchmark]: Boogie Preprocessor took 55.72ms. Allocated memory is still 88.1MB. Free memory was 57.9MB in the beginning and 56.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:44:19,441 INFO L158 Benchmark]: RCFGBuilder took 696.39ms. Allocated memory is still 88.1MB. Free memory was 56.2MB in the beginning and 50.2MB in the end (delta: 6.0MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-08-30 16:44:19,441 INFO L158 Benchmark]: TraceAbstraction took 13224.66ms. Allocated memory was 88.1MB in the beginning and 434.1MB in the end (delta: 346.0MB). Free memory was 49.8MB in the beginning and 386.9MB in the end (delta: -337.1MB). Peak memory consumption was 263.0MB. Max. memory is 16.1GB. [2023-08-30 16:44:19,441 INFO L158 Benchmark]: Witness Printer took 95.68ms. Allocated memory is still 434.1MB. Free memory was 386.9MB in the beginning and 375.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-08-30 16:44:19,442 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.18ms. Allocated memory is still 62.9MB. Free memory is still 40.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.51ms. Allocated memory is still 88.1MB. Free memory was 64.2MB in the beginning and 60.8MB in the end (delta: 3.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.40ms. Allocated memory is still 88.1MB. Free memory was 60.8MB in the beginning and 57.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.72ms. Allocated memory is still 88.1MB. Free memory was 57.9MB in the beginning and 56.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 696.39ms. Allocated memory is still 88.1MB. Free memory was 56.2MB in the beginning and 50.2MB in the end (delta: 6.0MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13224.66ms. Allocated memory was 88.1MB in the beginning and 434.1MB in the end (delta: 346.0MB). Free memory was 49.8MB in the beginning and 386.9MB in the end (delta: -337.1MB). Peak memory consumption was 263.0MB. Max. memory is 16.1GB. * Witness Printer took 95.68ms. Allocated memory is still 434.1MB. Free memory was 386.9MB in the beginning and 375.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 119 PlacesBefore, 37 PlacesAfterwards, 111 TransitionsBefore, 28 TransitionsAfterwards, 2198 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 6126 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2675, independent: 2488, independent conditional: 0, independent unconditional: 2488, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1204, independent: 1169, independent conditional: 0, independent unconditional: 1169, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2675, independent: 1319, independent conditional: 0, independent unconditional: 1319, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 1204, unknown conditional: 0, unknown unconditional: 1204] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t299; [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t299, ((void *)0), P0, ((void *)0))=-1, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L837] 0 pthread_t t300; [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t300, ((void *)0), P1, ((void *)0))=0, t299={5:0}, t300={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L839] 0 pthread_t t301; [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t301, ((void *)0), P2, ((void *)0))=1, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L755] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L858] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L859] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L860] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L861] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L863] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 588 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 447 mSDsluCounter, 396 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 340 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1318 IncrementalHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 56 mSDtfsCounter, 1318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=468occurred in iteration=7, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 1405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:44:19,467 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