./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:52:59,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:52:59,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:52:59,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:52:59,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:52:59,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:52:59,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:52:59,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:52:59,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:52:59,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:52:59,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:52:59,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:52:59,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:52:59,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:52:59,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:52:59,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:52:59,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:52:59,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:52:59,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:52:59,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:52:59,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:52:59,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:52:59,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:52:59,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:52:59,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:52:59,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:52:59,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:52:59,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:52:59,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:52:59,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:52:59,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:52:59,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:52:59,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:52:59,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:52:59,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:52:59,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:52:59,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:52:59,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:52:59,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:52:59,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:52:59,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:52:59,225 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:52:59,274 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:52:59,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:52:59,275 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:52:59,275 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:52:59,276 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:52:59,276 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:52:59,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:52:59,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:52:59,277 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:52:59,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:52:59,278 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:52:59,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:52:59,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:52:59,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:52:59,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:52:59,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:52:59,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:52:59,279 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:52:59,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:52:59,280 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:52:59,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:52:59,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:52:59,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:52:59,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:52:59,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:52:59,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:52:59,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:52:59,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:52:59,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:52:59,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:52:59,281 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:52:59,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:52:59,282 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:52:59,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:52:59,282 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:52:59,282 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 -> 649d1c1aa65cb6010503451d39379fb2c9cafcc7e0f5f23661f58b5d14c46288 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 16:52:59,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:52:59,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:52:59,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:52:59,682 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:52:59,683 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:52:59,684 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:53:00,575 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:53:00,825 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:53:00,825 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:53:00,834 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b80677107/d052ad88304a497b843b99d323961d45/FLAG4f6c930d2 [2023-08-30 16:53:00,847 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b80677107/d052ad88304a497b843b99d323961d45 [2023-08-30 16:53:00,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:53:00,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:53:00,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:53:00,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:53:00,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:53:00,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:53:00" (1/1) ... [2023-08-30 16:53:00,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33860ff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:00, skipping insertion in model container [2023-08-30 16:53:00,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:53:00" (1/1) ... [2023-08-30 16:53:00,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:53:00,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:53:00,992 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 16:53:01,169 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:53:01,182 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:53:01,224 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-30 16:53:01,271 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:53:01,297 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:53:01,297 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:53:01,302 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:53:01,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:01 WrapperNode [2023-08-30 16:53:01,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:53:01,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:53:01,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:53:01,304 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:53:01,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:01" (1/1) ... [2023-08-30 16:53:01,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:01" (1/1) ... [2023-08-30 16:53:01,340 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2023-08-30 16:53:01,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:53:01,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:53:01,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:53:01,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:53:01,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:01" (1/1) ... [2023-08-30 16:53:01,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:01" (1/1) ... [2023-08-30 16:53:01,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:01" (1/1) ... [2023-08-30 16:53:01,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:01" (1/1) ... [2023-08-30 16:53:01,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:01" (1/1) ... [2023-08-30 16:53:01,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:01" (1/1) ... [2023-08-30 16:53:01,373 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:01" (1/1) ... [2023-08-30 16:53:01,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:01" (1/1) ... [2023-08-30 16:53:01,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:53:01,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:53:01,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:53:01,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:53:01,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:01" (1/1) ... [2023-08-30 16:53:01,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:53:01,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:53:01,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:53:01,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:53:01,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:53:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:53:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:53:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:53:01,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:53:01,480 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:53:01,480 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:53:01,480 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:53:01,481 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:53:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:53:01,481 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:53:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:53:01,481 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:53:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:53:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:53:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:53:01,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:53:01,483 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:53:01,592 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:53:01,594 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:53:01,857 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:53:01,979 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:53:01,980 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:53:01,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:53:01 BoogieIcfgContainer [2023-08-30 16:53:01,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:53:01,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:53:01,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:53:01,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:53:01,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:53:00" (1/3) ... [2023-08-30 16:53:01,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6733c637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:53:01, skipping insertion in model container [2023-08-30 16:53:01,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:53:01" (2/3) ... [2023-08-30 16:53:01,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6733c637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:53:01, skipping insertion in model container [2023-08-30 16:53:01,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:53:01" (3/3) ... [2023-08-30 16:53:01,987 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-30 16:53:01,992 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:53:01,999 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:53:01,999 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:53:01,999 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:53:02,057 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:53:02,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2023-08-30 16:53:02,152 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2023-08-30 16:53:02,152 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:53:02,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-30 16:53:02,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 127 transitions, 274 flow [2023-08-30 16:53:02,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 123 transitions, 258 flow [2023-08-30 16:53:02,165 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:53:02,173 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 123 transitions, 258 flow [2023-08-30 16:53:02,175 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 123 transitions, 258 flow [2023-08-30 16:53:02,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 123 transitions, 258 flow [2023-08-30 16:53:02,193 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2023-08-30 16:53:02,198 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:53:02,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-30 16:53:02,202 INFO L119 LiptonReduction]: Number of co-enabled transitions 3058 [2023-08-30 16:53:05,155 INFO L134 LiptonReduction]: Checked pairs total: 7750 [2023-08-30 16:53:05,155 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-30 16:53:05,168 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:53:05,172 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;@10d0d4a4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:53:05,173 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:53:05,175 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-30 16:53:05,175 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:53:05,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:05,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 16:53:05,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:05,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:05,189 INFO L85 PathProgramCache]: Analyzing trace with hash 536872, now seen corresponding path program 1 times [2023-08-30 16:53:05,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:05,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456357306] [2023-08-30 16:53:05,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:05,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:05,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456357306] [2023-08-30 16:53:05,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456357306] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:05,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:05,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:53:05,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354674284] [2023-08-30 16:53:05,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:05,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:53:05,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:05,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:53:05,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:53:05,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 232 [2023-08-30 16:53:05,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:05,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:05,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 232 [2023-08-30 16:53:05,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:06,233 INFO L130 PetriNetUnfolder]: 4903/6905 cut-off events. [2023-08-30 16:53:06,233 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-08-30 16:53:06,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13753 conditions, 6905 events. 4903/6905 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 36553 event pairs, 1327 based on Foata normal form. 0/6579 useless extension candidates. Maximal degree in co-relation 13741. Up to 5335 conditions per place. [2023-08-30 16:53:06,260 INFO L137 encePairwiseOnDemand]: 228/232 looper letters, 41 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-08-30 16:53:06,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 207 flow [2023-08-30 16:53:06,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:53:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:53:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-08-30 16:53:06,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5474137931034483 [2023-08-30 16:53:06,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-08-30 16:53:06,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-08-30 16:53:06,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:06,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-08-30 16:53:06,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:06,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:06,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:06,280 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 381 transitions. [2023-08-30 16:53:06,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 207 flow [2023-08-30 16:53:06,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:53:06,284 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-08-30 16:53:06,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-30 16:53:06,287 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-30 16:53:06,288 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-08-30 16:53:06,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:06,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:06,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:06,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:53:06,289 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:06,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:06,289 INFO L85 PathProgramCache]: Analyzing trace with hash 66116117, now seen corresponding path program 1 times [2023-08-30 16:53:06,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:06,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480584796] [2023-08-30 16:53:06,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:06,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:06,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:06,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480584796] [2023-08-30 16:53:06,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480584796] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:06,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:06,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:53:06,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257018559] [2023-08-30 16:53:06,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:06,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:53:06,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:06,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:53:06,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:53:06,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 232 [2023-08-30 16:53:06,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:06,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:06,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 232 [2023-08-30 16:53:06,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:08,055 INFO L130 PetriNetUnfolder]: 13530/18448 cut-off events. [2023-08-30 16:53:08,055 INFO L131 PetriNetUnfolder]: For 932/932 co-relation queries the response was YES. [2023-08-30 16:53:08,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38229 conditions, 18448 events. 13530/18448 cut-off events. For 932/932 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 95824 event pairs, 5412 based on Foata normal form. 587/19035 useless extension candidates. Maximal degree in co-relation 38219. Up to 9251 conditions per place. [2023-08-30 16:53:08,119 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 41 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2023-08-30 16:53:08,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2023-08-30 16:53:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:53:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:53:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-08-30 16:53:08,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5114942528735632 [2023-08-30 16:53:08,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-08-30 16:53:08,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-08-30 16:53:08,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:08,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-08-30 16:53:08,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:08,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:08,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:08,129 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 356 transitions. [2023-08-30 16:53:08,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2023-08-30 16:53:08,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:53:08,131 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 124 flow [2023-08-30 16:53:08,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-08-30 16:53:08,132 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-08-30 16:53:08,132 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 124 flow [2023-08-30 16:53:08,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:08,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:08,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:08,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:53:08,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:08,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:08,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2049597403, now seen corresponding path program 1 times [2023-08-30 16:53:08,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:08,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654922318] [2023-08-30 16:53:08,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:08,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:08,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:08,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654922318] [2023-08-30 16:53:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654922318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:08,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:08,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:53:08,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869596209] [2023-08-30 16:53:08,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:08,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:53:08,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:08,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:53:08,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:53:08,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 232 [2023-08-30 16:53:08,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 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-08-30 16:53:08,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:08,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 232 [2023-08-30 16:53:08,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:09,708 INFO L130 PetriNetUnfolder]: 13208/18015 cut-off events. [2023-08-30 16:53:09,709 INFO L131 PetriNetUnfolder]: For 6874/6874 co-relation queries the response was YES. [2023-08-30 16:53:09,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46391 conditions, 18015 events. 13208/18015 cut-off events. For 6874/6874 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 94125 event pairs, 1386 based on Foata normal form. 45/18060 useless extension candidates. Maximal degree in co-relation 46379. Up to 8772 conditions per place. [2023-08-30 16:53:09,792 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 58 selfloop transitions, 12 changer transitions 0/70 dead transitions. [2023-08-30 16:53:09,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 70 transitions, 378 flow [2023-08-30 16:53:09,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:53:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:53:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2023-08-30 16:53:09,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509698275862069 [2023-08-30 16:53:09,794 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 473 transitions. [2023-08-30 16:53:09,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions. [2023-08-30 16:53:09,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:09,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions. [2023-08-30 16:53:09,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:09,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:09,798 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:09,798 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 124 flow. Second operand 4 states and 473 transitions. [2023-08-30 16:53:09,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 70 transitions, 378 flow [2023-08-30 16:53:09,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 70 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:53:09,816 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 202 flow [2023-08-30 16:53:09,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2023-08-30 16:53:09,817 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-30 16:53:09,819 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 202 flow [2023-08-30 16:53:09,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 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-08-30 16:53:09,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:09,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:09,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:53:09,821 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:09,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:09,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2049598643, now seen corresponding path program 1 times [2023-08-30 16:53:09,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:09,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258143190] [2023-08-30 16:53:09,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:09,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:10,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:10,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258143190] [2023-08-30 16:53:10,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258143190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:10,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:10,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:53:10,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843128160] [2023-08-30 16:53:10,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:10,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:53:10,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:10,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:53:10,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:53:10,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 232 [2023-08-30 16:53:10,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 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-08-30 16:53:10,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:10,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 232 [2023-08-30 16:53:10,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:11,309 INFO L130 PetriNetUnfolder]: 12977/17705 cut-off events. [2023-08-30 16:53:11,309 INFO L131 PetriNetUnfolder]: For 15766/15766 co-relation queries the response was YES. [2023-08-30 16:53:11,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50069 conditions, 17705 events. 12977/17705 cut-off events. For 15766/15766 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 91987 event pairs, 2500 based on Foata normal form. 34/17739 useless extension candidates. Maximal degree in co-relation 50054. Up to 8637 conditions per place. [2023-08-30 16:53:11,379 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 64 selfloop transitions, 20 changer transitions 0/84 dead transitions. [2023-08-30 16:53:11,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 526 flow [2023-08-30 16:53:11,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:53:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:53:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2023-08-30 16:53:11,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140086206896551 [2023-08-30 16:53:11,381 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 477 transitions. [2023-08-30 16:53:11,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 477 transitions. [2023-08-30 16:53:11,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:11,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 477 transitions. [2023-08-30 16:53:11,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:11,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:11,385 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:11,385 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 202 flow. Second operand 4 states and 477 transitions. [2023-08-30 16:53:11,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 526 flow [2023-08-30 16:53:11,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 526 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:53:11,418 INFO L231 Difference]: Finished difference. Result has 50 places, 53 transitions, 372 flow [2023-08-30 16:53:11,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=372, PETRI_PLACES=50, PETRI_TRANSITIONS=53} [2023-08-30 16:53:11,419 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-08-30 16:53:11,419 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 53 transitions, 372 flow [2023-08-30 16:53:11,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 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-08-30 16:53:11,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:11,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:11,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:53:11,420 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:11,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash -886990931, now seen corresponding path program 1 times [2023-08-30 16:53:11,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:11,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504016919] [2023-08-30 16:53:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:11,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:11,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:11,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504016919] [2023-08-30 16:53:11,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504016919] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:11,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:11,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:53:11,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224147555] [2023-08-30 16:53:11,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:11,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:53:11,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:11,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:53:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:53:11,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 232 [2023-08-30 16:53:11,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 53 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:11,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:11,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 232 [2023-08-30 16:53:11,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:12,729 INFO L130 PetriNetUnfolder]: 12813/17485 cut-off events. [2023-08-30 16:53:12,730 INFO L131 PetriNetUnfolder]: For 38763/38763 co-relation queries the response was YES. [2023-08-30 16:53:12,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56953 conditions, 17485 events. 12813/17485 cut-off events. For 38763/38763 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 89328 event pairs, 965 based on Foata normal form. 23/17508 useless extension candidates. Maximal degree in co-relation 56933. Up to 8175 conditions per place. [2023-08-30 16:53:12,793 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 70 selfloop transitions, 26 changer transitions 0/96 dead transitions. [2023-08-30 16:53:12,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 808 flow [2023-08-30 16:53:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:53:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:53:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-08-30 16:53:12,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075431034482759 [2023-08-30 16:53:12,795 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-08-30 16:53:12,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-08-30 16:53:12,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:12,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-08-30 16:53:12,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:12,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:12,798 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:12,798 INFO L175 Difference]: Start difference. First operand has 50 places, 53 transitions, 372 flow. Second operand 4 states and 471 transitions. [2023-08-30 16:53:12,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 808 flow [2023-08-30 16:53:12,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 96 transitions, 808 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:53:12,847 INFO L231 Difference]: Finished difference. Result has 56 places, 67 transitions, 646 flow [2023-08-30 16:53:12,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=646, PETRI_PLACES=56, PETRI_TRANSITIONS=67} [2023-08-30 16:53:12,849 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-08-30 16:53:12,849 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 67 transitions, 646 flow [2023-08-30 16:53:12,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:12,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:12,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:12,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:53:12,850 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:12,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:12,850 INFO L85 PathProgramCache]: Analyzing trace with hash -895556240, now seen corresponding path program 1 times [2023-08-30 16:53:12,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:12,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489573435] [2023-08-30 16:53:12,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:12,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:12,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:12,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489573435] [2023-08-30 16:53:12,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489573435] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:12,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:12,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:53:12,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626063903] [2023-08-30 16:53:12,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:12,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:53:12,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:13,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:53:13,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:53:13,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 232 [2023-08-30 16:53:13,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 67 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:13,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:13,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 232 [2023-08-30 16:53:13,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:14,650 INFO L130 PetriNetUnfolder]: 15003/21263 cut-off events. [2023-08-30 16:53:14,650 INFO L131 PetriNetUnfolder]: For 76796/78085 co-relation queries the response was YES. [2023-08-30 16:53:14,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70037 conditions, 21263 events. 15003/21263 cut-off events. For 76796/78085 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 126042 event pairs, 6952 based on Foata normal form. 761/21739 useless extension candidates. Maximal degree in co-relation 70012. Up to 11557 conditions per place. [2023-08-30 16:53:14,728 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 62 selfloop transitions, 8 changer transitions 1/86 dead transitions. [2023-08-30 16:53:14,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 874 flow [2023-08-30 16:53:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:53:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:53:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-08-30 16:53:14,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5330459770114943 [2023-08-30 16:53:14,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-08-30 16:53:14,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-08-30 16:53:14,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:14,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-08-30 16:53:14,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:14,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:14,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:14,733 INFO L175 Difference]: Start difference. First operand has 56 places, 67 transitions, 646 flow. Second operand 3 states and 371 transitions. [2023-08-30 16:53:14,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 874 flow [2023-08-30 16:53:14,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 86 transitions, 874 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:53:14,814 INFO L231 Difference]: Finished difference. Result has 59 places, 66 transitions, 658 flow [2023-08-30 16:53:14,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=59, PETRI_TRANSITIONS=66} [2023-08-30 16:53:14,815 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2023-08-30 16:53:14,815 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 66 transitions, 658 flow [2023-08-30 16:53:14,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:14,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:14,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:14,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:53:14,816 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:14,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:14,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1952096043, now seen corresponding path program 1 times [2023-08-30 16:53:14,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:14,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878627500] [2023-08-30 16:53:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:14,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:14,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:14,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:14,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878627500] [2023-08-30 16:53:14,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878627500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:14,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:14,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:53:14,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725396458] [2023-08-30 16:53:14,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:14,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:53:14,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:14,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:53:14,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:53:14,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 232 [2023-08-30 16:53:14,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 66 transitions, 658 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:14,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:14,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 232 [2023-08-30 16:53:14,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:16,636 INFO L130 PetriNetUnfolder]: 11584/17281 cut-off events. [2023-08-30 16:53:16,636 INFO L131 PetriNetUnfolder]: For 66816/68682 co-relation queries the response was YES. [2023-08-30 16:53:16,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55324 conditions, 17281 events. 11584/17281 cut-off events. For 66816/68682 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 112999 event pairs, 1850 based on Foata normal form. 2172/19327 useless extension candidates. Maximal degree in co-relation 55297. Up to 10934 conditions per place. [2023-08-30 16:53:16,691 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 142 selfloop transitions, 10 changer transitions 0/172 dead transitions. [2023-08-30 16:53:16,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 172 transitions, 1941 flow [2023-08-30 16:53:16,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:53:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:53:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-08-30 16:53:16,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189655172413793 [2023-08-30 16:53:16,693 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-08-30 16:53:16,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-08-30 16:53:16,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:16,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-08-30 16:53:16,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:16,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:16,696 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:16,697 INFO L175 Difference]: Start difference. First operand has 59 places, 66 transitions, 658 flow. Second operand 5 states and 602 transitions. [2023-08-30 16:53:16,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 172 transitions, 1941 flow [2023-08-30 16:53:16,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 172 transitions, 1916 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 16:53:16,726 INFO L231 Difference]: Finished difference. Result has 65 places, 75 transitions, 723 flow [2023-08-30 16:53:16,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=723, PETRI_PLACES=65, PETRI_TRANSITIONS=75} [2023-08-30 16:53:16,727 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2023-08-30 16:53:16,727 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 75 transitions, 723 flow [2023-08-30 16:53:16,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:16,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:16,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:16,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:53:16,728 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:16,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:16,728 INFO L85 PathProgramCache]: Analyzing trace with hash 609941078, now seen corresponding path program 1 times [2023-08-30 16:53:16,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:16,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458052484] [2023-08-30 16:53:16,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:16,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:16,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:16,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458052484] [2023-08-30 16:53:16,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458052484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:16,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:16,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:53:16,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924199473] [2023-08-30 16:53:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:16,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:53:16,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:16,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:53:16,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:53:16,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 232 [2023-08-30 16:53:16,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 75 transitions, 723 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:16,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:16,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 232 [2023-08-30 16:53:16,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:19,374 INFO L130 PetriNetUnfolder]: 21057/30324 cut-off events. [2023-08-30 16:53:19,375 INFO L131 PetriNetUnfolder]: For 130027/130027 co-relation queries the response was YES. [2023-08-30 16:53:19,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123893 conditions, 30324 events. 21057/30324 cut-off events. For 130027/130027 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 193596 event pairs, 3324 based on Foata normal form. 165/30489 useless extension candidates. Maximal degree in co-relation 123862. Up to 13484 conditions per place. [2023-08-30 16:53:19,695 INFO L137 encePairwiseOnDemand]: 223/232 looper letters, 78 selfloop transitions, 34 changer transitions 20/132 dead transitions. [2023-08-30 16:53:19,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 132 transitions, 1315 flow [2023-08-30 16:53:19,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:53:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:53:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-08-30 16:53:19,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129310344827587 [2023-08-30 16:53:19,699 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-08-30 16:53:19,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-08-30 16:53:19,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:19,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-08-30 16:53:19,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:19,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:19,702 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:19,702 INFO L175 Difference]: Start difference. First operand has 65 places, 75 transitions, 723 flow. Second operand 4 states and 476 transitions. [2023-08-30 16:53:19,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 132 transitions, 1315 flow [2023-08-30 16:53:19,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 132 transitions, 1302 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:53:19,863 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 872 flow [2023-08-30 16:53:19,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=872, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2023-08-30 16:53:19,864 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2023-08-30 16:53:19,864 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 872 flow [2023-08-30 16:53:19,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:19,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:19,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:19,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:53:19,865 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:19,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1867967024, now seen corresponding path program 1 times [2023-08-30 16:53:19,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:19,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017664700] [2023-08-30 16:53:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:19,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:19,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017664700] [2023-08-30 16:53:19,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017664700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:19,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:19,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:53:19,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712921170] [2023-08-30 16:53:19,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:19,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:53:19,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:19,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:53:19,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:53:19,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 232 [2023-08-30 16:53:19,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:19,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:19,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 232 [2023-08-30 16:53:19,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:22,413 INFO L130 PetriNetUnfolder]: 19168/28502 cut-off events. [2023-08-30 16:53:22,413 INFO L131 PetriNetUnfolder]: For 136788/137356 co-relation queries the response was YES. [2023-08-30 16:53:22,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112298 conditions, 28502 events. 19168/28502 cut-off events. For 136788/137356 co-relation queries the response was YES. Maximal size of possible extension queue 1449. Compared 194526 event pairs, 9804 based on Foata normal form. 561/28745 useless extension candidates. Maximal degree in co-relation 112263. Up to 14730 conditions per place. [2023-08-30 16:53:22,531 INFO L137 encePairwiseOnDemand]: 229/232 looper letters, 71 selfloop transitions, 13 changer transitions 8/102 dead transitions. [2023-08-30 16:53:22,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 102 transitions, 1276 flow [2023-08-30 16:53:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:53:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:53:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-08-30 16:53:22,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5359195402298851 [2023-08-30 16:53:22,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-08-30 16:53:22,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-08-30 16:53:22,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:22,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-08-30 16:53:22,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:22,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:22,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:22,544 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 872 flow. Second operand 3 states and 373 transitions. [2023-08-30 16:53:22,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 102 transitions, 1276 flow [2023-08-30 16:53:23,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 1270 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-30 16:53:23,103 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 847 flow [2023-08-30 16:53:23,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2023-08-30 16:53:23,104 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2023-08-30 16:53:23,104 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 847 flow [2023-08-30 16:53:23,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:23,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:23,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:23,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:53:23,105 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:23,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:23,106 INFO L85 PathProgramCache]: Analyzing trace with hash 827962045, now seen corresponding path program 1 times [2023-08-30 16:53:23,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:23,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196950179] [2023-08-30 16:53:23,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:23,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:23,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:23,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196950179] [2023-08-30 16:53:23,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196950179] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:23,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:23,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:53:23,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612346237] [2023-08-30 16:53:23,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:23,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:53:23,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:23,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:53:23,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:53:23,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 232 [2023-08-30 16:53:23,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 847 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:23,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:23,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 232 [2023-08-30 16:53:23,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:25,700 INFO L130 PetriNetUnfolder]: 13400/20809 cut-off events. [2023-08-30 16:53:25,700 INFO L131 PetriNetUnfolder]: For 89633/90369 co-relation queries the response was YES. [2023-08-30 16:53:25,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77975 conditions, 20809 events. 13400/20809 cut-off events. For 89633/90369 co-relation queries the response was YES. Maximal size of possible extension queue 1159. Compared 150114 event pairs, 1680 based on Foata normal form. 2446/22915 useless extension candidates. Maximal degree in co-relation 77939. Up to 8608 conditions per place. [2023-08-30 16:53:25,824 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 154 selfloop transitions, 14 changer transitions 8/193 dead transitions. [2023-08-30 16:53:25,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 193 transitions, 2625 flow [2023-08-30 16:53:25,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:53:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:53:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 725 transitions. [2023-08-30 16:53:25,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2023-08-30 16:53:25,826 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 725 transitions. [2023-08-30 16:53:25,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 725 transitions. [2023-08-30 16:53:25,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:25,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 725 transitions. [2023-08-30 16:53:25,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:25,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:25,831 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:25,831 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 847 flow. Second operand 6 states and 725 transitions. [2023-08-30 16:53:25,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 193 transitions, 2625 flow [2023-08-30 16:53:25,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 193 transitions, 2582 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-30 16:53:25,876 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 952 flow [2023-08-30 16:53:25,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=952, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2023-08-30 16:53:25,876 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2023-08-30 16:53:25,877 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 952 flow [2023-08-30 16:53:25,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:25,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:25,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:25,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:53:25,877 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:25,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash -64067320, now seen corresponding path program 1 times [2023-08-30 16:53:25,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:25,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236853583] [2023-08-30 16:53:25,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:26,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:26,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236853583] [2023-08-30 16:53:26,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236853583] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:26,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:26,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:53:26,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112413312] [2023-08-30 16:53:26,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:26,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:53:26,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:26,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:53:26,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:53:26,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 232 [2023-08-30 16:53:26,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 952 flow. Second operand has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:26,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:26,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 232 [2023-08-30 16:53:26,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:27,899 INFO L130 PetriNetUnfolder]: 11916/18636 cut-off events. [2023-08-30 16:53:27,899 INFO L131 PetriNetUnfolder]: For 94648/95354 co-relation queries the response was YES. [2023-08-30 16:53:27,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83515 conditions, 18636 events. 11916/18636 cut-off events. For 94648/95354 co-relation queries the response was YES. Maximal size of possible extension queue 1082. Compared 134418 event pairs, 1238 based on Foata normal form. 1239/19547 useless extension candidates. Maximal degree in co-relation 83475. Up to 8051 conditions per place. [2023-08-30 16:53:27,989 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 113 selfloop transitions, 14 changer transitions 90/232 dead transitions. [2023-08-30 16:53:27,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 232 transitions, 3132 flow [2023-08-30 16:53:27,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:53:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:53:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 966 transitions. [2023-08-30 16:53:27,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204741379310345 [2023-08-30 16:53:27,992 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 966 transitions. [2023-08-30 16:53:27,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 966 transitions. [2023-08-30 16:53:27,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:27,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 966 transitions. [2023-08-30 16:53:27,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.75) internal successors, (966), 8 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:27,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:27,997 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:27,997 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 952 flow. Second operand 8 states and 966 transitions. [2023-08-30 16:53:27,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 232 transitions, 3132 flow [2023-08-30 16:53:30,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 232 transitions, 3088 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-30 16:53:30,679 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 890 flow [2023-08-30 16:53:30,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=890, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2023-08-30 16:53:30,680 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2023-08-30 16:53:30,680 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 890 flow [2023-08-30 16:53:30,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:30,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:30,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:30,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:53:30,681 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:30,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:30,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2141899810, now seen corresponding path program 1 times [2023-08-30 16:53:30,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:30,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181292318] [2023-08-30 16:53:30,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:30,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:31,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:31,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:31,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181292318] [2023-08-30 16:53:31,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181292318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:31,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:31,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:53:31,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725218966] [2023-08-30 16:53:31,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:31,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:53:31,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:31,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:53:31,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:53:31,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 232 [2023-08-30 16:53:31,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 890 flow. Second operand has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:31,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:31,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 232 [2023-08-30 16:53:31,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:32,137 INFO L130 PetriNetUnfolder]: 6905/10960 cut-off events. [2023-08-30 16:53:32,137 INFO L131 PetriNetUnfolder]: For 61942/62486 co-relation queries the response was YES. [2023-08-30 16:53:32,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47240 conditions, 10960 events. 6905/10960 cut-off events. For 61942/62486 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 76634 event pairs, 1027 based on Foata normal form. 433/11131 useless extension candidates. Maximal degree in co-relation 47197. Up to 3255 conditions per place. [2023-08-30 16:53:32,176 INFO L137 encePairwiseOnDemand]: 225/232 looper letters, 52 selfloop transitions, 17 changer transitions 111/183 dead transitions. [2023-08-30 16:53:32,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 183 transitions, 2448 flow [2023-08-30 16:53:32,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:53:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:53:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1055 transitions. [2023-08-30 16:53:32,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052681992337165 [2023-08-30 16:53:32,179 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1055 transitions. [2023-08-30 16:53:32,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1055 transitions. [2023-08-30 16:53:32,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:32,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1055 transitions. [2023-08-30 16:53:32,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.22222222222223) internal successors, (1055), 9 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:32,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:32,184 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:32,184 INFO L175 Difference]: Start difference. First operand has 85 places, 71 transitions, 890 flow. Second operand 9 states and 1055 transitions. [2023-08-30 16:53:32,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 183 transitions, 2448 flow [2023-08-30 16:53:33,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 183 transitions, 2335 flow, removed 39 selfloop flow, removed 8 redundant places. [2023-08-30 16:53:33,042 INFO L231 Difference]: Finished difference. Result has 85 places, 39 transitions, 338 flow [2023-08-30 16:53:33,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=338, PETRI_PLACES=85, PETRI_TRANSITIONS=39} [2023-08-30 16:53:33,042 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2023-08-30 16:53:33,042 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 39 transitions, 338 flow [2023-08-30 16:53:33,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:33,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:33,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:33,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:53:33,043 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:33,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:33,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1592130705, now seen corresponding path program 1 times [2023-08-30 16:53:33,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:33,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312471066] [2023-08-30 16:53:33,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:33,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:53:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:53:33,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:53:33,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312471066] [2023-08-30 16:53:33,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312471066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:53:33,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:53:33,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:53:33,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63148329] [2023-08-30 16:53:33,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:53:33,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 16:53:33,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:53:33,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 16:53:33,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:53:34,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 232 [2023-08-30 16:53:34,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 39 transitions, 338 flow. Second operand has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:34,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:53:34,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 232 [2023-08-30 16:53:34,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:53:34,274 INFO L130 PetriNetUnfolder]: 671/1113 cut-off events. [2023-08-30 16:53:34,274 INFO L131 PetriNetUnfolder]: For 4574/4574 co-relation queries the response was YES. [2023-08-30 16:53:34,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4714 conditions, 1113 events. 671/1113 cut-off events. For 4574/4574 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4688 event pairs, 134 based on Foata normal form. 1/1110 useless extension candidates. Maximal degree in co-relation 4673. Up to 473 conditions per place. [2023-08-30 16:53:34,278 INFO L137 encePairwiseOnDemand]: 226/232 looper letters, 71 selfloop transitions, 4 changer transitions 31/109 dead transitions. [2023-08-30 16:53:34,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 109 transitions, 1062 flow [2023-08-30 16:53:34,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:53:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:53:34,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 705 transitions. [2023-08-30 16:53:34,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064655172413793 [2023-08-30 16:53:34,280 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 705 transitions. [2023-08-30 16:53:34,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 705 transitions. [2023-08-30 16:53:34,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:53:34,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 705 transitions. [2023-08-30 16:53:34,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:34,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:34,283 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:34,283 INFO L175 Difference]: Start difference. First operand has 85 places, 39 transitions, 338 flow. Second operand 6 states and 705 transitions. [2023-08-30 16:53:34,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 109 transitions, 1062 flow [2023-08-30 16:53:34,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 109 transitions, 672 flow, removed 76 selfloop flow, removed 33 redundant places. [2023-08-30 16:53:34,290 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 182 flow [2023-08-30 16:53:34,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-30 16:53:34,291 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-08-30 16:53:34,291 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 182 flow [2023-08-30 16:53:34,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:53:34,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:53:34,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:34,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:53:34,292 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:53:34,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:53:34,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1526262163, now seen corresponding path program 2 times [2023-08-30 16:53:34,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:53:34,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904582040] [2023-08-30 16:53:34,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:53:34,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:53:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:53:34,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:53:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:53:34,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:53:34,399 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:53:34,399 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:53:34,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:53:34,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:53:34,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:53:34,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:53:34,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:53:34,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:53:34,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:53:34,401 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:53:34,406 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:53:34,406 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:53:34,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:53:34 BasicIcfg [2023-08-30 16:53:34,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:53:34,470 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:53:34,470 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:53:34,470 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:53:34,471 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:53:01" (3/4) ... [2023-08-30 16:53:34,472 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:53:34,538 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:53:34,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:53:34,538 INFO L158 Benchmark]: Toolchain (without parser) took 33688.43ms. Allocated memory was 71.3MB in the beginning and 6.8GB in the end (delta: 6.7GB). Free memory was 47.7MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 4.4GB. Max. memory is 16.1GB. [2023-08-30 16:53:34,538 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory was 31.2MB in the beginning and 31.2MB in the end (delta: 54.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:53:34,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.99ms. Allocated memory is still 71.3MB. Free memory was 47.5MB in the beginning and 42.1MB in the end (delta: 5.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2023-08-30 16:53:34,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.14ms. Allocated memory is still 71.3MB. Free memory was 42.1MB in the beginning and 39.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:53:34,539 INFO L158 Benchmark]: Boogie Preprocessor took 32.33ms. Allocated memory is still 71.3MB. Free memory was 39.7MB in the beginning and 37.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:53:34,539 INFO L158 Benchmark]: RCFGBuilder took 604.31ms. Allocated memory is still 71.3MB. Free memory was 37.6MB in the beginning and 37.3MB in the end (delta: 263.5kB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2023-08-30 16:53:34,539 INFO L158 Benchmark]: TraceAbstraction took 32486.95ms. Allocated memory was 71.3MB in the beginning and 6.8GB in the end (delta: 6.7GB). Free memory was 36.9MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 4.4GB. Max. memory is 16.1GB. [2023-08-30 16:53:34,540 INFO L158 Benchmark]: Witness Printer took 67.61ms. Allocated memory is still 6.8GB. Free memory was 2.4GB in the beginning and 2.3GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-30 16:53:34,541 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.17ms. Allocated memory is still 52.4MB. Free memory was 31.2MB in the beginning and 31.2MB in the end (delta: 54.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.99ms. Allocated memory is still 71.3MB. Free memory was 47.5MB in the beginning and 42.1MB in the end (delta: 5.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.14ms. Allocated memory is still 71.3MB. Free memory was 42.1MB in the beginning and 39.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.33ms. Allocated memory is still 71.3MB. Free memory was 39.7MB in the beginning and 37.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 604.31ms. Allocated memory is still 71.3MB. Free memory was 37.6MB in the beginning and 37.3MB in the end (delta: 263.5kB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32486.95ms. Allocated memory was 71.3MB in the beginning and 6.8GB in the end (delta: 6.7GB). Free memory was 36.9MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 4.4GB. Max. memory is 16.1GB. * Witness Printer took 67.61ms. Allocated memory is still 6.8GB. Free memory was 2.4GB in the beginning and 2.3GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 134 PlacesBefore, 42 PlacesAfterwards, 123 TransitionsBefore, 30 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 7750 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2953, independent: 2755, independent conditional: 0, independent unconditional: 2755, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1655, independent: 1607, independent conditional: 0, independent unconditional: 1607, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2953, independent: 1148, independent conditional: 0, independent unconditional: 1148, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 1655, unknown conditional: 0, unknown unconditional: 1655] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool a$flush_delayed; [L716] 0 int a$mem_tmp; [L717] 0 _Bool a$r_buff0_thd0; [L718] 0 _Bool a$r_buff0_thd1; [L719] 0 _Bool a$r_buff0_thd2; [L720] 0 _Bool a$r_buff0_thd3; [L721] 0 _Bool a$r_buff0_thd4; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1513; [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1513, ((void *)0), P0, ((void *)0))=-2, t1513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t1514; [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1514, ((void *)0), P1, ((void *)0))=-1, t1513={5:0}, t1514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1515; [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1515, ((void *)0), P2, ((void *)0))=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1516; [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1516, ((void *)0), P3, ((void *)0))=1, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L796] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L816] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EAX = a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L802] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 4 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice2=1, x=2, y=2, z=2] [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 631 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 534 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1483 IncrementalHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 34 mSDtfsCounter, 1483 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=952occurred in iteration=10, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 1232 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:53:34,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE