./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/goblint-regression/36-apron_21-traces-cluster-based_true.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 cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 11:23:31,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 11:23:31,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 11:23:31,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 11:23:31,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 11:23:31,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 11:23:31,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 11:23:31,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 11:23:31,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 11:23:31,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 11:23:31,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 11:23:31,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 11:23:31,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 11:23:31,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 11:23:31,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 11:23:31,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 11:23:31,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 11:23:31,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 11:23:31,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 11:23:31,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 11:23:31,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 11:23:31,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 11:23:31,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 11:23:31,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 11:23:31,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 11:23:31,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 11:23:31,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 11:23:31,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 11:23:31,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 11:23:31,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 11:23:31,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 11:23:31,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 11:23:31,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 11:23:31,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 11:23:31,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 11:23:31,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 11:23:31,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 11:23:31,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 11:23:31,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 11:23:31,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 11:23:31,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 11:23:31,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 11:23:31,670 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 11:23:31,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 11:23:31,672 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 11:23:31,672 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 11:23:31,673 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 11:23:31,673 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 11:23:31,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 11:23:31,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 11:23:31,674 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 11:23:31,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 11:23:31,675 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 11:23:31,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 11:23:31,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 11:23:31,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 11:23:31,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 11:23:31,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 11:23:31,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 11:23:31,676 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 11:23:31,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 11:23:31,677 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 11:23:31,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 11:23:31,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 11:23:31,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 11:23:31,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 11:23:31,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 11:23:31,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 11:23:31,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 11:23:31,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 11:23:31,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 11:23:31,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 11:23:31,679 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 11:23:31,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 11:23:31,679 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 11:23:31,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 11:23:31,680 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 11:23:31,680 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 -> cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 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 -> BEFORE [2023-09-01 11:23:31,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 11:23:32,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 11:23:32,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 11:23:32,008 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 11:23:32,008 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 11:23:32,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-09-01 11:23:33,226 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 11:23:33,473 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 11:23:33,474 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-09-01 11:23:33,484 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86ade41ac/80720a46b83149b09b26230c35f3e3c5/FLAGa50bc0eb8 [2023-09-01 11:23:33,502 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86ade41ac/80720a46b83149b09b26230c35f3e3c5 [2023-09-01 11:23:33,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 11:23:33,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 11:23:33,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 11:23:33,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 11:23:33,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 11:23:33,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 11:23:33" (1/1) ... [2023-09-01 11:23:33,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456c32f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33, skipping insertion in model container [2023-09-01 11:23:33,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 11:23:33" (1/1) ... [2023-09-01 11:23:33,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 11:23:33,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 11:23:33,713 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2023-09-01 11:23:33,823 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 11:23:33,833 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 11:23:33,843 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2023-09-01 11:23:33,907 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 11:23:33,961 INFO L208 MainTranslator]: Completed translation [2023-09-01 11:23:33,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33 WrapperNode [2023-09-01 11:23:33,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 11:23:33,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 11:23:33,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 11:23:33,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 11:23:33,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33" (1/1) ... [2023-09-01 11:23:33,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33" (1/1) ... [2023-09-01 11:23:34,007 INFO L138 Inliner]: procedures = 165, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 135 [2023-09-01 11:23:34,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 11:23:34,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 11:23:34,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 11:23:34,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 11:23:34,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33" (1/1) ... [2023-09-01 11:23:34,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33" (1/1) ... [2023-09-01 11:23:34,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33" (1/1) ... [2023-09-01 11:23:34,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33" (1/1) ... [2023-09-01 11:23:34,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33" (1/1) ... [2023-09-01 11:23:34,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33" (1/1) ... [2023-09-01 11:23:34,028 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33" (1/1) ... [2023-09-01 11:23:34,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33" (1/1) ... [2023-09-01 11:23:34,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 11:23:34,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 11:23:34,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 11:23:34,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 11:23:34,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33" (1/1) ... [2023-09-01 11:23:34,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 11:23:34,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 11:23:34,074 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-09-01 11:23:34,099 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-09-01 11:23:34,112 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2023-09-01 11:23:34,113 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2023-09-01 11:23:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 11:23:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 11:23:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 11:23:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 11:23:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2023-09-01 11:23:34,114 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2023-09-01 11:23:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-09-01 11:23:34,114 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-09-01 11:23:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 11:23:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 11:23:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 11:23:34,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 11:23:34,116 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 11:23:34,290 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 11:23:34,292 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 11:23:34,498 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 11:23:34,506 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 11:23:34,506 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 11:23:34,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 11:23:34 BoogieIcfgContainer [2023-09-01 11:23:34,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 11:23:34,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 11:23:34,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 11:23:34,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 11:23:34,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 11:23:33" (1/3) ... [2023-09-01 11:23:34,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afb0de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 11:23:34, skipping insertion in model container [2023-09-01 11:23:34,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:23:33" (2/3) ... [2023-09-01 11:23:34,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afb0de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 11:23:34, skipping insertion in model container [2023-09-01 11:23:34,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 11:23:34" (3/3) ... [2023-09-01 11:23:34,514 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2023-09-01 11:23:34,521 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 11:23:34,528 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 11:23:34,529 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-09-01 11:23:34,529 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 11:23:34,598 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 11:23:34,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 162 transitions, 339 flow [2023-09-01 11:23:34,710 INFO L130 PetriNetUnfolder]: 5/159 cut-off events. [2023-09-01 11:23:34,710 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 11:23:34,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 159 events. 5/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 261 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 123. Up to 2 conditions per place. [2023-09-01 11:23:34,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 162 transitions, 339 flow [2023-09-01 11:23:34,721 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 159 transitions, 327 flow [2023-09-01 11:23:34,724 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 11:23:34,733 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 159 transitions, 327 flow [2023-09-01 11:23:34,736 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 159 transitions, 327 flow [2023-09-01 11:23:34,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 159 transitions, 327 flow [2023-09-01 11:23:34,782 INFO L130 PetriNetUnfolder]: 5/159 cut-off events. [2023-09-01 11:23:34,782 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 11:23:34,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 159 events. 5/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 261 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 123. Up to 2 conditions per place. [2023-09-01 11:23:34,789 INFO L119 LiptonReduction]: Number of co-enabled transitions 9270 [2023-09-01 11:23:39,366 INFO L134 LiptonReduction]: Checked pairs total: 20940 [2023-09-01 11:23:39,367 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-09-01 11:23:39,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 11:23:39,395 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;@35915fca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 11:23:39,396 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-09-01 11:23:39,404 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2023-09-01 11:23:39,405 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 11:23:39,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:23:39,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:23:39,406 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-09-01 11:23:39,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:23:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash -227316659, now seen corresponding path program 1 times [2023-09-01 11:23:39,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:23:39,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732459869] [2023-09-01 11:23:39,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:23:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:23:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:23:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:23:39,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:23:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732459869] [2023-09-01 11:23:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732459869] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:23:39,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:23:39,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 11:23:39,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862174183] [2023-09-01 11:23:39,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:23:39,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 11:23:39,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:23:39,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 11:23:39,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 11:23:39,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 313 [2023-09-01 11:23:40,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 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-09-01 11:23:40,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:23:40,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 313 [2023-09-01 11:23:40,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:23:40,782 INFO L130 PetriNetUnfolder]: 3823/5993 cut-off events. [2023-09-01 11:23:40,783 INFO L131 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2023-09-01 11:23:40,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11607 conditions, 5993 events. 3823/5993 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 41345 event pairs, 735 based on Foata normal form. 225/4746 useless extension candidates. Maximal degree in co-relation 11596. Up to 2475 conditions per place. [2023-09-01 11:23:40,825 INFO L137 encePairwiseOnDemand]: 305/313 looper letters, 109 selfloop transitions, 10 changer transitions 0/130 dead transitions. [2023-09-01 11:23:40,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 130 transitions, 528 flow [2023-09-01 11:23:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 11:23:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 11:23:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1265 transitions. [2023-09-01 11:23:40,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051916932907349 [2023-09-01 11:23:40,842 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1265 transitions. [2023-09-01 11:23:40,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1265 transitions. [2023-09-01 11:23:40,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:23:40,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1265 transitions. [2023-09-01 11:23:40,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 158.125) internal successors, (1265), 8 states have internal predecessors, (1265), 0 states have call successors, (0), 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-09-01 11:23:40,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 313.0) internal successors, (2817), 9 states have internal predecessors, (2817), 0 states have call successors, (0), 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-09-01 11:23:40,875 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 313.0) internal successors, (2817), 9 states have internal predecessors, (2817), 0 states have call successors, (0), 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-09-01 11:23:40,877 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 87 flow. Second operand 8 states and 1265 transitions. [2023-09-01 11:23:40,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 130 transitions, 528 flow [2023-09-01 11:23:40,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 130 transitions, 518 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 11:23:40,884 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 151 flow [2023-09-01 11:23:40,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=151, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-09-01 11:23:40,889 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2023-09-01 11:23:40,890 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 151 flow [2023-09-01 11:23:40,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 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-09-01 11:23:40,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:23:40,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:23:40,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 11:23:40,891 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-09-01 11:23:40,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:23:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash 195691478, now seen corresponding path program 1 times [2023-09-01 11:23:40,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:23:40,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062930867] [2023-09-01 11:23:40,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:23:40,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:23:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:23:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:23:41,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:23:41,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062930867] [2023-09-01 11:23:41,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062930867] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:23:41,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:23:41,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 11:23:41,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543837147] [2023-09-01 11:23:41,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:23:41,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 11:23:41,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:23:41,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 11:23:41,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 11:23:41,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 313 [2023-09-01 11:23:41,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 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-09-01 11:23:41,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:23:41,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 313 [2023-09-01 11:23:41,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:23:41,974 INFO L130 PetriNetUnfolder]: 4107/6760 cut-off events. [2023-09-01 11:23:41,974 INFO L131 PetriNetUnfolder]: For 5111/5549 co-relation queries the response was YES. [2023-09-01 11:23:41,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16373 conditions, 6760 events. 4107/6760 cut-off events. For 5111/5549 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 48515 event pairs, 758 based on Foata normal form. 96/5874 useless extension candidates. Maximal degree in co-relation 16357. Up to 2699 conditions per place. [2023-09-01 11:23:42,036 INFO L137 encePairwiseOnDemand]: 305/313 looper letters, 90 selfloop transitions, 20 changer transitions 0/124 dead transitions. [2023-09-01 11:23:42,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 124 transitions, 631 flow [2023-09-01 11:23:42,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 11:23:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 11:23:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1226 transitions. [2023-09-01 11:23:42,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48961661341853036 [2023-09-01 11:23:42,041 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1226 transitions. [2023-09-01 11:23:42,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1226 transitions. [2023-09-01 11:23:42,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:23:42,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1226 transitions. [2023-09-01 11:23:42,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 153.25) internal successors, (1226), 8 states have internal predecessors, (1226), 0 states have call successors, (0), 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-09-01 11:23:42,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 313.0) internal successors, (2817), 9 states have internal predecessors, (2817), 0 states have call successors, (0), 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-09-01 11:23:42,050 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 313.0) internal successors, (2817), 9 states have internal predecessors, (2817), 0 states have call successors, (0), 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-09-01 11:23:42,051 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 151 flow. Second operand 8 states and 1226 transitions. [2023-09-01 11:23:42,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 124 transitions, 631 flow [2023-09-01 11:23:42,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 124 transitions, 631 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 11:23:42,102 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 326 flow [2023-09-01 11:23:42,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=326, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2023-09-01 11:23:42,103 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2023-09-01 11:23:42,103 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 326 flow [2023-09-01 11:23:42,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 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-09-01 11:23:42,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:23:42,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:23:42,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 11:23:42,105 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-09-01 11:23:42,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:23:42,106 INFO L85 PathProgramCache]: Analyzing trace with hash 442248688, now seen corresponding path program 1 times [2023-09-01 11:23:42,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:23:42,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18781383] [2023-09-01 11:23:42,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:23:42,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:23:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:23:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:23:42,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:23:42,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18781383] [2023-09-01 11:23:42,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18781383] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:23:42,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:23:42,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 11:23:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013046244] [2023-09-01 11:23:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:23:42,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 11:23:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:23:42,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 11:23:42,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 11:23:42,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 313 [2023-09-01 11:23:42,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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-09-01 11:23:42,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:23:42,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 313 [2023-09-01 11:23:42,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:23:42,799 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 50#L736true, Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 57#t3_funEXITtrue, 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0))]) [2023-09-01 11:23:42,799 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,799 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,799 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,800 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,800 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 50#L736true, Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), 68#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-09-01 11:23:42,800 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,800 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,801 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,801 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,839 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 50#L736true, Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 188#true, 57#t3_funEXITtrue, 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0))]) [2023-09-01 11:23:42,839 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,839 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,839 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,840 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,840 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,840 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [t2_funThread1of1ForFork2InUse, 161#t2_funEXITtrue, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 50#L736true, Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), 68#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-09-01 11:23:42,840 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,841 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,841 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,841 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,841 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 11:23:42,844 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 57#t3_funEXITtrue, 17#L694true, 34#L737true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0))]) [2023-09-01 11:23:42,844 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,844 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,845 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,845 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,845 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, 34#L737true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), 68#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-09-01 11:23:42,845 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,846 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,846 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,846 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,883 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 57#t3_funEXITtrue, 17#L694true, 34#L737true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0))]) [2023-09-01 11:23:42,883 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,883 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,883 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,884 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,884 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,884 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [t2_funThread1of1ForFork2InUse, 161#t2_funEXITtrue, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, 34#L737true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), 68#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-09-01 11:23:42,884 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,884 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,885 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,885 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,885 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 11:23:42,888 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, 2#ULTIMATE.startEXITtrue, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 57#t3_funEXITtrue, 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0))]) [2023-09-01 11:23:42,888 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,889 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,889 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,889 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,889 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, 2#ULTIMATE.startEXITtrue, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), 68#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-09-01 11:23:42,889 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,890 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,890 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,894 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,928 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, 2#ULTIMATE.startEXITtrue, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 57#t3_funEXITtrue, 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0))]) [2023-09-01 11:23:42,929 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,929 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,929 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,929 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,929 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,930 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [t2_funThread1of1ForFork2InUse, 161#t2_funEXITtrue, 2#ULTIMATE.startEXITtrue, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), 68#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-09-01 11:23:42,930 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,930 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,932 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,932 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:42,932 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 11:23:43,039 INFO L130 PetriNetUnfolder]: 3637/6796 cut-off events. [2023-09-01 11:23:43,040 INFO L131 PetriNetUnfolder]: For 6478/6790 co-relation queries the response was YES. [2023-09-01 11:23:43,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17685 conditions, 6796 events. 3637/6796 cut-off events. For 6478/6790 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 51709 event pairs, 1607 based on Foata normal form. 792/7002 useless extension candidates. Maximal degree in co-relation 17661. Up to 3854 conditions per place. [2023-09-01 11:23:43,078 INFO L137 encePairwiseOnDemand]: 298/313 looper letters, 52 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2023-09-01 11:23:43,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 569 flow [2023-09-01 11:23:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 11:23:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 11:23:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2023-09-01 11:23:43,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4994675186368477 [2023-09-01 11:23:43,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2023-09-01 11:23:43,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2023-09-01 11:23:43,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:23:43,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2023-09-01 11:23:43,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 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-09-01 11:23:43,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 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-09-01 11:23:43,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 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-09-01 11:23:43,085 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 326 flow. Second operand 3 states and 469 transitions. [2023-09-01 11:23:43,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 569 flow [2023-09-01 11:23:43,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 88 transitions, 565 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-09-01 11:23:43,126 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 408 flow [2023-09-01 11:23:43,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2023-09-01 11:23:43,130 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2023-09-01 11:23:43,130 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 408 flow [2023-09-01 11:23:43,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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-09-01 11:23:43,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:23:43,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:23:43,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 11:23:43,131 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-09-01 11:23:43,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:23:43,132 INFO L85 PathProgramCache]: Analyzing trace with hash 799830391, now seen corresponding path program 1 times [2023-09-01 11:23:43,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:23:43,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123312548] [2023-09-01 11:23:43,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:23:43,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:23:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:23:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:23:43,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:23:43,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123312548] [2023-09-01 11:23:43,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123312548] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:23:43,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:23:43,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 11:23:43,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521745270] [2023-09-01 11:23:43,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:23:43,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 11:23:43,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:23:43,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 11:23:43,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 11:23:43,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 313 [2023-09-01 11:23:43,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 408 flow. Second operand has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 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-09-01 11:23:43,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:23:43,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 313 [2023-09-01 11:23:43,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:23:44,253 INFO L130 PetriNetUnfolder]: 3658/6680 cut-off events. [2023-09-01 11:23:44,254 INFO L131 PetriNetUnfolder]: For 11033/11609 co-relation queries the response was YES. [2023-09-01 11:23:44,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22095 conditions, 6680 events. 3658/6680 cut-off events. For 11033/11609 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 49624 event pairs, 1203 based on Foata normal form. 112/6261 useless extension candidates. Maximal degree in co-relation 22069. Up to 2978 conditions per place. [2023-09-01 11:23:44,297 INFO L137 encePairwiseOnDemand]: 306/313 looper letters, 93 selfloop transitions, 31 changer transitions 5/151 dead transitions. [2023-09-01 11:23:44,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 151 transitions, 1136 flow [2023-09-01 11:23:44,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 11:23:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 11:23:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1220 transitions. [2023-09-01 11:23:44,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48722044728434505 [2023-09-01 11:23:44,301 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1220 transitions. [2023-09-01 11:23:44,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1220 transitions. [2023-09-01 11:23:44,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:23:44,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1220 transitions. [2023-09-01 11:23:44,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 152.5) internal successors, (1220), 8 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:23:44,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 313.0) internal successors, (2817), 9 states have internal predecessors, (2817), 0 states have call successors, (0), 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-09-01 11:23:44,309 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 313.0) internal successors, (2817), 9 states have internal predecessors, (2817), 0 states have call successors, (0), 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-09-01 11:23:44,309 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 408 flow. Second operand 8 states and 1220 transitions. [2023-09-01 11:23:44,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 151 transitions, 1136 flow [2023-09-01 11:23:44,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 151 transitions, 1097 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 11:23:44,353 INFO L231 Difference]: Finished difference. Result has 84 places, 89 transitions, 697 flow [2023-09-01 11:23:44,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=697, PETRI_PLACES=84, PETRI_TRANSITIONS=89} [2023-09-01 11:23:44,354 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2023-09-01 11:23:44,354 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 89 transitions, 697 flow [2023-09-01 11:23:44,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 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-09-01 11:23:44,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:23:44,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:23:44,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 11:23:44,355 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-09-01 11:23:44,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:23:44,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1015979257, now seen corresponding path program 1 times [2023-09-01 11:23:44,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:23:44,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622226907] [2023-09-01 11:23:44,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:23:44,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:23:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:23:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:23:44,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:23:44,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622226907] [2023-09-01 11:23:44,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622226907] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:23:44,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:23:44,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 11:23:44,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893591176] [2023-09-01 11:23:44,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:23:44,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 11:23:44,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:23:44,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 11:23:44,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-01 11:23:44,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 313 [2023-09-01 11:23:44,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 89 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 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-09-01 11:23:44,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:23:44,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 313 [2023-09-01 11:23:44,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:23:45,641 INFO L130 PetriNetUnfolder]: 4694/8615 cut-off events. [2023-09-01 11:23:45,641 INFO L131 PetriNetUnfolder]: For 17363/17540 co-relation queries the response was YES. [2023-09-01 11:23:45,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28392 conditions, 8615 events. 4694/8615 cut-off events. For 17363/17540 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 65378 event pairs, 1446 based on Foata normal form. 228/8520 useless extension candidates. Maximal degree in co-relation 28359. Up to 3643 conditions per place. [2023-09-01 11:23:45,704 INFO L137 encePairwiseOnDemand]: 307/313 looper letters, 130 selfloop transitions, 35 changer transitions 1/188 dead transitions. [2023-09-01 11:23:45,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 188 transitions, 1545 flow [2023-09-01 11:23:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 11:23:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 11:23:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1087 transitions. [2023-09-01 11:23:45,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49612049292560473 [2023-09-01 11:23:45,708 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1087 transitions. [2023-09-01 11:23:45,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1087 transitions. [2023-09-01 11:23:45,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:23:45,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1087 transitions. [2023-09-01 11:23:45,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 155.28571428571428) internal successors, (1087), 7 states have internal predecessors, (1087), 0 states have call successors, (0), 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-09-01 11:23:45,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 313.0) internal successors, (2504), 8 states have internal predecessors, (2504), 0 states have call successors, (0), 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-09-01 11:23:45,715 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 313.0) internal successors, (2504), 8 states have internal predecessors, (2504), 0 states have call successors, (0), 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-09-01 11:23:45,715 INFO L175 Difference]: Start difference. First operand has 84 places, 89 transitions, 697 flow. Second operand 7 states and 1087 transitions. [2023-09-01 11:23:45,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 188 transitions, 1545 flow [2023-09-01 11:23:45,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 188 transitions, 1539 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-09-01 11:23:45,823 INFO L231 Difference]: Finished difference. Result has 94 places, 93 transitions, 808 flow [2023-09-01 11:23:45,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=808, PETRI_PLACES=94, PETRI_TRANSITIONS=93} [2023-09-01 11:23:45,826 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 47 predicate places. [2023-09-01 11:23:45,827 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 808 flow [2023-09-01 11:23:45,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 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-09-01 11:23:45,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:23:45,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:23:45,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 11:23:45,828 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-09-01 11:23:45,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:23:45,828 INFO L85 PathProgramCache]: Analyzing trace with hash -546670984, now seen corresponding path program 1 times [2023-09-01 11:23:45,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:23:45,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832461447] [2023-09-01 11:23:45,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:23:45,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:23:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:23:46,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:23:46,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:23:46,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832461447] [2023-09-01 11:23:46,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832461447] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:23:46,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:23:46,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 11:23:46,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117974172] [2023-09-01 11:23:46,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:23:46,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 11:23:46,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:23:46,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 11:23:46,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 11:23:46,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 313 [2023-09-01 11:23:46,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 93 transitions, 808 flow. Second operand has 5 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 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-09-01 11:23:46,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:23:46,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 313 [2023-09-01 11:23:46,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:23:46,378 INFO L130 PetriNetUnfolder]: 1271/2872 cut-off events. [2023-09-01 11:23:46,379 INFO L131 PetriNetUnfolder]: For 9106/9392 co-relation queries the response was YES. [2023-09-01 11:23:46,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10413 conditions, 2872 events. 1271/2872 cut-off events. For 9106/9392 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 21434 event pairs, 229 based on Foata normal form. 481/3239 useless extension candidates. Maximal degree in co-relation 10375. Up to 1674 conditions per place. [2023-09-01 11:23:46,398 INFO L137 encePairwiseOnDemand]: 303/313 looper letters, 53 selfloop transitions, 17 changer transitions 4/104 dead transitions. [2023-09-01 11:23:46,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 104 transitions, 974 flow [2023-09-01 11:23:46,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 11:23:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 11:23:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 596 transitions. [2023-09-01 11:23:46,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.476038338658147 [2023-09-01 11:23:46,401 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 596 transitions. [2023-09-01 11:23:46,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 596 transitions. [2023-09-01 11:23:46,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:23:46,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 596 transitions. [2023-09-01 11:23:46,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 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-09-01 11:23:46,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 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-09-01 11:23:46,406 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 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-09-01 11:23:46,406 INFO L175 Difference]: Start difference. First operand has 94 places, 93 transitions, 808 flow. Second operand 4 states and 596 transitions. [2023-09-01 11:23:46,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 104 transitions, 974 flow [2023-09-01 11:23:46,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 104 transitions, 909 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-09-01 11:23:46,445 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 678 flow [2023-09-01 11:23:46,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=678, PETRI_PLACES=92, PETRI_TRANSITIONS=85} [2023-09-01 11:23:46,446 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 45 predicate places. [2023-09-01 11:23:46,446 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 678 flow [2023-09-01 11:23:46,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 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-09-01 11:23:46,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:23:46,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:23:46,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 11:23:46,447 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-09-01 11:23:46,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:23:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash 392477943, now seen corresponding path program 1 times [2023-09-01 11:23:46,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:23:46,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859419992] [2023-09-01 11:23:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:23:46,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:23:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:23:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:23:46,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:23:46,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859419992] [2023-09-01 11:23:46,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859419992] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:23:46,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:23:46,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 11:23:46,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207388301] [2023-09-01 11:23:46,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:23:46,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 11:23:46,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:23:46,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 11:23:46,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-01 11:23:46,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 313 [2023-09-01 11:23:46,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 678 flow. Second operand has 6 states, 6 states have (on average 143.16666666666666) internal successors, (859), 6 states have internal predecessors, (859), 0 states have call successors, (0), 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-09-01 11:23:46,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:23:46,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 313 [2023-09-01 11:23:46,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:23:47,111 INFO L130 PetriNetUnfolder]: 1335/3024 cut-off events. [2023-09-01 11:23:47,112 INFO L131 PetriNetUnfolder]: For 7941/8144 co-relation queries the response was YES. [2023-09-01 11:23:47,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10897 conditions, 3024 events. 1335/3024 cut-off events. For 7941/8144 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 23006 event pairs, 208 based on Foata normal form. 179/3143 useless extension candidates. Maximal degree in co-relation 10860. Up to 1107 conditions per place. [2023-09-01 11:23:47,133 INFO L137 encePairwiseOnDemand]: 305/313 looper letters, 129 selfloop transitions, 39 changer transitions 11/199 dead transitions. [2023-09-01 11:23:47,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 199 transitions, 1664 flow [2023-09-01 11:23:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 11:23:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 11:23:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1961 transitions. [2023-09-01 11:23:47,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48193659375768 [2023-09-01 11:23:47,139 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1961 transitions. [2023-09-01 11:23:47,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1961 transitions. [2023-09-01 11:23:47,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:23:47,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1961 transitions. [2023-09-01 11:23:47,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 150.84615384615384) internal successors, (1961), 13 states have internal predecessors, (1961), 0 states have call successors, (0), 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-09-01 11:23:47,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 313.0) internal successors, (4382), 14 states have internal predecessors, (4382), 0 states have call successors, (0), 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-09-01 11:23:47,152 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 313.0) internal successors, (4382), 14 states have internal predecessors, (4382), 0 states have call successors, (0), 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-09-01 11:23:47,152 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 678 flow. Second operand 13 states and 1961 transitions. [2023-09-01 11:23:47,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 199 transitions, 1664 flow [2023-09-01 11:23:47,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 199 transitions, 1591 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-09-01 11:23:47,189 INFO L231 Difference]: Finished difference. Result has 106 places, 91 transitions, 844 flow [2023-09-01 11:23:47,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=844, PETRI_PLACES=106, PETRI_TRANSITIONS=91} [2023-09-01 11:23:47,190 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 59 predicate places. [2023-09-01 11:23:47,190 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 91 transitions, 844 flow [2023-09-01 11:23:47,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.16666666666666) internal successors, (859), 6 states have internal predecessors, (859), 0 states have call successors, (0), 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-09-01 11:23:47,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:23:47,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:23:47,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 11:23:47,192 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-09-01 11:23:47,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:23:47,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1974240727, now seen corresponding path program 1 times [2023-09-01 11:23:47,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:23:47,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922144840] [2023-09-01 11:23:47,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:23:47,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:23:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:23:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:23:47,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:23:47,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922144840] [2023-09-01 11:23:47,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922144840] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:23:47,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:23:47,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 11:23:47,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905091906] [2023-09-01 11:23:47,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:23:47,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 11:23:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:23:47,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 11:23:47,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-09-01 11:23:47,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 313 [2023-09-01 11:23:47,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 91 transitions, 844 flow. Second operand has 5 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 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-09-01 11:23:47,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:23:47,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 313 [2023-09-01 11:23:47,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:23:47,572 INFO L130 PetriNetUnfolder]: 297/1077 cut-off events. [2023-09-01 11:23:47,573 INFO L131 PetriNetUnfolder]: For 2194/2308 co-relation queries the response was YES. [2023-09-01 11:23:47,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 1077 events. 297/1077 cut-off events. For 2194/2308 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7726 event pairs, 119 based on Foata normal form. 57/1119 useless extension candidates. Maximal degree in co-relation 3734. Up to 480 conditions per place. [2023-09-01 11:23:47,579 INFO L137 encePairwiseOnDemand]: 302/313 looper letters, 37 selfloop transitions, 14 changer transitions 2/73 dead transitions. [2023-09-01 11:23:47,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 73 transitions, 661 flow [2023-09-01 11:23:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 11:23:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 11:23:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2023-09-01 11:23:47,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680511182108626 [2023-09-01 11:23:47,583 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2023-09-01 11:23:47,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2023-09-01 11:23:47,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:23:47,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2023-09-01 11:23:47,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 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-09-01 11:23:47,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 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-09-01 11:23:47,588 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 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-09-01 11:23:47,588 INFO L175 Difference]: Start difference. First operand has 106 places, 91 transitions, 844 flow. Second operand 4 states and 586 transitions. [2023-09-01 11:23:47,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 73 transitions, 661 flow [2023-09-01 11:23:47,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 73 transitions, 534 flow, removed 18 selfloop flow, removed 21 redundant places. [2023-09-01 11:23:47,599 INFO L231 Difference]: Finished difference. Result has 83 places, 64 transitions, 414 flow [2023-09-01 11:23:47,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=414, PETRI_PLACES=83, PETRI_TRANSITIONS=64} [2023-09-01 11:23:47,602 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 36 predicate places. [2023-09-01 11:23:47,602 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 414 flow [2023-09-01 11:23:47,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 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-09-01 11:23:47,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:23:47,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:23:47,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 11:23:47,603 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-09-01 11:23:47,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:23:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1373040322, now seen corresponding path program 1 times [2023-09-01 11:23:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:23:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971830288] [2023-09-01 11:23:47,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:23:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:23:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:23:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:23:47,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:23:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971830288] [2023-09-01 11:23:47,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971830288] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:23:47,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:23:47,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 11:23:47,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841231446] [2023-09-01 11:23:47,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:23:47,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 11:23:47,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:23:47,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 11:23:47,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-01 11:23:47,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 313 [2023-09-01 11:23:47,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 0 states have call successors, (0), 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-09-01 11:23:47,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:23:47,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 313 [2023-09-01 11:23:47,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:23:48,177 INFO L130 PetriNetUnfolder]: 336/1166 cut-off events. [2023-09-01 11:23:48,177 INFO L131 PetriNetUnfolder]: For 1519/1570 co-relation queries the response was YES. [2023-09-01 11:23:48,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3901 conditions, 1166 events. 336/1166 cut-off events. For 1519/1570 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8242 event pairs, 87 based on Foata normal form. 24/1164 useless extension candidates. Maximal degree in co-relation 3872. Up to 321 conditions per place. [2023-09-01 11:23:48,184 INFO L137 encePairwiseOnDemand]: 306/313 looper letters, 63 selfloop transitions, 15 changer transitions 31/125 dead transitions. [2023-09-01 11:23:48,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 125 transitions, 957 flow [2023-09-01 11:23:48,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 11:23:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 11:23:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1763 transitions. [2023-09-01 11:23:48,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4693823216187433 [2023-09-01 11:23:48,190 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1763 transitions. [2023-09-01 11:23:48,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1763 transitions. [2023-09-01 11:23:48,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:23:48,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1763 transitions. [2023-09-01 11:23:48,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 146.91666666666666) internal successors, (1763), 12 states have internal predecessors, (1763), 0 states have call successors, (0), 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-09-01 11:23:48,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 313.0) internal successors, (4069), 13 states have internal predecessors, (4069), 0 states have call successors, (0), 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-09-01 11:23:48,201 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 313.0) internal successors, (4069), 13 states have internal predecessors, (4069), 0 states have call successors, (0), 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-09-01 11:23:48,202 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 414 flow. Second operand 12 states and 1763 transitions. [2023-09-01 11:23:48,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 125 transitions, 957 flow [2023-09-01 11:23:48,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 125 transitions, 912 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-09-01 11:23:48,208 INFO L231 Difference]: Finished difference. Result has 90 places, 54 transitions, 335 flow [2023-09-01 11:23:48,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=335, PETRI_PLACES=90, PETRI_TRANSITIONS=54} [2023-09-01 11:23:48,209 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2023-09-01 11:23:48,209 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 54 transitions, 335 flow [2023-09-01 11:23:48,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 0 states have call successors, (0), 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-09-01 11:23:48,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:23:48,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:23:48,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 11:23:48,211 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-09-01 11:23:48,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:23:48,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2055360479, now seen corresponding path program 1 times [2023-09-01 11:23:48,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:23:48,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771480427] [2023-09-01 11:23:48,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:23:48,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:23:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:23:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:23:48,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:23:48,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771480427] [2023-09-01 11:23:48,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771480427] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:23:48,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:23:48,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 11:23:48,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391444698] [2023-09-01 11:23:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:23:48,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 11:23:48,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:23:48,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 11:23:48,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-01 11:23:48,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 313 [2023-09-01 11:23:48,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 54 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 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-09-01 11:23:48,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:23:48,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 313 [2023-09-01 11:23:48,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:23:48,573 INFO L130 PetriNetUnfolder]: 181/647 cut-off events. [2023-09-01 11:23:48,574 INFO L131 PetriNetUnfolder]: For 824/866 co-relation queries the response was YES. [2023-09-01 11:23:48,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2028 conditions, 647 events. 181/647 cut-off events. For 824/866 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3843 event pairs, 77 based on Foata normal form. 29/657 useless extension candidates. Maximal degree in co-relation 2014. Up to 237 conditions per place. [2023-09-01 11:23:48,576 INFO L137 encePairwiseOnDemand]: 307/313 looper letters, 0 selfloop transitions, 0 changer transitions 75/75 dead transitions. [2023-09-01 11:23:48,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 75 transitions, 524 flow [2023-09-01 11:23:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 11:23:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 11:23:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1034 transitions. [2023-09-01 11:23:48,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47193062528525787 [2023-09-01 11:23:48,580 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1034 transitions. [2023-09-01 11:23:48,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1034 transitions. [2023-09-01 11:23:48,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:23:48,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1034 transitions. [2023-09-01 11:23:48,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 147.71428571428572) internal successors, (1034), 7 states have internal predecessors, (1034), 0 states have call successors, (0), 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-09-01 11:23:48,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 313.0) internal successors, (2504), 8 states have internal predecessors, (2504), 0 states have call successors, (0), 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-09-01 11:23:48,587 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 313.0) internal successors, (2504), 8 states have internal predecessors, (2504), 0 states have call successors, (0), 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-09-01 11:23:48,587 INFO L175 Difference]: Start difference. First operand has 90 places, 54 transitions, 335 flow. Second operand 7 states and 1034 transitions. [2023-09-01 11:23:48,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 75 transitions, 524 flow [2023-09-01 11:23:48,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 477 flow, removed 5 selfloop flow, removed 11 redundant places. [2023-09-01 11:23:48,591 INFO L231 Difference]: Finished difference. Result has 79 places, 0 transitions, 0 flow [2023-09-01 11:23:48,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=79, PETRI_TRANSITIONS=0} [2023-09-01 11:23:48,591 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2023-09-01 11:23:48,591 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 0 transitions, 0 flow [2023-09-01 11:23:48,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 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-09-01 11:23:48,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-09-01 11:23:48,595 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-09-01 11:23:48,595 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-09-01 11:23:48,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2023-09-01 11:23:48,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2023-09-01 11:23:48,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2023-09-01 11:23:48,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-09-01 11:23:48,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-09-01 11:23:48,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-09-01 11:23:48,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 11:23:48,597 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:23:48,602 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 11:23:48,602 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 11:23:48,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 11:23:48 BasicIcfg [2023-09-01 11:23:48,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 11:23:48,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 11:23:48,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 11:23:48,606 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 11:23:48,606 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 11:23:34" (3/4) ... [2023-09-01 11:23:48,608 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-09-01 11:23:48,613 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2_fun [2023-09-01 11:23:48,614 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t3_fun [2023-09-01 11:23:48,614 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2023-09-01 11:23:48,618 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-09-01 11:23:48,618 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-09-01 11:23:48,618 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-09-01 11:23:48,618 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-09-01 11:23:48,654 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 11:23:48,654 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 11:23:48,655 INFO L158 Benchmark]: Toolchain (without parser) took 15150.71ms. Allocated memory was 69.2MB in the beginning and 2.0GB in the end (delta: 2.0GB). Free memory was 46.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 319.6MB. Max. memory is 16.1GB. [2023-09-01 11:23:48,655 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 11:23:48,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.44ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 42.9MB in the end (delta: 3.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-09-01 11:23:48,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.54ms. Allocated memory is still 69.2MB. Free memory was 42.9MB in the beginning and 40.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 11:23:48,656 INFO L158 Benchmark]: Boogie Preprocessor took 23.58ms. Allocated memory is still 69.2MB. Free memory was 40.5MB in the beginning and 39.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 11:23:48,656 INFO L158 Benchmark]: RCFGBuilder took 475.46ms. Allocated memory is still 69.2MB. Free memory was 39.0MB in the beginning and 39.4MB in the end (delta: -369.7kB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2023-09-01 11:23:48,657 INFO L158 Benchmark]: TraceAbstraction took 14095.47ms. Allocated memory was 69.2MB in the beginning and 2.0GB in the end (delta: 2.0GB). Free memory was 38.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 306.1MB. Max. memory is 16.1GB. [2023-09-01 11:23:48,657 INFO L158 Benchmark]: Witness Printer took 48.91ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 11:23:48,659 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.28ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.44ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 42.9MB in the end (delta: 3.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.54ms. Allocated memory is still 69.2MB. Free memory was 42.9MB in the beginning and 40.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.58ms. Allocated memory is still 69.2MB. Free memory was 40.5MB in the beginning and 39.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 475.46ms. Allocated memory is still 69.2MB. Free memory was 39.0MB in the beginning and 39.4MB in the end (delta: -369.7kB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14095.47ms. Allocated memory was 69.2MB in the beginning and 2.0GB in the end (delta: 2.0GB). Free memory was 38.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 306.1MB. Max. memory is 16.1GB. * Witness Printer took 48.91ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 164 PlacesBefore, 47 PlacesAfterwards, 159 TransitionsBefore, 39 TransitionsAfterwards, 9270 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 91 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 19 ConcurrentYvCompositions, 3 ChoiceCompositions, 151 TotalNumberOfCompositions, 20940 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10029, independent: 9648, independent conditional: 0, independent unconditional: 9648, dependent: 381, dependent conditional: 0, dependent unconditional: 381, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5199, independent: 5132, independent conditional: 0, independent unconditional: 5132, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10029, independent: 4516, independent conditional: 0, independent unconditional: 4516, dependent: 314, dependent conditional: 0, dependent unconditional: 314, unknown: 5199, unknown conditional: 0, unknown unconditional: 5199] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 233 locations, 9 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: 14.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1119 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 893 mSDsluCounter, 247 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 204 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2264 IncrementalHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 43 mSDtfsCounter, 2264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=844occurred in iteration=7, InterpolantAutomatonStates: 74, 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.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 675 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-09-01 11:23:48,692 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 Result: TRUE