./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.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-ext/40_barrier_vf.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 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 --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:37:16,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:37:16,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:37:16,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:37:16,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:37:16,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:37:16,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:37:16,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:37:16,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:37:16,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:37:16,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:37:16,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:37:16,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:37:16,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:37:16,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:37:16,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:37:16,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:37:16,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:37:16,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:37:16,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:37:16,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:37:16,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:37:16,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:37:16,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:37:16,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:37:16,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:37:16,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:37:16,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:37:16,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:37:16,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:37:16,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:37:16,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:37:16,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:37:16,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:37:16,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:37:16,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:37:16,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:37:16,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:37:16,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:37:16,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:37:16,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:37:16,312 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:37:16,345 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:37:16,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:37:16,347 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:37:16,347 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:37:16,348 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:37:16,348 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:37:16,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:37:16,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:37:16,349 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:37:16,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:37:16,350 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:37:16,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:37:16,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:37:16,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:37:16,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:37:16,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:37:16,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:37:16,351 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:37:16,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:37:16,351 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:37:16,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:37:16,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:37:16,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:37:16,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:37:16,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:37:16,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:37:16,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:37:16,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:37:16,353 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:37:16,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:37:16,354 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:37:16,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:37:16,354 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:37:16,354 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:37:16,355 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:37:16,355 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 -> 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 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:37:16,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:37:16,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:37:16,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:37:16,659 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:37:16,659 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:37:16,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-08-30 16:37:17,705 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:37:17,917 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:37:17,917 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-08-30 16:37:17,927 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27bd12be4/cf4ddb735af94348aaf7da7aa06de2b5/FLAG7196e309e [2023-08-30 16:37:17,939 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27bd12be4/cf4ddb735af94348aaf7da7aa06de2b5 [2023-08-30 16:37:17,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:37:17,942 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:37:17,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:37:17,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:37:17,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:37:17,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:37:17" (1/1) ... [2023-08-30 16:37:17,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a6febc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:17, skipping insertion in model container [2023-08-30 16:37:17,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:37:17" (1/1) ... [2023-08-30 16:37:17,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:37:18,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:37:18,168 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-30 16:37:18,285 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-ext/40_barrier_vf.i[31163,31176] [2023-08-30 16:37:18,295 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:37:18,307 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:37:18,330 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-30 16:37:18,353 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-ext/40_barrier_vf.i[31163,31176] [2023-08-30 16:37:18,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:37:18,385 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:37:18,385 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:37:18,385 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:37:18,391 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:37:18,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:18 WrapperNode [2023-08-30 16:37:18,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:37:18,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:37:18,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:37:18,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:37:18,399 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:37:18" (1/1) ... [2023-08-30 16:37:18,429 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:37:18" (1/1) ... [2023-08-30 16:37:18,454 INFO L138 Inliner]: procedures = 174, calls = 25, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 78 [2023-08-30 16:37:18,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:37:18,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:37:18,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:37:18,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:37:18,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:18" (1/1) ... [2023-08-30 16:37:18,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:18" (1/1) ... [2023-08-30 16:37:18,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:18" (1/1) ... [2023-08-30 16:37:18,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:18" (1/1) ... [2023-08-30 16:37:18,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:18" (1/1) ... [2023-08-30 16:37:18,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:18" (1/1) ... [2023-08-30 16:37:18,493 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:18" (1/1) ... [2023-08-30 16:37:18,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:18" (1/1) ... [2023-08-30 16:37:18,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:37:18,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:37:18,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:37:18,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:37:18,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:18" (1/1) ... [2023-08-30 16:37:18,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:37:18,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:37:18,535 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:37:18,562 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:37:18,577 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-30 16:37:18,577 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-30 16:37:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:37:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:37:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:37:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:37:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:37:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:37:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:37:18,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:37:18,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:37:18,580 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:37:18,719 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:37:18,721 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:37:18,848 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:37:18,924 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:37:18,924 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-30 16:37:18,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:37:18 BoogieIcfgContainer [2023-08-30 16:37:18,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:37:18,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:37:18,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:37:18,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:37:18,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:37:17" (1/3) ... [2023-08-30 16:37:18,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f628d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:37:18, skipping insertion in model container [2023-08-30 16:37:18,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:18" (2/3) ... [2023-08-30 16:37:18,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f628d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:37:18, skipping insertion in model container [2023-08-30 16:37:18,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:37:18" (3/3) ... [2023-08-30 16:37:18,937 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2023-08-30 16:37:18,942 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:37:18,950 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:37:18,951 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 16:37:18,951 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:37:18,985 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:37:19,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 103 flow [2023-08-30 16:37:19,042 INFO L130 PetriNetUnfolder]: 4/59 cut-off events. [2023-08-30 16:37:19,042 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:37:19,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 59 events. 4/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2023-08-30 16:37:19,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 49 transitions, 103 flow [2023-08-30 16:37:19,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 49 transitions, 103 flow [2023-08-30 16:37:19,052 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:37:19,059 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 49 transitions, 103 flow [2023-08-30 16:37:19,062 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 49 transitions, 103 flow [2023-08-30 16:37:19,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 103 flow [2023-08-30 16:37:19,077 INFO L130 PetriNetUnfolder]: 4/59 cut-off events. [2023-08-30 16:37:19,077 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:37:19,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 59 events. 4/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2023-08-30 16:37:19,078 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-08-30 16:37:21,464 INFO L134 LiptonReduction]: Checked pairs total: 520 [2023-08-30 16:37:21,464 INFO L136 LiptonReduction]: Total number of compositions: 50 [2023-08-30 16:37:21,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:37:21,492 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;@67fe36b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:37:21,492 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-30 16:37:21,495 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2023-08-30 16:37:21,495 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:37:21,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:21,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 16:37:21,496 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:21,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:21,500 INFO L85 PathProgramCache]: Analyzing trace with hash 9504075, now seen corresponding path program 1 times [2023-08-30 16:37:21,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:21,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16761316] [2023-08-30 16:37:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:21,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:21,959 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:37:21,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:21,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16761316] [2023-08-30 16:37:21,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16761316] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:21,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:21,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:37:21,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450021141] [2023-08-30 16:37:21,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:21,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:37:21,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:21,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:37:21,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:37:22,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 99 [2023-08-30 16:37:22,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 11 places, 8 transitions, 21 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:37:22,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:22,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 99 [2023-08-30 16:37:22,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:22,036 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2023-08-30 16:37:22,036 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:37:22,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 6 events. 0/6 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 3/9 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2023-08-30 16:37:22,037 INFO L137 encePairwiseOnDemand]: 95/99 looper letters, 0 selfloop transitions, 0 changer transitions 5/5 dead transitions. [2023-08-30 16:37:22,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 5 transitions, 23 flow [2023-08-30 16:37:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:37:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:37:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-08-30 16:37:22,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3771043771043771 [2023-08-30 16:37:22,046 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-08-30 16:37:22,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-08-30 16:37:22,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:22,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-08-30 16:37:22,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:37:22,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 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:37:22,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 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:37:22,062 INFO L175 Difference]: Start difference. First operand has 11 places, 8 transitions, 21 flow. Second operand 3 states and 112 transitions. [2023-08-30 16:37:22,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 5 transitions, 23 flow [2023-08-30 16:37:22,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 5 transitions, 23 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:37:22,064 INFO L231 Difference]: Finished difference. Result has 10 places, 0 transitions, 0 flow [2023-08-30 16:37:22,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=15, PETRI_DIFFERENCE_MINUEND_PLACES=8, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=10, PETRI_TRANSITIONS=0} [2023-08-30 16:37:22,069 INFO L281 CegarLoopForPetriNet]: 11 programPoint places, -1 predicate places. [2023-08-30 16:37:22,069 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 0 transitions, 0 flow [2023-08-30 16:37:22,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:37:22,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-08-30 16:37:22,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-08-30 16:37:22,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:37:22,072 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-30 16:37:22,075 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2023-08-30 16:37:22,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 103 flow [2023-08-30 16:37:22,088 INFO L130 PetriNetUnfolder]: 4/59 cut-off events. [2023-08-30 16:37:22,089 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:37:22,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 59 events. 4/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2023-08-30 16:37:22,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 49 transitions, 103 flow [2023-08-30 16:37:22,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 49 transitions, 103 flow [2023-08-30 16:37:22,090 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:37:22,090 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 49 transitions, 103 flow [2023-08-30 16:37:22,091 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 49 transitions, 103 flow [2023-08-30 16:37:22,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 103 flow [2023-08-30 16:37:22,099 INFO L130 PetriNetUnfolder]: 4/59 cut-off events. [2023-08-30 16:37:22,099 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:37:22,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 59 events. 4/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 34. Up to 4 conditions per place. [2023-08-30 16:37:22,100 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-08-30 16:37:24,084 INFO L134 LiptonReduction]: Checked pairs total: 522 [2023-08-30 16:37:24,085 INFO L136 LiptonReduction]: Total number of compositions: 50 [2023-08-30 16:37:24,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 16:37:24,088 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;@67fe36b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:37:24,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 16:37:24,091 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2023-08-30 16:37:24,091 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:37:24,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:24,091 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-30 16:37:24,091 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 16:37:24,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:24,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1991582203, now seen corresponding path program 1 times [2023-08-30 16:37:24,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:24,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928591302] [2023-08-30 16:37:24,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:37:24,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:37:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:37:24,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:37:24,127 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:37:24,128 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 16:37:24,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:37:24,128 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-30 16:37:24,129 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 16:37:24,129 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 16:37:24,129 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-30 16:37:24,143 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:37:24,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 156 flow [2023-08-30 16:37:24,159 INFO L130 PetriNetUnfolder]: 7/94 cut-off events. [2023-08-30 16:37:24,160 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:37:24,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 7/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2023-08-30 16:37:24,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 72 transitions, 156 flow [2023-08-30 16:37:24,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 72 transitions, 156 flow [2023-08-30 16:37:24,162 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:37:24,162 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 72 transitions, 156 flow [2023-08-30 16:37:24,162 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 72 transitions, 156 flow [2023-08-30 16:37:24,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 156 flow [2023-08-30 16:37:24,174 INFO L130 PetriNetUnfolder]: 7/94 cut-off events. [2023-08-30 16:37:24,179 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:37:24,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 7/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2023-08-30 16:37:24,183 INFO L119 LiptonReduction]: Number of co-enabled transitions 2156 [2023-08-30 16:37:24,920 INFO L134 LiptonReduction]: Checked pairs total: 8141 [2023-08-30 16:37:24,920 INFO L136 LiptonReduction]: Total number of compositions: 47 [2023-08-30 16:37:24,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:37:24,923 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;@67fe36b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:37:24,924 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-30 16:37:24,928 INFO L130 PetriNetUnfolder]: 1/31 cut-off events. [2023-08-30 16:37:24,928 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:37:24,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:24,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:24,929 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:24,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:24,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1878992399, now seen corresponding path program 1 times [2023-08-30 16:37:24,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:24,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428567490] [2023-08-30 16:37:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:25,059 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:37:25,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:25,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428567490] [2023-08-30 16:37:25,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428567490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:25,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:25,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:37:25,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814933417] [2023-08-30 16:37:25,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:25,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:37:25,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:25,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:37:25,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:37:25,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 119 [2023-08-30 16:37:25,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 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:37:25,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:25,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 119 [2023-08-30 16:37:25,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:25,402 INFO L130 PetriNetUnfolder]: 661/1247 cut-off events. [2023-08-30 16:37:25,403 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-30 16:37:25,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 1247 events. 661/1247 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7929 event pairs, 95 based on Foata normal form. 0/1180 useless extension candidates. Maximal degree in co-relation 2176. Up to 457 conditions per place. [2023-08-30 16:37:25,410 INFO L137 encePairwiseOnDemand]: 107/119 looper letters, 73 selfloop transitions, 18 changer transitions 0/99 dead transitions. [2023-08-30 16:37:25,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 99 transitions, 407 flow [2023-08-30 16:37:25,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:37:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:37:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 406 transitions. [2023-08-30 16:37:25,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48739495798319327 [2023-08-30 16:37:25,415 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 406 transitions. [2023-08-30 16:37:25,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 406 transitions. [2023-08-30 16:37:25,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:25,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 406 transitions. [2023-08-30 16:37:25,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 58.0) internal successors, (406), 7 states have internal predecessors, (406), 0 states have call successors, (0), 0 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:37:25,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:37:25,421 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:37:25,421 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 84 flow. Second operand 7 states and 406 transitions. [2023-08-30 16:37:25,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 99 transitions, 407 flow [2023-08-30 16:37:25,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 99 transitions, 405 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-30 16:37:25,442 INFO L231 Difference]: Finished difference. Result has 48 places, 50 transitions, 208 flow [2023-08-30 16:37:25,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=48, PETRI_TRANSITIONS=50} [2023-08-30 16:37:25,444 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-30 16:37:25,444 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 208 flow [2023-08-30 16:37:25,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 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:37:25,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:25,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:25,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:37:25,445 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:25,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:25,446 INFO L85 PathProgramCache]: Analyzing trace with hash -908360492, now seen corresponding path program 1 times [2023-08-30 16:37:25,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:25,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050373539] [2023-08-30 16:37:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:25,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:25,656 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:37:25,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:25,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050373539] [2023-08-30 16:37:25,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050373539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:25,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:25,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:37:25,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819045253] [2023-08-30 16:37:25,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:25,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:37:25,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:25,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:37:25,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:37:25,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 119 [2023-08-30 16:37:25,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 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:37:25,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:25,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 119 [2023-08-30 16:37:25,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:25,806 INFO L130 PetriNetUnfolder]: 416/837 cut-off events. [2023-08-30 16:37:25,806 INFO L131 PetriNetUnfolder]: For 432/460 co-relation queries the response was YES. [2023-08-30 16:37:25,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986 conditions, 837 events. 416/837 cut-off events. For 432/460 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5036 event pairs, 177 based on Foata normal form. 59/858 useless extension candidates. Maximal degree in co-relation 1528. Up to 395 conditions per place. [2023-08-30 16:37:25,812 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 41 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-08-30 16:37:25,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 362 flow [2023-08-30 16:37:25,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:37:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:37:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2023-08-30 16:37:25,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070028011204482 [2023-08-30 16:37:25,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 181 transitions. [2023-08-30 16:37:25,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 181 transitions. [2023-08-30 16:37:25,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:25,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 181 transitions. [2023-08-30 16:37:25,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 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:37:25,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 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:37:25,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 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:37:25,818 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 208 flow. Second operand 3 states and 181 transitions. [2023-08-30 16:37:25,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 362 flow [2023-08-30 16:37:25,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 362 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:37:25,825 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 235 flow [2023-08-30 16:37:25,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2023-08-30 16:37:25,827 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-08-30 16:37:25,827 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 235 flow [2023-08-30 16:37:25,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 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:37:25,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:25,828 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:25,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:37:25,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:25,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:25,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1481656299, now seen corresponding path program 1 times [2023-08-30 16:37:25,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935428825] [2023-08-30 16:37:25,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:25,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:37:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:25,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935428825] [2023-08-30 16:37:25,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935428825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:25,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:25,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:37:25,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003649930] [2023-08-30 16:37:25,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:25,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:37:25,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:25,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:37:25,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:37:25,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 119 [2023-08-30 16:37:25,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 0 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:37:25,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:25,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 119 [2023-08-30 16:37:25,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:26,120 INFO L130 PetriNetUnfolder]: 332/644 cut-off events. [2023-08-30 16:37:26,120 INFO L131 PetriNetUnfolder]: For 411/425 co-relation queries the response was YES. [2023-08-30 16:37:26,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 644 events. 332/644 cut-off events. For 411/425 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3535 event pairs, 99 based on Foata normal form. 22/653 useless extension candidates. Maximal degree in co-relation 1537. Up to 279 conditions per place. [2023-08-30 16:37:26,125 INFO L137 encePairwiseOnDemand]: 110/119 looper letters, 56 selfloop transitions, 14 changer transitions 11/92 dead transitions. [2023-08-30 16:37:26,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 92 transitions, 524 flow [2023-08-30 16:37:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:37:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:37:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 367 transitions. [2023-08-30 16:37:26,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44057623049219685 [2023-08-30 16:37:26,128 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 367 transitions. [2023-08-30 16:37:26,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 367 transitions. [2023-08-30 16:37:26,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:26,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 367 transitions. [2023-08-30 16:37:26,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 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:37:26,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:37:26,132 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 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:37:26,132 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 235 flow. Second operand 7 states and 367 transitions. [2023-08-30 16:37:26,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 92 transitions, 524 flow [2023-08-30 16:37:26,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 92 transitions, 519 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:37:26,138 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 290 flow [2023-08-30 16:37:26,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2023-08-30 16:37:26,141 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2023-08-30 16:37:26,141 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 290 flow [2023-08-30 16:37:26,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 0 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:37:26,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:26,142 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:26,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:37:26,143 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:26,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash -25820515, now seen corresponding path program 1 times [2023-08-30 16:37:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:26,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852286452] [2023-08-30 16:37:26,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:26,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:37:26,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:26,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852286452] [2023-08-30 16:37:26,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852286452] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:37:26,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529299484] [2023-08-30 16:37:26,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:26,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:37:26,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:37:26,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:37:26,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 16:37:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:26,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 16:37:26,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:37:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:37:26,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 16:37:26,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529299484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:26,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 16:37:26,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2023-08-30 16:37:26,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034114624] [2023-08-30 16:37:26,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:26,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:37:26,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:26,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:37:26,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:37:26,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119 [2023-08-30 16:37:26,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 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:37:26,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:26,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119 [2023-08-30 16:37:26,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:26,446 INFO L130 PetriNetUnfolder]: 59/173 cut-off events. [2023-08-30 16:37:26,446 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2023-08-30 16:37:26,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 173 events. 59/173 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 673 event pairs, 21 based on Foata normal form. 12/182 useless extension candidates. Maximal degree in co-relation 344. Up to 74 conditions per place. [2023-08-30 16:37:26,447 INFO L137 encePairwiseOnDemand]: 111/119 looper letters, 18 selfloop transitions, 8 changer transitions 2/45 dead transitions. [2023-08-30 16:37:26,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 266 flow [2023-08-30 16:37:26,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:37:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:37:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2023-08-30 16:37:26,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126050420168067 [2023-08-30 16:37:26,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 183 transitions. [2023-08-30 16:37:26,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 183 transitions. [2023-08-30 16:37:26,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:26,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 183 transitions. [2023-08-30 16:37:26,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 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:37:26,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 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:37:26,464 INFO L81 ComplementDD]: Finished complementDD. Result has 4 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:37:26,464 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 290 flow. Second operand 3 states and 183 transitions. [2023-08-30 16:37:26,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 266 flow [2023-08-30 16:37:26,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 232 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-30 16:37:26,467 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 163 flow [2023-08-30 16:37:26,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-08-30 16:37:26,468 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2023-08-30 16:37:26,468 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 163 flow [2023-08-30 16:37:26,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 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:37:26,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:26,468 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:26,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 16:37:26,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-30 16:37:26,669 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:26,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:26,670 INFO L85 PathProgramCache]: Analyzing trace with hash 361947616, now seen corresponding path program 1 times [2023-08-30 16:37:26,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:26,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638919314] [2023-08-30 16:37:26,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:26,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:37:26,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:26,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638919314] [2023-08-30 16:37:26,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638919314] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:37:26,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111299265] [2023-08-30 16:37:26,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:26,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:37:26,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:37:26,829 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:37:26,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 16:37:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:26,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 16:37:26,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:37:26,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:37:26,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:37:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:37:27,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111299265] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:37:27,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:37:27,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 16:37:27,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15455472] [2023-08-30 16:37:27,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:37:27,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 16:37:27,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:27,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 16:37:27,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-30 16:37:27,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 119 [2023-08-30 16:37:27,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 163 flow. Second operand has 13 states, 13 states have (on average 39.38461538461539) internal successors, (512), 13 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:37:27,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:27,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 119 [2023-08-30 16:37:27,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:27,292 INFO L130 PetriNetUnfolder]: 52/140 cut-off events. [2023-08-30 16:37:27,293 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2023-08-30 16:37:27,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 140 events. 52/140 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 502 event pairs, 22 based on Foata normal form. 2/140 useless extension candidates. Maximal degree in co-relation 228. Up to 64 conditions per place. [2023-08-30 16:37:27,294 INFO L137 encePairwiseOnDemand]: 109/119 looper letters, 19 selfloop transitions, 7 changer transitions 16/47 dead transitions. [2023-08-30 16:37:27,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 274 flow [2023-08-30 16:37:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 16:37:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 16:37:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 487 transitions. [2023-08-30 16:37:27,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34103641456582634 [2023-08-30 16:37:27,296 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 487 transitions. [2023-08-30 16:37:27,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 487 transitions. [2023-08-30 16:37:27,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:27,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 487 transitions. [2023-08-30 16:37:27,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 40.583333333333336) internal successors, (487), 12 states have internal predecessors, (487), 0 states have call successors, (0), 0 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:37:27,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 0 states have call successors, (0), 0 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:37:27,301 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 119.0) internal successors, (1547), 13 states have internal predecessors, (1547), 0 states have call successors, (0), 0 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:37:27,301 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 163 flow. Second operand 12 states and 487 transitions. [2023-08-30 16:37:27,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 274 flow [2023-08-30 16:37:27,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 252 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-30 16:37:27,303 INFO L231 Difference]: Finished difference. Result has 55 places, 25 transitions, 105 flow [2023-08-30 16:37:27,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=105, PETRI_PLACES=55, PETRI_TRANSITIONS=25} [2023-08-30 16:37:27,303 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-08-30 16:37:27,304 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 25 transitions, 105 flow [2023-08-30 16:37:27,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 39.38461538461539) internal successors, (512), 13 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:37:27,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:27,304 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:27,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 16:37:27,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-30 16:37:27,510 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:27,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1052392163, now seen corresponding path program 1 times [2023-08-30 16:37:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:27,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660472154] [2023-08-30 16:37:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:37:27,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:27,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660472154] [2023-08-30 16:37:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660472154] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:27,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:27,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:37:27,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553441554] [2023-08-30 16:37:27,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:27,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:37:27,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:27,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:37:27,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:37:27,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 119 [2023-08-30 16:37:27,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 25 transitions, 105 flow. Second operand has 7 states, 7 states have (on average 41.285714285714285) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 0 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:37:27,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:27,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 119 [2023-08-30 16:37:27,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:27,704 INFO L130 PetriNetUnfolder]: 11/45 cut-off events. [2023-08-30 16:37:27,704 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-08-30 16:37:27,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 45 events. 11/45 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 4 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 115. Up to 16 conditions per place. [2023-08-30 16:37:27,705 INFO L137 encePairwiseOnDemand]: 112/119 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2023-08-30 16:37:27,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 21 transitions, 117 flow [2023-08-30 16:37:27,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:37:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:37:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 331 transitions. [2023-08-30 16:37:27,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3476890756302521 [2023-08-30 16:37:27,708 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 331 transitions. [2023-08-30 16:37:27,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 331 transitions. [2023-08-30 16:37:27,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:27,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 331 transitions. [2023-08-30 16:37:27,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 0 states have call successors, (0), 0 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:37:27,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 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:37:27,715 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 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:37:27,715 INFO L175 Difference]: Start difference. First operand has 55 places, 25 transitions, 105 flow. Second operand 8 states and 331 transitions. [2023-08-30 16:37:27,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 21 transitions, 117 flow [2023-08-30 16:37:27,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 21 transitions, 96 flow, removed 0 selfloop flow, removed 11 redundant places. [2023-08-30 16:37:27,716 INFO L231 Difference]: Finished difference. Result has 30 places, 0 transitions, 0 flow [2023-08-30 16:37:27,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=30, PETRI_TRANSITIONS=0} [2023-08-30 16:37:27,718 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -9 predicate places. [2023-08-30 16:37:27,719 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 0 transitions, 0 flow [2023-08-30 16:37:27,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 41.285714285714285) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 0 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:37:27,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-30 16:37:27,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-30 16:37:27,720 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-30 16:37:27,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:37:27,720 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-30 16:37:27,721 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-30 16:37:27,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 156 flow [2023-08-30 16:37:27,732 INFO L130 PetriNetUnfolder]: 7/94 cut-off events. [2023-08-30 16:37:27,733 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:37:27,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 7/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2023-08-30 16:37:27,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 72 transitions, 156 flow [2023-08-30 16:37:27,734 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 72 transitions, 156 flow [2023-08-30 16:37:27,734 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:37:27,734 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 72 transitions, 156 flow [2023-08-30 16:37:27,734 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 72 transitions, 156 flow [2023-08-30 16:37:27,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 72 transitions, 156 flow [2023-08-30 16:37:27,742 INFO L130 PetriNetUnfolder]: 7/94 cut-off events. [2023-08-30 16:37:27,742 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:37:27,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 7/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 174 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2023-08-30 16:37:27,743 INFO L119 LiptonReduction]: Number of co-enabled transitions 2156 [2023-08-30 16:37:28,548 INFO L134 LiptonReduction]: Checked pairs total: 8141 [2023-08-30 16:37:28,549 INFO L136 LiptonReduction]: Total number of compositions: 47 [2023-08-30 16:37:28,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 16:37:28,550 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;@67fe36b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:37:28,550 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 16:37:28,553 INFO L130 PetriNetUnfolder]: 1/28 cut-off events. [2023-08-30 16:37:28,553 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 16:37:28,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:28,554 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-30 16:37:28,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 16:37:28,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:28,554 INFO L85 PathProgramCache]: Analyzing trace with hash -287549659, now seen corresponding path program 1 times [2023-08-30 16:37:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:28,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216359877] [2023-08-30 16:37:28,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:28,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:37:28,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:37:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:37:28,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:37:28,568 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:37:28,568 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 16:37:28,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:37:28,569 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-30 16:37:28,569 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 16:37:28,570 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 16:37:28,570 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-30 16:37:28,586 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:37:28,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 95 transitions, 211 flow [2023-08-30 16:37:28,597 INFO L130 PetriNetUnfolder]: 10/129 cut-off events. [2023-08-30 16:37:28,597 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 16:37:28,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 129 events. 10/129 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 287 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 98. Up to 8 conditions per place. [2023-08-30 16:37:28,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 95 transitions, 211 flow [2023-08-30 16:37:28,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 95 transitions, 211 flow [2023-08-30 16:37:28,599 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:37:28,599 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 95 transitions, 211 flow [2023-08-30 16:37:28,599 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 95 transitions, 211 flow [2023-08-30 16:37:28,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 95 transitions, 211 flow [2023-08-30 16:37:28,617 INFO L130 PetriNetUnfolder]: 10/129 cut-off events. [2023-08-30 16:37:28,617 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-30 16:37:28,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 129 events. 10/129 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 287 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 98. Up to 8 conditions per place. [2023-08-30 16:37:28,620 INFO L119 LiptonReduction]: Number of co-enabled transitions 4752 [2023-08-30 16:37:29,448 INFO L134 LiptonReduction]: Checked pairs total: 20874 [2023-08-30 16:37:29,449 INFO L136 LiptonReduction]: Total number of compositions: 59 [2023-08-30 16:37:29,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:37:29,450 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;@67fe36b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:37:29,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 16:37:29,453 INFO L130 PetriNetUnfolder]: 1/31 cut-off events. [2023-08-30 16:37:29,453 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 16:37:29,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:29,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:29,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:29,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:29,454 INFO L85 PathProgramCache]: Analyzing trace with hash -799850224, now seen corresponding path program 1 times [2023-08-30 16:37:29,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:29,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084249636] [2023-08-30 16:37:29,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:29,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:29,508 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:37:29,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:29,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084249636] [2023-08-30 16:37:29,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084249636] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:29,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:29,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:37:29,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467031558] [2023-08-30 16:37:29,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:29,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:37:29,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:29,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:37:29,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:37:29,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 154 [2023-08-30 16:37:29,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 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:37:29,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:29,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 154 [2023-08-30 16:37:29,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:31,216 INFO L130 PetriNetUnfolder]: 12355/19121 cut-off events. [2023-08-30 16:37:31,217 INFO L131 PetriNetUnfolder]: For 1336/1336 co-relation queries the response was YES. [2023-08-30 16:37:31,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37845 conditions, 19121 events. 12355/19121 cut-off events. For 1336/1336 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 144520 event pairs, 2185 based on Foata normal form. 280/18732 useless extension candidates. Maximal degree in co-relation 21539. Up to 7379 conditions per place. [2023-08-30 16:37:31,337 INFO L137 encePairwiseOnDemand]: 138/154 looper letters, 130 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2023-08-30 16:37:31,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 168 transitions, 719 flow [2023-08-30 16:37:31,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:37:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:37:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 559 transitions. [2023-08-30 16:37:31,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185528756957328 [2023-08-30 16:37:31,340 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 559 transitions. [2023-08-30 16:37:31,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 559 transitions. [2023-08-30 16:37:31,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:31,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 559 transitions. [2023-08-30 16:37:31,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 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:37:31,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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:37:31,344 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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:37:31,344 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 123 flow. Second operand 7 states and 559 transitions. [2023-08-30 16:37:31,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 168 transitions, 719 flow [2023-08-30 16:37:31,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 168 transitions, 703 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-30 16:37:31,349 INFO L231 Difference]: Finished difference. Result has 63 places, 77 transitions, 323 flow [2023-08-30 16:37:31,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=323, PETRI_PLACES=63, PETRI_TRANSITIONS=77} [2023-08-30 16:37:31,349 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2023-08-30 16:37:31,350 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 77 transitions, 323 flow [2023-08-30 16:37:31,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 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:37:31,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:31,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:31,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:37:31,351 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:31,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1060129555, now seen corresponding path program 1 times [2023-08-30 16:37:31,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:31,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009290083] [2023-08-30 16:37:31,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:37:31,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:31,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009290083] [2023-08-30 16:37:31,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009290083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:31,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:31,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:37:31,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185900752] [2023-08-30 16:37:31,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:31,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:37:31,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:31,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:37:31,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:37:31,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 154 [2023-08-30 16:37:31,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 77 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 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:37:31,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:31,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 154 [2023-08-30 16:37:31,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:32,498 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 12#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,498 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,498 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,498 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,499 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,505 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 12#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,505 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,505 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,505 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,505 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,535 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([660] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 88#L721true, 66#L725true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,535 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,536 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,536 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,536 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,536 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([661] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 72#L724true, 14#L733-5true, 66#L725true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,536 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,536 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,536 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,537 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 16:37:32,699 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,699 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,699 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,699 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,700 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,705 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,706 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,706 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,706 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,706 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([660] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 88#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 78#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,741 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,742 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,742 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,742 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,742 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([661] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 72#L724true, 14#L733-5true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 78#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,742 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,742 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,743 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,743 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,754 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,754 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,754 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,755 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,755 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,755 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,755 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,755 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,755 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,756 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,756 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,756 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 16:37:32,832 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 34#L733-4true, 17#L724-5true, 12#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,833 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,833 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,833 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,833 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,833 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 34#L733-4true, 12#L725true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,833 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,833 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,833 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,833 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,881 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 39#L725true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,881 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 16:37:32,881 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 16:37:32,881 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 16:37:32,882 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 16:37:32,882 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 39#L725true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,882 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 16:37:32,882 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 16:37:32,882 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 16:37:32,882 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 16:37:32,937 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([660] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 88#L721true, 66#L725true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 34#L733-4true, 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,937 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,937 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,937 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,937 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,937 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([661] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 72#L724true, 66#L725true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 34#L733-4true, 17#L724-5true, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,938 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,938 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,938 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,938 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,949 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 34#L733-4true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,949 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 16:37:32,949 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:32,949 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:32,949 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:32,949 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 34#L733-4true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,949 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 16:37:32,950 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:32,950 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:32,950 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:32,996 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,996 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,996 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,996 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,997 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,997 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 14#L733-5true, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:32,997 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,997 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,997 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:32,997 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 16:37:33,121 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([660] L719-1-->L721: Formula: (= (mod v_~count~0_154 4294967296) 3) InVars {~count~0=v_~count~0_154} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_154} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [thr1Thread3of3ForFork0InUse, 88#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 34#L733-4true, 78#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:33,121 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,121 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,121 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,122 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,122 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([661] L719-1-->L724: Formula: (not (= (mod v_~count~0_156 4294967296) 3)) InVars {~count~0=v_~count~0_156} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_156} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [thr1Thread3of3ForFork0InUse, 72#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 17#L724-5true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 34#L733-4true, 78#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:33,122 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,122 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,122 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,122 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,132 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 34#L733-4true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:33,132 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,132 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,133 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,133 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,133 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,133 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 17#L724-5true, 34#L733-4true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:33,133 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,133 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,133 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,133 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,133 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 16:37:33,186 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 34#L733-4true, 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 39#L725true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:33,187 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 16:37:33,187 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:37:33,187 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:37:33,187 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:37:33,187 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 34#L733-4true, 39#L725true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 98#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:33,187 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 16:37:33,187 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:37:33,187 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:37:33,187 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 16:37:33,220 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([663] L719-1-->L721: Formula: (= 3 (mod v_~count~0_158 4294967296)) InVars {~count~0=v_~count~0_158} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_13|, ~count~0=v_~count~0_158} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [thr1Thread3of3ForFork0InUse, 80#L721true, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 34#L733-4true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:33,220 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 16:37:33,220 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:37:33,220 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:37:33,220 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:37:33,220 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L719-1-->L724: Formula: (not (= (mod v_~count~0_160 4294967296) 3)) InVars {~count~0=v_~count~0_160} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_160} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [thr1Thread3of3ForFork0InUse, 3#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 84#L724true, Black: 106#(and (<= ~count~0 1) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (< 0 (+ (div ~count~0 4294967296) 1)) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 101#(and (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 104#(and (<= ~count~0 0) (<= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0) (<= 0 ~count~0) (<= 0 |thr1Thread1of3ForFork0_Barrier2_#t~post4#1|)), Black: 102#(and (<= ~count~0 1) (< 0 (+ (div ~count~0 4294967296) 1))), Black: 100#(and (<= ~count~0 0) (<= 0 ~count~0)), 116#(and (<= ~COND~0 (+ (* 256 (div ~COND~0 256)) (* (div (+ ~COND~0 (* (- 256) (div ~COND~0 256))) 4294967296) 4294967296))) (<= 0 ~COND~0)), 34#L733-4true, 98#true, 13#thr1Err0ASSERT_VIOLATIONERROR_FUNCTIONtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse]) [2023-08-30 16:37:33,220 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-30 16:37:33,220 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:37:33,220 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:37:33,220 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-30 16:37:33,254 INFO L130 PetriNetUnfolder]: 13836/21473 cut-off events. [2023-08-30 16:37:33,254 INFO L131 PetriNetUnfolder]: For 12855/14317 co-relation queries the response was YES. [2023-08-30 16:37:33,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50628 conditions, 21473 events. 13836/21473 cut-off events. For 12855/14317 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 167877 event pairs, 5116 based on Foata normal form. 1145/21851 useless extension candidates. Maximal degree in co-relation 38841. Up to 9908 conditions per place. [2023-08-30 16:37:33,427 INFO L137 encePairwiseOnDemand]: 144/154 looper letters, 75 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2023-08-30 16:37:33,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 115 transitions, 624 flow [2023-08-30 16:37:33,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:37:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:37:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2023-08-30 16:37:33,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-08-30 16:37:33,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2023-08-30 16:37:33,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2023-08-30 16:37:33,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:33,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2023-08-30 16:37:33,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:37:33,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 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:37:33,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 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:37:33,431 INFO L175 Difference]: Start difference. First operand has 63 places, 77 transitions, 323 flow. Second operand 3 states and 242 transitions. [2023-08-30 16:37:33,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 115 transitions, 624 flow [2023-08-30 16:37:33,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 115 transitions, 624 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 16:37:33,454 INFO L231 Difference]: Finished difference. Result has 67 places, 83 transitions, 381 flow [2023-08-30 16:37:33,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=67, PETRI_TRANSITIONS=83} [2023-08-30 16:37:33,455 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2023-08-30 16:37:33,455 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 83 transitions, 381 flow [2023-08-30 16:37:33,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 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:37:33,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:33,455 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:33,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:37:33,456 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:33,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:33,456 INFO L85 PathProgramCache]: Analyzing trace with hash 420780807, now seen corresponding path program 1 times [2023-08-30 16:37:33,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:33,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792584291] [2023-08-30 16:37:33,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:33,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:37:33,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:33,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792584291] [2023-08-30 16:37:33,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792584291] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:33,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:33,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:37:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476420817] [2023-08-30 16:37:33,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:33,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:37:33,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:33,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:37:33,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:37:33,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 154 [2023-08-30 16:37:33,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 83 transitions, 381 flow. Second operand has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 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:37:33,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:33,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 154 [2023-08-30 16:37:33,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:35,467 INFO L130 PetriNetUnfolder]: 15464/24722 cut-off events. [2023-08-30 16:37:35,467 INFO L131 PetriNetUnfolder]: For 18479/18807 co-relation queries the response was YES. [2023-08-30 16:37:35,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63814 conditions, 24722 events. 15464/24722 cut-off events. For 18479/18807 co-relation queries the response was YES. Maximal size of possible extension queue 1552. Compared 202506 event pairs, 3790 based on Foata normal form. 602/24896 useless extension candidates. Maximal degree in co-relation 61164. Up to 10224 conditions per place. [2023-08-30 16:37:35,617 INFO L137 encePairwiseOnDemand]: 143/154 looper letters, 136 selfloop transitions, 39 changer transitions 0/194 dead transitions. [2023-08-30 16:37:35,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 194 transitions, 1136 flow [2023-08-30 16:37:35,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:37:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:37:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 455 transitions. [2023-08-30 16:37:35,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2023-08-30 16:37:35,620 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 455 transitions. [2023-08-30 16:37:35,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 455 transitions. [2023-08-30 16:37:35,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:35,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 455 transitions. [2023-08-30 16:37:35,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.83333333333333) internal successors, (455), 6 states have internal predecessors, (455), 0 states have call successors, (0), 0 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:37:35,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 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:37:35,624 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 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:37:35,624 INFO L175 Difference]: Start difference. First operand has 67 places, 83 transitions, 381 flow. Second operand 6 states and 455 transitions. [2023-08-30 16:37:35,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 194 transitions, 1136 flow [2023-08-30 16:37:35,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 194 transitions, 1122 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:37:35,682 INFO L231 Difference]: Finished difference. Result has 73 places, 106 transitions, 641 flow [2023-08-30 16:37:35,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=641, PETRI_PLACES=73, PETRI_TRANSITIONS=106} [2023-08-30 16:37:35,683 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 18 predicate places. [2023-08-30 16:37:35,684 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 106 transitions, 641 flow [2023-08-30 16:37:35,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 0 states have call successors, (0), 0 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:37:35,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:35,684 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:35,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:37:35,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:35,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:35,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1151192071, now seen corresponding path program 1 times [2023-08-30 16:37:35,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:35,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292184778] [2023-08-30 16:37:35,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:35,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:37:35,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:35,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292184778] [2023-08-30 16:37:35,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292184778] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:37:35,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334149993] [2023-08-30 16:37:35,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:35,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:37:35,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:37:35,816 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:37:35,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 16:37:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:35,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 16:37:35,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:37:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:37:35,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 16:37:35,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334149993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:35,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 16:37:35,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2023-08-30 16:37:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679249472] [2023-08-30 16:37:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:35,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:37:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:35,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:37:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 16:37:35,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 154 [2023-08-30 16:37:35,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 106 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:37:35,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:35,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 154 [2023-08-30 16:37:35,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:36,428 INFO L130 PetriNetUnfolder]: 2059/4191 cut-off events. [2023-08-30 16:37:36,429 INFO L131 PetriNetUnfolder]: For 2163/2171 co-relation queries the response was YES. [2023-08-30 16:37:36,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 4191 events. 2059/4191 cut-off events. For 2163/2171 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 33534 event pairs, 831 based on Foata normal form. 354/4494 useless extension candidates. Maximal degree in co-relation 7431. Up to 1784 conditions per place. [2023-08-30 16:37:36,448 INFO L137 encePairwiseOnDemand]: 142/154 looper letters, 28 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2023-08-30 16:37:36,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 72 transitions, 415 flow [2023-08-30 16:37:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:37:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:37:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2023-08-30 16:37:36,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-08-30 16:37:36,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 238 transitions. [2023-08-30 16:37:36,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 238 transitions. [2023-08-30 16:37:36,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:36,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 238 transitions. [2023-08-30 16:37:36,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:37:36,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 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:37:36,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 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:37:36,452 INFO L175 Difference]: Start difference. First operand has 73 places, 106 transitions, 641 flow. Second operand 3 states and 238 transitions. [2023-08-30 16:37:36,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 72 transitions, 415 flow [2023-08-30 16:37:36,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 72 transitions, 360 flow, removed 17 selfloop flow, removed 6 redundant places. [2023-08-30 16:37:36,458 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 270 flow [2023-08-30 16:37:36,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2023-08-30 16:37:36,459 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2023-08-30 16:37:36,459 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 270 flow [2023-08-30 16:37:36,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:37:36,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:36,460 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:36,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 16:37:36,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:37:36,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:36,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:36,665 INFO L85 PathProgramCache]: Analyzing trace with hash -841570106, now seen corresponding path program 1 times [2023-08-30 16:37:36,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:36,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353130960] [2023-08-30 16:37:36,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:36,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:37:36,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:36,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353130960] [2023-08-30 16:37:36,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353130960] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:36,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:36,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:37:36,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792230649] [2023-08-30 16:37:36,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:36,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:37:36,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:36,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:37:36,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:37:36,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 154 [2023-08-30 16:37:36,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 55.4) internal successors, (277), 5 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:37:36,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:36,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 154 [2023-08-30 16:37:36,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:37,127 INFO L130 PetriNetUnfolder]: 1757/3356 cut-off events. [2023-08-30 16:37:37,127 INFO L131 PetriNetUnfolder]: For 1376/1404 co-relation queries the response was YES. [2023-08-30 16:37:37,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8504 conditions, 3356 events. 1757/3356 cut-off events. For 1376/1404 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 24432 event pairs, 599 based on Foata normal form. 4/3339 useless extension candidates. Maximal degree in co-relation 4421. Up to 1281 conditions per place. [2023-08-30 16:37:37,147 INFO L137 encePairwiseOnDemand]: 144/154 looper letters, 80 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2023-08-30 16:37:37,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 108 transitions, 608 flow [2023-08-30 16:37:37,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:37:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:37:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 405 transitions. [2023-08-30 16:37:37,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4383116883116883 [2023-08-30 16:37:37,150 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 405 transitions. [2023-08-30 16:37:37,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 405 transitions. [2023-08-30 16:37:37,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:37,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 405 transitions. [2023-08-30 16:37:37,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 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:37:37,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 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:37:37,152 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 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:37:37,153 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 270 flow. Second operand 6 states and 405 transitions. [2023-08-30 16:37:37,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 108 transitions, 608 flow [2023-08-30 16:37:37,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 108 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:37:37,159 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 304 flow [2023-08-30 16:37:37,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2023-08-30 16:37:37,160 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 19 predicate places. [2023-08-30 16:37:37,160 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 304 flow [2023-08-30 16:37:37,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.4) internal successors, (277), 5 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:37:37,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:37,161 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:37,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:37:37,161 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:37,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash 601777900, now seen corresponding path program 1 times [2023-08-30 16:37:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:37,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729826644] [2023-08-30 16:37:37,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:37:37,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:37,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729826644] [2023-08-30 16:37:37,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729826644] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:37:37,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438015857] [2023-08-30 16:37:37,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:37,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:37:37,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:37:37,269 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:37:37,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 16:37:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:37,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 16:37:37,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:37:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:37:37,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:37:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 16:37:37,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438015857] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:37:37,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:37:37,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 16:37:37,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518354749] [2023-08-30 16:37:37,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:37:37,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 16:37:37,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 16:37:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-30 16:37:37,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 154 [2023-08-30 16:37:37,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 304 flow. Second operand has 13 states, 13 states have (on average 49.38461538461539) internal successors, (642), 13 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:37:37,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:37,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 154 [2023-08-30 16:37:37,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:38,144 INFO L130 PetriNetUnfolder]: 1663/3110 cut-off events. [2023-08-30 16:37:38,144 INFO L131 PetriNetUnfolder]: For 1666/1678 co-relation queries the response was YES. [2023-08-30 16:37:38,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7857 conditions, 3110 events. 1663/3110 cut-off events. For 1666/1678 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22192 event pairs, 503 based on Foata normal form. 8/3099 useless extension candidates. Maximal degree in co-relation 4983. Up to 1045 conditions per place. [2023-08-30 16:37:38,161 INFO L137 encePairwiseOnDemand]: 139/154 looper letters, 97 selfloop transitions, 28 changer transitions 0/139 dead transitions. [2023-08-30 16:37:38,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 139 transitions, 822 flow [2023-08-30 16:37:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 16:37:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 16:37:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 638 transitions. [2023-08-30 16:37:38,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37662337662337664 [2023-08-30 16:37:38,164 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 638 transitions. [2023-08-30 16:37:38,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 638 transitions. [2023-08-30 16:37:38,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:38,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 638 transitions. [2023-08-30 16:37:38,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 58.0) internal successors, (638), 11 states have internal predecessors, (638), 0 states have call successors, (0), 0 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:37:38,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 154.0) internal successors, (1848), 12 states have internal predecessors, (1848), 0 states have call successors, (0), 0 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:37:38,169 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 154.0) internal successors, (1848), 12 states have internal predecessors, (1848), 0 states have call successors, (0), 0 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:37:38,169 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 304 flow. Second operand 11 states and 638 transitions. [2023-08-30 16:37:38,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 139 transitions, 822 flow [2023-08-30 16:37:38,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 139 transitions, 808 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-30 16:37:38,174 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 383 flow [2023-08-30 16:37:38,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=383, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2023-08-30 16:37:38,175 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 30 predicate places. [2023-08-30 16:37:38,176 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 383 flow [2023-08-30 16:37:38,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 49.38461538461539) internal successors, (642), 13 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:37:38,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:38,177 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:38,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 16:37:38,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-30 16:37:38,382 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:38,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:38,383 INFO L85 PathProgramCache]: Analyzing trace with hash 801734806, now seen corresponding path program 1 times [2023-08-30 16:37:38,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:38,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602473288] [2023-08-30 16:37:38,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:38,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:38,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:37:38,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:38,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602473288] [2023-08-30 16:37:38,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602473288] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:38,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:38,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:37:38,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007702101] [2023-08-30 16:37:38,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:38,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:37:38,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:38,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:37:38,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:37:38,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 154 [2023-08-30 16:37:38,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 383 flow. Second operand has 7 states, 7 states have (on average 52.142857142857146) internal successors, (365), 7 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:37:38,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:38,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 154 [2023-08-30 16:37:38,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:38,883 INFO L130 PetriNetUnfolder]: 1329/2543 cut-off events. [2023-08-30 16:37:38,884 INFO L131 PetriNetUnfolder]: For 1710/1726 co-relation queries the response was YES. [2023-08-30 16:37:38,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6648 conditions, 2543 events. 1329/2543 cut-off events. For 1710/1726 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17595 event pairs, 476 based on Foata normal form. 10/2537 useless extension candidates. Maximal degree in co-relation 3973. Up to 968 conditions per place. [2023-08-30 16:37:38,898 INFO L137 encePairwiseOnDemand]: 143/154 looper letters, 89 selfloop transitions, 13 changer transitions 0/118 dead transitions. [2023-08-30 16:37:38,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 118 transitions, 767 flow [2023-08-30 16:37:38,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:37:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:37:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 496 transitions. [2023-08-30 16:37:38,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4025974025974026 [2023-08-30 16:37:38,901 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 496 transitions. [2023-08-30 16:37:38,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 496 transitions. [2023-08-30 16:37:38,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:38,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 496 transitions. [2023-08-30 16:37:38,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 62.0) internal successors, (496), 8 states have internal predecessors, (496), 0 states have call successors, (0), 0 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:37:38,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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:37:38,905 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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:37:38,905 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 383 flow. Second operand 8 states and 496 transitions. [2023-08-30 16:37:38,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 118 transitions, 767 flow [2023-08-30 16:37:38,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 118 transitions, 708 flow, removed 10 selfloop flow, removed 9 redundant places. [2023-08-30 16:37:38,911 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 372 flow [2023-08-30 16:37:38,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2023-08-30 16:37:38,912 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 30 predicate places. [2023-08-30 16:37:38,912 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 372 flow [2023-08-30 16:37:38,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.142857142857146) internal successors, (365), 7 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:37:38,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:38,913 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:38,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 16:37:38,913 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:38,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:38,914 INFO L85 PathProgramCache]: Analyzing trace with hash 346429423, now seen corresponding path program 1 times [2023-08-30 16:37:38,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:38,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733435177] [2023-08-30 16:37:38,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:38,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:37:39,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:39,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733435177] [2023-08-30 16:37:39,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733435177] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 16:37:39,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479035997] [2023-08-30 16:37:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:39,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 16:37:39,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:37:39,037 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 16:37:39,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 16:37:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:39,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 16:37:39,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 16:37:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:37:39,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 16:37:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 16:37:39,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479035997] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 16:37:39,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 16:37:39,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 16:37:39,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618914510] [2023-08-30 16:37:39,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 16:37:39,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 16:37:39,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:39,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 16:37:39,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-08-30 16:37:39,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 154 [2023-08-30 16:37:39,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 372 flow. Second operand has 13 states, 13 states have (on average 49.69230769230769) internal successors, (646), 13 states have internal predecessors, (646), 0 states have call successors, (0), 0 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:37:39,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:39,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 154 [2023-08-30 16:37:39,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:39,905 INFO L130 PetriNetUnfolder]: 1166/2227 cut-off events. [2023-08-30 16:37:39,905 INFO L131 PetriNetUnfolder]: For 1142/1158 co-relation queries the response was YES. [2023-08-30 16:37:39,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5714 conditions, 2227 events. 1166/2227 cut-off events. For 1142/1158 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15047 event pairs, 389 based on Foata normal form. 6/2212 useless extension candidates. Maximal degree in co-relation 4058. Up to 833 conditions per place. [2023-08-30 16:37:39,915 INFO L137 encePairwiseOnDemand]: 139/154 looper letters, 87 selfloop transitions, 32 changer transitions 0/134 dead transitions. [2023-08-30 16:37:39,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 134 transitions, 836 flow [2023-08-30 16:37:39,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 16:37:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 16:37:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 723 transitions. [2023-08-30 16:37:39,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611388611388611 [2023-08-30 16:37:39,918 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 723 transitions. [2023-08-30 16:37:39,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 723 transitions. [2023-08-30 16:37:39,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:39,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 723 transitions. [2023-08-30 16:37:39,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 55.61538461538461) internal successors, (723), 13 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:37:39,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 154.0) internal successors, (2156), 14 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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:37:39,923 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 154.0) internal successors, (2156), 14 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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:37:39,924 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 372 flow. Second operand 13 states and 723 transitions. [2023-08-30 16:37:39,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 134 transitions, 836 flow [2023-08-30 16:37:39,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 134 transitions, 812 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 16:37:39,929 INFO L231 Difference]: Finished difference. Result has 94 places, 72 transitions, 435 flow [2023-08-30 16:37:39,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=435, PETRI_PLACES=94, PETRI_TRANSITIONS=72} [2023-08-30 16:37:39,929 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 39 predicate places. [2023-08-30 16:37:39,930 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 72 transitions, 435 flow [2023-08-30 16:37:39,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 49.69230769230769) internal successors, (646), 13 states have internal predecessors, (646), 0 states have call successors, (0), 0 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:37:39,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:39,930 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:39,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-30 16:37:40,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-30 16:37:40,137 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:40,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:40,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1141655469, now seen corresponding path program 1 times [2023-08-30 16:37:40,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:40,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15032263] [2023-08-30 16:37:40,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:40,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:37:40,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:40,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15032263] [2023-08-30 16:37:40,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15032263] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:40,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:40,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:37:40,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712272555] [2023-08-30 16:37:40,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:40,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:37:40,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:40,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:37:40,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:37:40,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 154 [2023-08-30 16:37:40,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 72 transitions, 435 flow. Second operand has 7 states, 7 states have (on average 52.285714285714285) internal successors, (366), 7 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:37:40,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:40,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 154 [2023-08-30 16:37:40,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:40,538 INFO L130 PetriNetUnfolder]: 965/1890 cut-off events. [2023-08-30 16:37:40,539 INFO L131 PetriNetUnfolder]: For 1097/1109 co-relation queries the response was YES. [2023-08-30 16:37:40,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4960 conditions, 1890 events. 965/1890 cut-off events. For 1097/1109 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12495 event pairs, 384 based on Foata normal form. 6/1881 useless extension candidates. Maximal degree in co-relation 3399. Up to 780 conditions per place. [2023-08-30 16:37:40,547 INFO L137 encePairwiseOnDemand]: 143/154 looper letters, 84 selfloop transitions, 13 changer transitions 1/115 dead transitions. [2023-08-30 16:37:40,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 115 transitions, 785 flow [2023-08-30 16:37:40,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:37:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:37:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 487 transitions. [2023-08-30 16:37:40,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3952922077922078 [2023-08-30 16:37:40,550 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 487 transitions. [2023-08-30 16:37:40,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 487 transitions. [2023-08-30 16:37:40,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:40,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 487 transitions. [2023-08-30 16:37:40,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 60.875) internal successors, (487), 8 states have internal predecessors, (487), 0 states have call successors, (0), 0 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:37:40,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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:37:40,554 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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:37:40,554 INFO L175 Difference]: Start difference. First operand has 94 places, 72 transitions, 435 flow. Second operand 8 states and 487 transitions. [2023-08-30 16:37:40,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 115 transitions, 785 flow [2023-08-30 16:37:40,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 115 transitions, 750 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-30 16:37:40,560 INFO L231 Difference]: Finished difference. Result has 97 places, 74 transitions, 458 flow [2023-08-30 16:37:40,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=458, PETRI_PLACES=97, PETRI_TRANSITIONS=74} [2023-08-30 16:37:40,561 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 42 predicate places. [2023-08-30 16:37:40,561 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 74 transitions, 458 flow [2023-08-30 16:37:40,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.285714285714285) internal successors, (366), 7 states have internal predecessors, (366), 0 states have call successors, (0), 0 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:37:40,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:40,562 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:40,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 16:37:40,562 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:40,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2059458919, now seen corresponding path program 1 times [2023-08-30 16:37:40,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:40,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458630085] [2023-08-30 16:37:40,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:40,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:37:40,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:40,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458630085] [2023-08-30 16:37:40,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458630085] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:40,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:40,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:37:40,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307507581] [2023-08-30 16:37:40,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:40,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:37:40,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:40,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:37:40,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:37:40,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 154 [2023-08-30 16:37:40,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 74 transitions, 458 flow. Second operand has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 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:37:40,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:40,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 154 [2023-08-30 16:37:40,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:40,971 INFO L130 PetriNetUnfolder]: 712/1426 cut-off events. [2023-08-30 16:37:40,971 INFO L131 PetriNetUnfolder]: For 1139/1147 co-relation queries the response was YES. [2023-08-30 16:37:40,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3845 conditions, 1426 events. 712/1426 cut-off events. For 1139/1147 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8866 event pairs, 340 based on Foata normal form. 6/1417 useless extension candidates. Maximal degree in co-relation 3351. Up to 736 conditions per place. [2023-08-30 16:37:40,980 INFO L137 encePairwiseOnDemand]: 143/154 looper letters, 71 selfloop transitions, 13 changer transitions 0/101 dead transitions. [2023-08-30 16:37:40,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 712 flow [2023-08-30 16:37:40,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:37:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:37:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 473 transitions. [2023-08-30 16:37:40,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2023-08-30 16:37:40,982 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 473 transitions. [2023-08-30 16:37:40,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 473 transitions. [2023-08-30 16:37:40,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:40,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 473 transitions. [2023-08-30 16:37:40,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 59.125) internal successors, (473), 8 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:37:40,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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:37:40,987 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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:37:40,988 INFO L175 Difference]: Start difference. First operand has 97 places, 74 transitions, 458 flow. Second operand 8 states and 473 transitions. [2023-08-30 16:37:40,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 712 flow [2023-08-30 16:37:40,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 101 transitions, 687 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 16:37:40,993 INFO L231 Difference]: Finished difference. Result has 103 places, 75 transitions, 474 flow [2023-08-30 16:37:40,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=474, PETRI_PLACES=103, PETRI_TRANSITIONS=75} [2023-08-30 16:37:40,994 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2023-08-30 16:37:40,994 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 75 transitions, 474 flow [2023-08-30 16:37:40,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 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:37:40,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:40,995 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:40,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 16:37:40,995 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:40,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1668575763, now seen corresponding path program 1 times [2023-08-30 16:37:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:40,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175741322] [2023-08-30 16:37:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:40,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:37:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 16:37:41,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:37:41,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175741322] [2023-08-30 16:37:41,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175741322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:37:41,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:37:41,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:37:41,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812734209] [2023-08-30 16:37:41,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:37:41,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:37:41,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:37:41,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:37:41,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:37:41,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 154 [2023-08-30 16:37:41,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 75 transitions, 474 flow. Second operand has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 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:37:41,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:37:41,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 154 [2023-08-30 16:37:41,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:37:41,366 INFO L130 PetriNetUnfolder]: 472/970 cut-off events. [2023-08-30 16:37:41,366 INFO L131 PetriNetUnfolder]: For 812/824 co-relation queries the response was YES. [2023-08-30 16:37:41,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 970 events. 472/970 cut-off events. For 812/824 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5403 event pairs, 248 based on Foata normal form. 6/964 useless extension candidates. Maximal degree in co-relation 2472. Up to 620 conditions per place. [2023-08-30 16:37:41,372 INFO L137 encePairwiseOnDemand]: 142/154 looper letters, 64 selfloop transitions, 14 changer transitions 1/97 dead transitions. [2023-08-30 16:37:41,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 97 transitions, 711 flow [2023-08-30 16:37:41,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:37:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:37:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 518 transitions. [2023-08-30 16:37:41,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37373737373737376 [2023-08-30 16:37:41,376 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 518 transitions. [2023-08-30 16:37:41,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 518 transitions. [2023-08-30 16:37:41,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:37:41,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 518 transitions. [2023-08-30 16:37:41,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 57.55555555555556) internal successors, (518), 9 states have internal predecessors, (518), 0 states have call successors, (0), 0 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:37:41,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 154.0) internal successors, (1540), 10 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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:37:41,380 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 154.0) internal successors, (1540), 10 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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:37:41,380 INFO L175 Difference]: Start difference. First operand has 103 places, 75 transitions, 474 flow. Second operand 9 states and 518 transitions. [2023-08-30 16:37:41,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 97 transitions, 711 flow [2023-08-30 16:37:41,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 97 transitions, 674 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-08-30 16:37:41,387 INFO L231 Difference]: Finished difference. Result has 106 places, 76 transitions, 480 flow [2023-08-30 16:37:41,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=480, PETRI_PLACES=106, PETRI_TRANSITIONS=76} [2023-08-30 16:37:41,388 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 51 predicate places. [2023-08-30 16:37:41,388 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 76 transitions, 480 flow [2023-08-30 16:37:41,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 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:37:41,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:37:41,388 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 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:37:41,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 16:37:41,389 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 16:37:41,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:37:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1360542986, now seen corresponding path program 1 times [2023-08-30 16:37:41,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:37:41,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18026950] [2023-08-30 16:37:41,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:37:41,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:37:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:37:41,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:37:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:37:41,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:37:41,463 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:37:41,465 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-30 16:37:41,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-30 16:37:41,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-30 16:37:41,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-30 16:37:41,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 16:37:41,466 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:37:41,467 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-30 16:37:41,468 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-08-30 16:37:41,468 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:37:41,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:37:41 BasicIcfg [2023-08-30 16:37:41,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:37:41,527 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:37:41,528 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:37:41,528 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:37:41,528 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:37:18" (3/4) ... [2023-08-30 16:37:41,530 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:37:41,593 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:37:41,593 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:37:41,593 INFO L158 Benchmark]: Toolchain (without parser) took 23651.43ms. Allocated memory was 71.3MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 48.1MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 776.3MB. Max. memory is 16.1GB. [2023-08-30 16:37:41,594 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory was 36.8MB in the beginning and 36.7MB in the end (delta: 57.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:37:41,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.03ms. Allocated memory is still 71.3MB. Free memory was 47.9MB in the beginning and 48.5MB in the end (delta: -658.5kB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2023-08-30 16:37:41,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.82ms. Allocated memory is still 71.3MB. Free memory was 48.5MB in the beginning and 46.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:37:41,595 INFO L158 Benchmark]: Boogie Preprocessor took 45.15ms. Allocated memory is still 71.3MB. Free memory was 46.5MB in the beginning and 44.9MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 16:37:41,595 INFO L158 Benchmark]: RCFGBuilder took 424.77ms. Allocated memory is still 71.3MB. Free memory was 44.9MB in the beginning and 27.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:37:41,596 INFO L158 Benchmark]: TraceAbstraction took 22593.98ms. Allocated memory was 71.3MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 49.6MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 767.1MB. Max. memory is 16.1GB. [2023-08-30 16:37:41,596 INFO L158 Benchmark]: Witness Printer took 65.55ms. Allocated memory is still 3.3GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-30 16:37:41,602 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.19ms. Allocated memory is still 58.7MB. Free memory was 36.8MB in the beginning and 36.7MB in the end (delta: 57.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.03ms. Allocated memory is still 71.3MB. Free memory was 47.9MB in the beginning and 48.5MB in the end (delta: -658.5kB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.82ms. Allocated memory is still 71.3MB. Free memory was 48.5MB in the beginning and 46.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.15ms. Allocated memory is still 71.3MB. Free memory was 46.5MB in the beginning and 44.9MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 424.77ms. Allocated memory is still 71.3MB. Free memory was 44.9MB in the beginning and 27.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22593.98ms. Allocated memory was 71.3MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 49.6MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 767.1MB. Max. memory is 16.1GB. * Witness Printer took 65.55ms. Allocated memory is still 3.3GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 49 PlacesBefore, 11 PlacesAfterwards, 49 TransitionsBefore, 8 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 50 TotalNumberOfCompositions, 520 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 520, independent: 520, independent conditional: 0, independent unconditional: 520, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 309, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 520, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 309, unknown conditional: 0, unknown unconditional: 309] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 49 PlacesBefore, 11 PlacesAfterwards, 49 TransitionsBefore, 8 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 3 ChoiceCompositions, 50 TotalNumberOfCompositions, 522 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 522, independent: 522, independent conditional: 0, independent unconditional: 522, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 309, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 522, independent: 213, independent conditional: 0, independent unconditional: 213, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 309, unknown conditional: 0, unknown unconditional: 309] , Statistics on independence cache: Total cache size (in pairs): 2, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 72 PlacesBefore, 39 PlacesAfterwards, 72 TransitionsBefore, 36 TransitionsAfterwards, 2156 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 47 TotalNumberOfCompositions, 8141 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3041, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1012, independent: 986, independent conditional: 0, independent unconditional: 986, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3041, independent: 1787, independent conditional: 0, independent unconditional: 1787, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 1012, unknown conditional: 0, unknown unconditional: 1012] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, 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 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 72 PlacesBefore, 39 PlacesAfterwards, 72 TransitionsBefore, 36 TransitionsAfterwards, 2156 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 47 TotalNumberOfCompositions, 8141 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2953, independent: 2685, independent conditional: 0, independent unconditional: 2685, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 995, independent: 972, independent conditional: 0, independent unconditional: 972, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2953, independent: 1713, independent conditional: 0, independent unconditional: 1713, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 995, unknown conditional: 0, unknown unconditional: 995] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 95 PlacesBefore, 55 PlacesAfterwards, 95 TransitionsBefore, 51 TransitionsAfterwards, 4752 CoEnabledTransitionPairs, 5 FixpointIterations, 12 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 59 TotalNumberOfCompositions, 20874 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8432, independent: 8017, independent conditional: 0, independent unconditional: 8017, dependent: 415, dependent conditional: 0, dependent unconditional: 415, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2330, independent: 2266, independent conditional: 0, independent unconditional: 2266, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8432, independent: 5751, independent conditional: 0, independent unconditional: 5751, dependent: 351, dependent conditional: 0, dependent unconditional: 351, unknown: 2330, unknown conditional: 0, unknown unconditional: 2330] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 405, Positive conditional cache size: 0, Positive unconditional cache size: 405, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 728]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 volatile unsigned int count = 0; [L705] 0 _Bool MTX = 0; [L706] 0 _Bool COND = 0; [L732] 0 pthread_t t; VAL [COND=0, MTX=0, count=0, t={3:0}] [L733] COND TRUE 0 1 [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=0, count=0, pthread_create(&t, 0, thr1, 0)=5, t={3:0}] [L733] COND TRUE 0 1 [L727] CALL 1 Barrier2() [L718] CALL 1 __VERIFIER_atomic_acquire() [L709] CALL 1 assume_abort_if_not(MTX==0) [L3] COND FALSE 1 !(!cond) [L709] RET 1 assume_abort_if_not(MTX==0) [L710] 1 MTX = 1 [L718] RET 1 __VERIFIER_atomic_acquire() [L719] 1 count++ VAL [COND=0, MTX=1, count++=0, count=0] [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=1, count=0, pthread_create(&t, 0, thr1, 0)=6, t={3:0}] [L733] COND TRUE 0 1 [L733] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [COND=0, MTX=1, count=0, pthread_create(&t, 0, thr1, 0)=7, t={3:0}] [L719] 1 count++ [L720] COND FALSE 1 !(count == 3) VAL [COND=0, MTX=1, count=1] [L724] CALL 1 __VERIFIER_atomic_release() [L714] CALL 1 assume_abort_if_not(MTX==1) [L3] COND FALSE 1 !(!cond) [L714] RET 1 assume_abort_if_not(MTX==1) [L715] 1 MTX = 0 [L724] RET 1 __VERIFIER_atomic_release() [L727] CALL 2 Barrier2() [L718] CALL 2 __VERIFIER_atomic_acquire() [L709] CALL 2 assume_abort_if_not(MTX==0) [L3] COND FALSE 2 !(!cond) [L709] RET 2 assume_abort_if_not(MTX==0) [L710] 2 MTX = 1 [L718] RET 2 __VERIFIER_atomic_acquire() [L719] 2 count++ VAL [COND=0, MTX=1, count=2] [L720] COND FALSE 2 !(count == 3) VAL [COND=0, MTX=1, count=2] [L724] CALL 2 __VERIFIER_atomic_release() [L714] CALL 2 assume_abort_if_not(MTX==1) [L3] COND FALSE 2 !(!cond) [L714] RET 2 assume_abort_if_not(MTX==1) [L715] 2 MTX = 0 [L724] RET 2 __VERIFIER_atomic_release() [L727] CALL 3 Barrier2() [L718] CALL 3 __VERIFIER_atomic_acquire() [L709] CALL 3 assume_abort_if_not(MTX==0) [L3] COND FALSE 3 !(!cond) [L709] RET 3 assume_abort_if_not(MTX==0) [L710] 3 MTX = 1 [L718] RET 3 __VERIFIER_atomic_acquire() [L719] 3 count++ [L720] COND TRUE 3 count == 3 VAL [COND=0, MTX=1, count=3] [L721] 3 COND = 1 VAL [COND=1, MTX=1, count=3] [L722] 3 count = 0 VAL [COND=1, MTX=1, count=0] [L725] CALL 3 __VERIFIER_atomic_release() [L714] CALL 3 assume_abort_if_not(MTX==1) [L3] COND FALSE 3 !(!cond) [L714] RET 3 assume_abort_if_not(MTX==1) [L715] 3 MTX = 0 [L725] RET 3 __VERIFIER_atomic_release() [L727] RET 3 Barrier2() [L728] 3 reach_error() VAL [COND=1, MTX=0, arg={0:0}, arg={0:0}, count=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 68 locations, 3 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: 3.1s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 13 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 3, 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.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 89 locations, 4 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: 3.6s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 113 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 752 IncrementalHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 17 mSDtfsCounter, 752 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=3, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 539 SizeOfPredicates, 5 NumberOfNonLiveVariables, 240 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 10/14 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 110 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.9s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1292 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1116 mSDsluCounter, 547 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 404 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3345 IncrementalHoareTripleChecker+Invalid, 3513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 143 mSDtfsCounter, 3345 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=3, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 1856 SizeOfPredicates, 9 NumberOfNonLiveVariables, 382 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 48/70 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 68 locations, 3 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: 2.0s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 89 locations, 4 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: 0.8s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.8s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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:37:41,636 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