./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7095f70ba7104a12a93da2a0b557c5b5c6880d23caa33c7c2fd19334f4cb537 --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-29 23:41:57,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 23:41:57,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 23:41:57,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 23:41:57,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 23:41:57,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 23:41:57,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 23:41:57,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 23:41:57,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 23:41:57,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 23:41:57,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 23:41:57,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 23:41:57,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 23:41:57,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 23:41:57,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 23:41:57,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 23:41:57,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 23:41:57,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 23:41:57,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 23:41:57,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 23:41:57,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 23:41:57,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 23:41:57,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 23:41:57,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 23:41:57,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 23:41:57,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 23:41:57,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 23:41:57,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 23:41:57,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 23:41:57,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 23:41:57,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 23:41:57,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 23:41:57,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 23:41:57,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 23:41:57,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 23:41:57,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 23:41:57,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 23:41:57,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 23:41:57,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 23:41:57,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 23:41:57,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 23:41:57,535 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 23:41:57,567 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 23:41:57,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 23:41:57,569 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 23:41:57,569 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 23:41:57,570 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 23:41:57,570 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 23:41:57,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 23:41:57,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 23:41:57,571 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 23:41:57,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 23:41:57,572 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 23:41:57,573 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 23:41:57,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 23:41:57,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 23:41:57,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 23:41:57,573 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 23:41:57,573 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 23:41:57,573 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 23:41:57,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 23:41:57,574 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 23:41:57,574 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 23:41:57,574 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 23:41:57,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 23:41:57,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 23:41:57,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 23:41:57,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 23:41:57,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 23:41:57,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 23:41:57,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 23:41:57,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 23:41:57,575 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 23:41:57,575 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 23:41:57,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 23:41:57,576 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 23:41:57,576 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c7095f70ba7104a12a93da2a0b557c5b5c6880d23caa33c7c2fd19334f4cb537 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-29 23:41:57,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 23:41:57,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 23:41:57,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 23:41:57,853 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 23:41:57,853 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 23:41:57,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-08-29 23:41:58,844 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 23:41:59,027 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 23:41:59,027 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-08-29 23:41:59,032 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0670afb1e/4f958ff549344b40943d26137a9086e5/FLAGdb564ebbf [2023-08-29 23:41:59,045 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0670afb1e/4f958ff549344b40943d26137a9086e5 [2023-08-29 23:41:59,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 23:41:59,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 23:41:59,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 23:41:59,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 23:41:59,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 23:41:59,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 11:41:59" (1/1) ... [2023-08-29 23:41:59,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488766f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59, skipping insertion in model container [2023-08-29 23:41:59,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 11:41:59" (1/1) ... [2023-08-29 23:41:59,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 23:41:59,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 23:41:59,201 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2023-08-29 23:41:59,204 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 23:41:59,210 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 23:41:59,232 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2023-08-29 23:41:59,233 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 23:41:59,238 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 23:41:59,238 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 23:41:59,242 INFO L208 MainTranslator]: Completed translation [2023-08-29 23:41:59,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59 WrapperNode [2023-08-29 23:41:59,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 23:41:59,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 23:41:59,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 23:41:59,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 23:41:59,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59" (1/1) ... [2023-08-29 23:41:59,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59" (1/1) ... [2023-08-29 23:41:59,296 INFO L138 Inliner]: procedures = 25, calls = 100, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 288 [2023-08-29 23:41:59,296 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 23:41:59,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 23:41:59,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 23:41:59,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 23:41:59,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59" (1/1) ... [2023-08-29 23:41:59,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59" (1/1) ... [2023-08-29 23:41:59,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59" (1/1) ... [2023-08-29 23:41:59,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59" (1/1) ... [2023-08-29 23:41:59,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59" (1/1) ... [2023-08-29 23:41:59,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59" (1/1) ... [2023-08-29 23:41:59,319 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59" (1/1) ... [2023-08-29 23:41:59,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59" (1/1) ... [2023-08-29 23:41:59,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 23:41:59,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 23:41:59,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 23:41:59,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 23:41:59,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59" (1/1) ... [2023-08-29 23:41:59,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 23:41:59,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 23:41:59,354 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-29 23:41:59,370 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-29 23:41:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 23:41:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 23:41:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 23:41:59,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 23:41:59,381 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-29 23:41:59,381 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-29 23:41:59,381 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-29 23:41:59,381 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-29 23:41:59,381 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-29 23:41:59,381 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-29 23:41:59,381 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-29 23:41:59,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-29 23:41:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 23:41:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-29 23:41:59,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-29 23:41:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-29 23:41:59,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-29 23:41:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 23:41:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 23:41:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 23:41:59,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 23:41:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 23:41:59,384 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 23:41:59,522 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 23:41:59,524 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 23:41:59,873 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 23:41:59,934 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 23:41:59,934 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 23:41:59,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 11:41:59 BoogieIcfgContainer [2023-08-29 23:41:59,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 23:41:59,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 23:41:59,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 23:41:59,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 23:41:59,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 11:41:59" (1/3) ... [2023-08-29 23:41:59,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42152f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 11:41:59, skipping insertion in model container [2023-08-29 23:41:59,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 11:41:59" (2/3) ... [2023-08-29 23:41:59,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42152f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 11:41:59, skipping insertion in model container [2023-08-29 23:41:59,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 11:41:59" (3/3) ... [2023-08-29 23:41:59,942 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-6.wvr.c [2023-08-29 23:41:59,952 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 23:41:59,952 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-08-29 23:41:59,953 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 23:42:00,019 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-08-29 23:42:00,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 219 transitions, 486 flow [2023-08-29 23:42:00,160 INFO L130 PetriNetUnfolder]: 2/213 cut-off events. [2023-08-29 23:42:00,160 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 23:42:00,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 213 events. 2/213 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 161 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 157. Up to 2 conditions per place. [2023-08-29 23:42:00,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 219 transitions, 486 flow [2023-08-29 23:42:00,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 209 transitions, 454 flow [2023-08-29 23:42:00,172 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 23:42:00,184 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 209 transitions, 454 flow [2023-08-29 23:42:00,187 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 209 transitions, 454 flow [2023-08-29 23:42:00,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 209 transitions, 454 flow [2023-08-29 23:42:00,263 INFO L130 PetriNetUnfolder]: 2/209 cut-off events. [2023-08-29 23:42:00,263 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-29 23:42:00,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 209 events. 2/209 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 160 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 157. Up to 2 conditions per place. [2023-08-29 23:42:00,266 INFO L119 LiptonReduction]: Number of co-enabled transitions 3930 [2023-08-29 23:42:08,803 INFO L134 LiptonReduction]: Checked pairs total: 22494 [2023-08-29 23:42:08,803 INFO L136 LiptonReduction]: Total number of compositions: 180 [2023-08-29 23:42:08,813 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 23:42:08,820 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7a3b8acd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 23:42:08,820 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2023-08-29 23:42:08,824 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 23:42:08,824 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 23:42:08,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:42:08,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 23:42:08,827 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:42:08,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:42:08,831 INFO L85 PathProgramCache]: Analyzing trace with hash 856, now seen corresponding path program 1 times [2023-08-29 23:42:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:42:08,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533998165] [2023-08-29 23:42:08,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:42:08,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:42:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:42:08,914 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-29 23:42:08,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:42:08,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533998165] [2023-08-29 23:42:08,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533998165] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:42:08,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:42:08,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 23:42:08,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507669155] [2023-08-29 23:42:08,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:42:08,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 23:42:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:42:08,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 23:42:08,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 23:42:08,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 399 [2023-08-29 23:42:08,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 75 transitions, 186 flow. Second operand has 2 states, 2 states have (on average 186.5) internal successors, (373), 2 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:08,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:42:08,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 399 [2023-08-29 23:42:08,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:42:17,813 INFO L130 PetriNetUnfolder]: 107865/140648 cut-off events. [2023-08-29 23:42:17,813 INFO L131 PetriNetUnfolder]: For 3091/3091 co-relation queries the response was YES. [2023-08-29 23:42:18,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279915 conditions, 140648 events. 107865/140648 cut-off events. For 3091/3091 co-relation queries the response was YES. Maximal size of possible extension queue 5167. Compared 887494 event pairs, 107865 based on Foata normal form. 0/126595 useless extension candidates. Maximal degree in co-relation 229388. Up to 135165 conditions per place. [2023-08-29 23:42:18,731 INFO L137 encePairwiseOnDemand]: 396/399 looper letters, 65 selfloop transitions, 0 changer transitions 0/72 dead transitions. [2023-08-29 23:42:18,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 72 transitions, 310 flow [2023-08-29 23:42:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 23:42:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 23:42:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 440 transitions. [2023-08-29 23:42:18,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5513784461152882 [2023-08-29 23:42:18,750 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 440 transitions. [2023-08-29 23:42:18,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 440 transitions. [2023-08-29 23:42:18,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:42:18,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 440 transitions. [2023-08-29 23:42:18,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 220.0) internal successors, (440), 2 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:18,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:18,764 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:18,765 INFO L175 Difference]: Start difference. First operand has 94 places, 75 transitions, 186 flow. Second operand 2 states and 440 transitions. [2023-08-29 23:42:18,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 72 transitions, 310 flow [2023-08-29 23:42:19,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 286 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-29 23:42:19,237 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 156 flow [2023-08-29 23:42:19,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=156, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2023-08-29 23:42:19,241 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -14 predicate places. [2023-08-29 23:42:19,242 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 156 flow [2023-08-29 23:42:19,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 186.5) internal successors, (373), 2 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:19,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:42:19,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 23:42:19,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 23:42:19,243 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:42:19,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:42:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash 843898, now seen corresponding path program 1 times [2023-08-29 23:42:19,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:42:19,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38693980] [2023-08-29 23:42:19,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:42:19,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:42:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:42:19,721 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-29 23:42:19,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:42:19,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38693980] [2023-08-29 23:42:19,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38693980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:42:19,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:42:19,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:42:19,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545622720] [2023-08-29 23:42:19,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:42:19,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:42:19,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:42:19,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:42:19,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:42:19,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 399 [2023-08-29 23:42:19,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:19,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:42:19,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 399 [2023-08-29 23:42:19,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:42:25,853 INFO L130 PetriNetUnfolder]: 104022/135775 cut-off events. [2023-08-29 23:42:25,854 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-08-29 23:42:26,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267436 conditions, 135775 events. 104022/135775 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 5105. Compared 856881 event pairs, 104022 based on Foata normal form. 0/122750 useless extension candidates. Maximal degree in co-relation 267433. Up to 130293 conditions per place. [2023-08-29 23:42:26,428 INFO L137 encePairwiseOnDemand]: 396/399 looper letters, 62 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2023-08-29 23:42:26,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 70 transitions, 278 flow [2023-08-29 23:42:26,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:42:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:42:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2023-08-29 23:42:26,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878863826232247 [2023-08-29 23:42:26,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 584 transitions. [2023-08-29 23:42:26,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 584 transitions. [2023-08-29 23:42:26,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:42:26,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 584 transitions. [2023-08-29 23:42:26,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:26,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:26,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:26,437 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 156 flow. Second operand 3 states and 584 transitions. [2023-08-29 23:42:26,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 70 transitions, 278 flow [2023-08-29 23:42:26,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 70 transitions, 278 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 23:42:26,439 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 154 flow [2023-08-29 23:42:26,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2023-08-29 23:42:26,441 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -14 predicate places. [2023-08-29 23:42:26,441 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 154 flow [2023-08-29 23:42:26,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:26,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:42:26,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 23:42:26,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 23:42:26,442 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:42:26,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:42:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash 843897, now seen corresponding path program 1 times [2023-08-29 23:42:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:42:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727673436] [2023-08-29 23:42:26,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:42:26,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:42:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:42:26,680 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-29 23:42:26,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:42:26,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727673436] [2023-08-29 23:42:26,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727673436] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:42:26,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:42:26,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:42:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898139731] [2023-08-29 23:42:26,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:42:26,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:42:26,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:42:26,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:42:26,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:42:26,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 399 [2023-08-29 23:42:26,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:26,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:42:26,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 399 [2023-08-29 23:42:26,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:42:32,460 INFO L130 PetriNetUnfolder]: 100179/130902 cut-off events. [2023-08-29 23:42:32,461 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-08-29 23:42:32,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257694 conditions, 130902 events. 100179/130902 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 5070. Compared 826643 event pairs, 100179 based on Foata normal form. 0/118905 useless extension candidates. Maximal degree in co-relation 257690. Up to 125422 conditions per place. [2023-08-29 23:42:33,273 INFO L137 encePairwiseOnDemand]: 396/399 looper letters, 60 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2023-08-29 23:42:33,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 68 transitions, 272 flow [2023-08-29 23:42:33,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:42:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:42:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2023-08-29 23:42:33,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48872180451127817 [2023-08-29 23:42:33,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 585 transitions. [2023-08-29 23:42:33,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 585 transitions. [2023-08-29 23:42:33,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:42:33,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 585 transitions. [2023-08-29 23:42:33,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:33,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:33,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:33,279 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 154 flow. Second operand 3 states and 585 transitions. [2023-08-29 23:42:33,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 68 transitions, 272 flow [2023-08-29 23:42:33,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 68 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:42:33,281 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 151 flow [2023-08-29 23:42:33,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2023-08-29 23:42:33,282 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -15 predicate places. [2023-08-29 23:42:33,282 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 151 flow [2023-08-29 23:42:33,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:33,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:42:33,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 23:42:33,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 23:42:33,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:42:33,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:42:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash 811004555, now seen corresponding path program 1 times [2023-08-29 23:42:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:42:33,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223499445] [2023-08-29 23:42:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:42:33,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:42:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:42:33,356 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-29 23:42:33,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:42:33,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223499445] [2023-08-29 23:42:33,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223499445] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:42:33,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:42:33,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:42:33,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609601172] [2023-08-29 23:42:33,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:42:33,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:42:33,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:42:33,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:42:33,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:42:33,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 399 [2023-08-29 23:42:33,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:33,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:42:33,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 399 [2023-08-29 23:42:33,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:42:39,075 INFO L130 PetriNetUnfolder]: 99387/129834 cut-off events. [2023-08-29 23:42:39,076 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-08-29 23:42:39,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255563 conditions, 129834 events. 99387/129834 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 5070. Compared 820046 event pairs, 99387 based on Foata normal form. 0/118110 useless extension candidates. Maximal degree in co-relation 255559. Up to 124358 conditions per place. [2023-08-29 23:42:39,741 INFO L137 encePairwiseOnDemand]: 396/399 looper letters, 58 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2023-08-29 23:42:39,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 265 flow [2023-08-29 23:42:39,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:42:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:42:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2023-08-29 23:42:39,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48454469507101083 [2023-08-29 23:42:39,744 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2023-08-29 23:42:39,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2023-08-29 23:42:39,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:42:39,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2023-08-29 23:42:39,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:39,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:39,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:39,747 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 151 flow. Second operand 3 states and 580 transitions. [2023-08-29 23:42:39,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 265 flow [2023-08-29 23:42:39,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 66 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:42:39,750 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 148 flow [2023-08-29 23:42:39,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2023-08-29 23:42:39,751 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -16 predicate places. [2023-08-29 23:42:39,751 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 148 flow [2023-08-29 23:42:39,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:39,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:42:39,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 23:42:39,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 23:42:39,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:42:39,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:42:39,752 INFO L85 PathProgramCache]: Analyzing trace with hash 811004553, now seen corresponding path program 1 times [2023-08-29 23:42:39,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:42:39,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554223528] [2023-08-29 23:42:39,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:42:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:42:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:42:39,923 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-29 23:42:39,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:42:39,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554223528] [2023-08-29 23:42:39,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554223528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:42:39,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:42:39,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:42:39,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211810592] [2023-08-29 23:42:39,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:42:39,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:42:39,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:42:39,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:42:39,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:42:39,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 399 [2023-08-29 23:42:39,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:39,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:42:39,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 399 [2023-08-29 23:42:39,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:42:45,627 INFO L130 PetriNetUnfolder]: 98595/128766 cut-off events. [2023-08-29 23:42:45,628 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-08-29 23:42:45,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253432 conditions, 128766 events. 98595/128766 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 5070. Compared 813193 event pairs, 98595 based on Foata normal form. 0/117315 useless extension candidates. Maximal degree in co-relation 253428. Up to 123294 conditions per place. [2023-08-29 23:42:46,297 INFO L137 encePairwiseOnDemand]: 396/399 looper letters, 56 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2023-08-29 23:42:46,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 64 transitions, 258 flow [2023-08-29 23:42:46,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:42:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:42:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 581 transitions. [2023-08-29 23:42:46,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853801169590643 [2023-08-29 23:42:46,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 581 transitions. [2023-08-29 23:42:46,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 581 transitions. [2023-08-29 23:42:46,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:42:46,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 581 transitions. [2023-08-29 23:42:46,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:46,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:46,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:46,321 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 148 flow. Second operand 3 states and 581 transitions. [2023-08-29 23:42:46,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 64 transitions, 258 flow [2023-08-29 23:42:46,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 64 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:42:46,323 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 145 flow [2023-08-29 23:42:46,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2023-08-29 23:42:46,326 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -17 predicate places. [2023-08-29 23:42:46,326 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 145 flow [2023-08-29 23:42:46,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:46,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:42:46,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:42:46,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 23:42:46,327 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:42:46,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:42:46,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1986316189, now seen corresponding path program 1 times [2023-08-29 23:42:46,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:42:46,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033416321] [2023-08-29 23:42:46,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:42:46,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:42:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:42:46,425 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-29 23:42:46,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:42:46,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033416321] [2023-08-29 23:42:46,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033416321] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:42:46,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:42:46,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:42:46,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814128301] [2023-08-29 23:42:46,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:42:46,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:42:46,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:42:46,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:42:46,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:42:46,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 399 [2023-08-29 23:42:46,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:46,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:42:46,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 399 [2023-08-29 23:42:46,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:42:52,046 INFO L130 PetriNetUnfolder]: 98307/128318 cut-off events. [2023-08-29 23:42:52,047 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-08-29 23:42:52,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252569 conditions, 128318 events. 98307/128318 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 5070. Compared 809974 event pairs, 98307 based on Foata normal form. 0/117047 useless extension candidates. Maximal degree in co-relation 252565. Up to 122878 conditions per place. [2023-08-29 23:42:52,679 INFO L137 encePairwiseOnDemand]: 396/399 looper letters, 54 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-08-29 23:42:52,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 62 transitions, 251 flow [2023-08-29 23:42:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:42:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:42:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2023-08-29 23:42:52,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48120300751879697 [2023-08-29 23:42:52,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 576 transitions. [2023-08-29 23:42:52,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 576 transitions. [2023-08-29 23:42:52,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:42:52,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 576 transitions. [2023-08-29 23:42:52,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:52,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:52,685 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:52,685 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 145 flow. Second operand 3 states and 576 transitions. [2023-08-29 23:42:52,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 62 transitions, 251 flow [2023-08-29 23:42:52,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 62 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:42:52,686 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 142 flow [2023-08-29 23:42:52,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2023-08-29 23:42:52,687 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -18 predicate places. [2023-08-29 23:42:52,687 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 142 flow [2023-08-29 23:42:52,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:52,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:42:52,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:42:52,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 23:42:52,688 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:42:52,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:42:52,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1986316187, now seen corresponding path program 1 times [2023-08-29 23:42:52,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:42:52,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609958998] [2023-08-29 23:42:52,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:42:52,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:42:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:42:52,763 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-29 23:42:52,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:42:52,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609958998] [2023-08-29 23:42:52,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609958998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:42:52,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:42:52,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:42:52,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092064298] [2023-08-29 23:42:52,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:42:52,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:42:52,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:42:52,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:42:52,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:42:52,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 399 [2023-08-29 23:42:52,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:52,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:42:52,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 399 [2023-08-29 23:42:52,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:42:58,486 INFO L130 PetriNetUnfolder]: 98019/127886 cut-off events. [2023-08-29 23:42:58,486 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-08-29 23:42:58,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251722 conditions, 127886 events. 98019/127886 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 5070. Compared 807037 event pairs, 98019 based on Foata normal form. 0/116747 useless extension candidates. Maximal degree in co-relation 251718. Up to 122462 conditions per place. [2023-08-29 23:42:59,340 INFO L137 encePairwiseOnDemand]: 396/399 looper letters, 52 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2023-08-29 23:42:59,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 60 transitions, 244 flow [2023-08-29 23:42:59,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:42:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:42:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 598 transitions. [2023-08-29 23:42:59,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49958228905597324 [2023-08-29 23:42:59,342 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 598 transitions. [2023-08-29 23:42:59,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 598 transitions. [2023-08-29 23:42:59,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:42:59,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 598 transitions. [2023-08-29 23:42:59,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:59,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:59,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:59,346 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 142 flow. Second operand 3 states and 598 transitions. [2023-08-29 23:42:59,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 60 transitions, 244 flow [2023-08-29 23:42:59,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 60 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:42:59,347 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 139 flow [2023-08-29 23:42:59,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2023-08-29 23:42:59,349 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -19 predicate places. [2023-08-29 23:42:59,349 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 139 flow [2023-08-29 23:42:59,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:59,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:42:59,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:42:59,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 23:42:59,349 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:42:59,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:42:59,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1884397819, now seen corresponding path program 1 times [2023-08-29 23:42:59,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:42:59,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004315420] [2023-08-29 23:42:59,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:42:59,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:42:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:42:59,399 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-29 23:42:59,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:42:59,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004315420] [2023-08-29 23:42:59,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004315420] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:42:59,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:42:59,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:42:59,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742217980] [2023-08-29 23:42:59,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:42:59,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:42:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:42:59,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:42:59,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:42:59,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 399 [2023-08-29 23:42:59,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:42:59,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:42:59,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 399 [2023-08-29 23:42:59,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:43:05,052 INFO L130 PetriNetUnfolder]: 97227/126758 cut-off events. [2023-08-29 23:43:05,052 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-08-29 23:43:05,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249531 conditions, 126758 events. 97227/126758 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 5061. Compared 798720 event pairs, 97227 based on Foata normal form. 0/115891 useless extension candidates. Maximal degree in co-relation 249527. Up to 121398 conditions per place. [2023-08-29 23:43:05,694 INFO L137 encePairwiseOnDemand]: 396/399 looper letters, 50 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2023-08-29 23:43:05,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 58 transitions, 237 flow [2023-08-29 23:43:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:43:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:43:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2023-08-29 23:43:05,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4778613199665831 [2023-08-29 23:43:05,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 572 transitions. [2023-08-29 23:43:05,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 572 transitions. [2023-08-29 23:43:05,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:43:05,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 572 transitions. [2023-08-29 23:43:05,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:05,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:05,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:05,699 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 139 flow. Second operand 3 states and 572 transitions. [2023-08-29 23:43:05,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 58 transitions, 237 flow [2023-08-29 23:43:05,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 58 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:43:05,701 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 136 flow [2023-08-29 23:43:05,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2023-08-29 23:43:05,701 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -20 predicate places. [2023-08-29 23:43:05,701 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 136 flow [2023-08-29 23:43:05,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:05,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:43:05,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:43:05,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 23:43:05,702 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:43:05,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:43:05,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1884397820, now seen corresponding path program 1 times [2023-08-29 23:43:05,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:43:05,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966890710] [2023-08-29 23:43:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:43:05,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:43:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:43:05,810 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-29 23:43:05,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:43:05,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966890710] [2023-08-29 23:43:05,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966890710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:43:05,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:43:05,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:43:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691621680] [2023-08-29 23:43:05,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:43:05,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:43:05,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:43:05,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:43:05,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:43:05,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 399 [2023-08-29 23:43:05,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:05,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:43:05,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 399 [2023-08-29 23:43:05,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:43:11,508 INFO L130 PetriNetUnfolder]: 96435/125630 cut-off events. [2023-08-29 23:43:11,509 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-08-29 23:43:11,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247340 conditions, 125630 events. 96435/125630 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 5052. Compared 790165 event pairs, 96435 based on Foata normal form. 0/115035 useless extension candidates. Maximal degree in co-relation 247336. Up to 120334 conditions per place. [2023-08-29 23:43:12,260 INFO L137 encePairwiseOnDemand]: 396/399 looper letters, 48 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2023-08-29 23:43:12,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 56 transitions, 230 flow [2023-08-29 23:43:12,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:43:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:43:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 594 transitions. [2023-08-29 23:43:12,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2023-08-29 23:43:12,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 594 transitions. [2023-08-29 23:43:12,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 594 transitions. [2023-08-29 23:43:12,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:43:12,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 594 transitions. [2023-08-29 23:43:12,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:12,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:12,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:12,266 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 136 flow. Second operand 3 states and 594 transitions. [2023-08-29 23:43:12,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 56 transitions, 230 flow [2023-08-29 23:43:12,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 56 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:43:12,268 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 133 flow [2023-08-29 23:43:12,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2023-08-29 23:43:12,269 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -21 predicate places. [2023-08-29 23:43:12,269 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 133 flow [2023-08-29 23:43:12,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:12,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:43:12,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:43:12,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 23:43:12,270 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:43:12,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:43:12,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1569875367, now seen corresponding path program 1 times [2023-08-29 23:43:12,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:43:12,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31747012] [2023-08-29 23:43:12,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:43:12,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:43:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:43:12,342 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-29 23:43:12,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:43:12,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31747012] [2023-08-29 23:43:12,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31747012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:43:12,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:43:12,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:43:12,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493691298] [2023-08-29 23:43:12,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:43:12,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:43:12,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:43:12,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:43:12,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:43:12,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 399 [2023-08-29 23:43:12,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:12,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:43:12,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 399 [2023-08-29 23:43:12,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:43:18,292 INFO L130 PetriNetUnfolder]: 92592/120503 cut-off events. [2023-08-29 23:43:18,292 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-08-29 23:43:18,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237343 conditions, 120503 events. 92592/120503 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 4858. Compared 752443 event pairs, 92592 based on Foata normal form. 0/110936 useless extension candidates. Maximal degree in co-relation 237339. Up to 115463 conditions per place. [2023-08-29 23:43:19,030 INFO L137 encePairwiseOnDemand]: 396/399 looper letters, 46 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2023-08-29 23:43:19,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 54 transitions, 223 flow [2023-08-29 23:43:19,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:43:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:43:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2023-08-29 23:43:19,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47451963241436923 [2023-08-29 23:43:19,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2023-08-29 23:43:19,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2023-08-29 23:43:19,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:43:19,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2023-08-29 23:43:19,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:19,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:19,053 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:19,053 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 133 flow. Second operand 3 states and 568 transitions. [2023-08-29 23:43:19,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 54 transitions, 223 flow [2023-08-29 23:43:19,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 54 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:43:19,055 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 130 flow [2023-08-29 23:43:19,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2023-08-29 23:43:19,055 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -22 predicate places. [2023-08-29 23:43:19,056 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 130 flow [2023-08-29 23:43:19,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:19,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:43:19,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:43:19,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 23:43:19,056 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:43:19,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:43:19,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1569875366, now seen corresponding path program 1 times [2023-08-29 23:43:19,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:43:19,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701890552] [2023-08-29 23:43:19,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:43:19,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:43:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:43:19,102 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-29 23:43:19,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:43:19,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701890552] [2023-08-29 23:43:19,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701890552] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:43:19,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:43:19,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:43:19,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053326169] [2023-08-29 23:43:19,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:43:19,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:43:19,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:43:19,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:43:19,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:43:19,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 399 [2023-08-29 23:43:19,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:19,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:43:19,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 399 [2023-08-29 23:43:19,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:43:24,215 INFO L130 PetriNetUnfolder]: 88749/115376 cut-off events. [2023-08-29 23:43:24,216 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-08-29 23:43:24,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227346 conditions, 115376 events. 88749/115376 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 4706. Compared 715427 event pairs, 88749 based on Foata normal form. 0/106837 useless extension candidates. Maximal degree in co-relation 227342. Up to 110592 conditions per place. [2023-08-29 23:43:25,128 INFO L137 encePairwiseOnDemand]: 396/399 looper letters, 44 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-08-29 23:43:25,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 52 transitions, 216 flow [2023-08-29 23:43:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:43:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:43:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2023-08-29 23:43:25,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928989139515455 [2023-08-29 23:43:25,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 590 transitions. [2023-08-29 23:43:25,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 590 transitions. [2023-08-29 23:43:25,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:43:25,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 590 transitions. [2023-08-29 23:43:25,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:25,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:25,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:25,135 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 130 flow. Second operand 3 states and 590 transitions. [2023-08-29 23:43:25,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 52 transitions, 216 flow [2023-08-29 23:43:25,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 52 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:43:25,137 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 127 flow [2023-08-29 23:43:25,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2023-08-29 23:43:25,137 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -23 predicate places. [2023-08-29 23:43:25,138 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 127 flow [2023-08-29 23:43:25,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:25,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:43:25,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:43:25,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 23:43:25,138 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:43:25,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:43:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1116684260, now seen corresponding path program 1 times [2023-08-29 23:43:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:43:25,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36484200] [2023-08-29 23:43:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:43:25,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:43:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:43:25,174 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-29 23:43:25,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:43:25,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36484200] [2023-08-29 23:43:25,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36484200] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:43:25,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:43:25,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 23:43:25,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027739299] [2023-08-29 23:43:25,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:43:25,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 23:43:25,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:43:25,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 23:43:25,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 23:43:25,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 399 [2023-08-29 23:43:25,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:25,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:43:25,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 399 [2023-08-29 23:43:25,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:43:29,323 INFO L130 PetriNetUnfolder]: 70317/91824 cut-off events. [2023-08-29 23:43:29,324 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-08-29 23:43:29,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181267 conditions, 91824 events. 70317/91824 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 3631. Compared 560378 event pairs, 70317 based on Foata normal form. 0/87381 useless extension candidates. Maximal degree in co-relation 181263. Up to 88064 conditions per place. [2023-08-29 23:43:29,827 INFO L137 encePairwiseOnDemand]: 397/399 looper letters, 43 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-08-29 23:43:29,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 51 transitions, 213 flow [2023-08-29 23:43:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:43:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:43:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2023-08-29 23:43:29,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2023-08-29 23:43:29,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2023-08-29 23:43:29,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2023-08-29 23:43:29,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:43:29,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2023-08-29 23:43:29,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:29,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:29,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:29,831 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 127 flow. Second operand 3 states and 567 transitions. [2023-08-29 23:43:29,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 51 transitions, 213 flow [2023-08-29 23:43:29,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 51 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:43:29,833 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 126 flow [2023-08-29 23:43:29,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2023-08-29 23:43:29,833 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -23 predicate places. [2023-08-29 23:43:29,833 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 126 flow [2023-08-29 23:43:29,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:29,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:43:29,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:43:29,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 23:43:29,834 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:43:29,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:43:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1116684261, now seen corresponding path program 1 times [2023-08-29 23:43:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:43:29,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534884551] [2023-08-29 23:43:29,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:43:29,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:43:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:43:30,036 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-29 23:43:30,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:43:30,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534884551] [2023-08-29 23:43:30,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534884551] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:43:30,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:43:30,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 23:43:30,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198769429] [2023-08-29 23:43:30,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:43:30,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 23:43:30,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:43:30,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 23:43:30,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-08-29 23:43:30,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 399 [2023-08-29 23:43:30,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 126 flow. Second operand has 8 states, 8 states have (on average 154.625) internal successors, (1237), 8 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:30,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:43:30,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 399 [2023-08-29 23:43:30,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:43:33,327 INFO L130 PetriNetUnfolder]: 51885/68272 cut-off events. [2023-08-29 23:43:33,327 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2023-08-29 23:43:33,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135188 conditions, 68272 events. 51885/68272 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 2580. Compared 409343 event pairs, 51885 based on Foata normal form. 0/67925 useless extension candidates. Maximal degree in co-relation 135184. Up to 65536 conditions per place. [2023-08-29 23:43:33,711 INFO L137 encePairwiseOnDemand]: 397/399 looper letters, 42 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2023-08-29 23:43:33,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 50 transitions, 210 flow [2023-08-29 23:43:33,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 23:43:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 23:43:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2023-08-29 23:43:33,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4202172096908939 [2023-08-29 23:43:33,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 503 transitions. [2023-08-29 23:43:33,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions. [2023-08-29 23:43:33,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:43:33,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions. [2023-08-29 23:43:33,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:33,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:33,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:33,716 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 126 flow. Second operand 3 states and 503 transitions. [2023-08-29 23:43:33,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 50 transitions, 210 flow [2023-08-29 23:43:33,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 50 transitions, 209 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:43:33,717 INFO L231 Difference]: Finished difference. Result has 71 places, 50 transitions, 125 flow [2023-08-29 23:43:33,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=71, PETRI_TRANSITIONS=50} [2023-08-29 23:43:33,717 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -23 predicate places. [2023-08-29 23:43:33,718 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 50 transitions, 125 flow [2023-08-29 23:43:33,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 154.625) internal successors, (1237), 8 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:33,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:43:33,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:43:33,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 23:43:33,719 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:43:33,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:43:33,719 INFO L85 PathProgramCache]: Analyzing trace with hash 715616713, now seen corresponding path program 1 times [2023-08-29 23:43:33,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:43:33,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464098485] [2023-08-29 23:43:33,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:43:33,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:43:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:43:34,795 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-29 23:43:34,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:43:34,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464098485] [2023-08-29 23:43:34,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464098485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:43:34,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:43:34,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 23:43:34,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13119645] [2023-08-29 23:43:34,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:43:34,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 23:43:34,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:43:34,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 23:43:34,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 23:43:34,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 399 [2023-08-29 23:43:34,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 50 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:34,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:43:34,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 399 [2023-08-29 23:43:34,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:43:53,423 INFO L130 PetriNetUnfolder]: 340125/423387 cut-off events. [2023-08-29 23:43:53,423 INFO L131 PetriNetUnfolder]: For 5903/5903 co-relation queries the response was YES. [2023-08-29 23:43:54,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853457 conditions, 423387 events. 340125/423387 cut-off events. For 5903/5903 co-relation queries the response was YES. Maximal size of possible extension queue 7868. Compared 2338595 event pairs, 87704 based on Foata normal form. 1/423388 useless extension candidates. Maximal degree in co-relation 853453. Up to 222239 conditions per place. [2023-08-29 23:43:55,509 INFO L137 encePairwiseOnDemand]: 390/399 looper letters, 143 selfloop transitions, 18 changer transitions 17/178 dead transitions. [2023-08-29 23:43:55,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 178 transitions, 761 flow [2023-08-29 23:43:55,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 23:43:55,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 23:43:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1229 transitions. [2023-08-29 23:43:55,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133667502088555 [2023-08-29 23:43:55,528 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1229 transitions. [2023-08-29 23:43:55,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1229 transitions. [2023-08-29 23:43:55,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:43:55,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1229 transitions. [2023-08-29 23:43:55,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 204.83333333333334) internal successors, (1229), 6 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:55,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 399.0) internal successors, (2793), 7 states have internal predecessors, (2793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:55,533 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 399.0) internal successors, (2793), 7 states have internal predecessors, (2793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:55,533 INFO L175 Difference]: Start difference. First operand has 71 places, 50 transitions, 125 flow. Second operand 6 states and 1229 transitions. [2023-08-29 23:43:55,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 178 transitions, 761 flow [2023-08-29 23:43:55,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 178 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 23:43:55,536 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 246 flow [2023-08-29 23:43:55,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2023-08-29 23:43:55,536 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -16 predicate places. [2023-08-29 23:43:55,537 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 246 flow [2023-08-29 23:43:55,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:55,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:43:55,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:43:55,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 23:43:55,538 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:43:55,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:43:55,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1348256613, now seen corresponding path program 2 times [2023-08-29 23:43:55,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:43:55,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692231624] [2023-08-29 23:43:55,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:43:55,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:43:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:43:55,830 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-29 23:43:55,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:43:55,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692231624] [2023-08-29 23:43:55,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692231624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:43:55,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:43:55,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 23:43:55,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053966874] [2023-08-29 23:43:55,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:43:55,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:43:55,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:43:55,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:43:55,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:43:55,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 399 [2023-08-29 23:43:55,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 246 flow. Second operand has 9 states, 9 states have (on average 183.77777777777777) internal successors, (1654), 9 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:43:55,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:43:55,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 399 [2023-08-29 23:43:55,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:44:04,995 INFO L130 PetriNetUnfolder]: 115642/156768 cut-off events. [2023-08-29 23:44:04,995 INFO L131 PetriNetUnfolder]: For 6360/7184 co-relation queries the response was YES. [2023-08-29 23:44:05,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324048 conditions, 156768 events. 115642/156768 cut-off events. For 6360/7184 co-relation queries the response was YES. Maximal size of possible extension queue 6757. Compared 1093039 event pairs, 21836 based on Foata normal form. 480/147130 useless extension candidates. Maximal degree in co-relation 324041. Up to 112830 conditions per place. [2023-08-29 23:44:06,273 INFO L137 encePairwiseOnDemand]: 385/399 looper letters, 189 selfloop transitions, 93 changer transitions 0/310 dead transitions. [2023-08-29 23:44:06,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 310 transitions, 1321 flow [2023-08-29 23:44:06,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 23:44:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 23:44:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2611 transitions. [2023-08-29 23:44:06,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033738191632928 [2023-08-29 23:44:06,277 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2611 transitions. [2023-08-29 23:44:06,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2611 transitions. [2023-08-29 23:44:06,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:44:06,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2611 transitions. [2023-08-29 23:44:06,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 200.84615384615384) internal successors, (2611), 13 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:44:06,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 399.0) internal successors, (5586), 14 states have internal predecessors, (5586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:44:06,297 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 399.0) internal successors, (5586), 14 states have internal predecessors, (5586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:44:06,297 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 246 flow. Second operand 13 states and 2611 transitions. [2023-08-29 23:44:06,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 310 transitions, 1321 flow [2023-08-29 23:44:09,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 310 transitions, 1313 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 23:44:09,937 INFO L231 Difference]: Finished difference. Result has 91 places, 181 transitions, 720 flow [2023-08-29 23:44:09,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=720, PETRI_PLACES=91, PETRI_TRANSITIONS=181} [2023-08-29 23:44:09,938 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -3 predicate places. [2023-08-29 23:44:09,939 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 181 transitions, 720 flow [2023-08-29 23:44:09,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 183.77777777777777) internal successors, (1654), 9 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:44:09,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:44:09,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:44:09,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 23:44:09,944 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:44:09,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:44:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1911156773, now seen corresponding path program 3 times [2023-08-29 23:44:09,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:44:09,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505929749] [2023-08-29 23:44:09,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:44:09,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:44:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:44:10,246 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-29 23:44:10,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:44:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505929749] [2023-08-29 23:44:10,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505929749] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:44:10,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:44:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 23:44:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671682409] [2023-08-29 23:44:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:44:10,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 23:44:10,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:44:10,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 23:44:10,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 23:44:10,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 399 [2023-08-29 23:44:10,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 181 transitions, 720 flow. Second operand has 7 states, 7 states have (on average 184.14285714285714) internal successors, (1289), 7 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:44:10,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:44:10,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 399 [2023-08-29 23:44:10,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:44:35,910 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][327], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 145#L131true, Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 167#thread1EXITtrue, 214#L74true, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 333#(<= (+ ~s~0 1) ~t~0), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 62#L181-4true, 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 140#thread4EXITtrue, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 307#true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)]) [2023-08-29 23:44:35,910 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:44:35,910 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:44:35,910 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:44:35,910 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:44:36,679 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][327], [145#L131true, Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 213#L150true, 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 167#thread1EXITtrue, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 214#L74true, 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 333#(<= (+ ~s~0 1) ~t~0), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 140#thread4EXITtrue, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 93#L182-1true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true]) [2023-08-29 23:44:36,679 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 23:44:36,679 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:44:36,679 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:44:36,680 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:44:37,859 INFO L130 PetriNetUnfolder]: 288482/399786 cut-off events. [2023-08-29 23:44:37,861 INFO L131 PetriNetUnfolder]: For 165027/190703 co-relation queries the response was YES. [2023-08-29 23:44:40,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044684 conditions, 399786 events. 288482/399786 cut-off events. For 165027/190703 co-relation queries the response was YES. Maximal size of possible extension queue 16198. Compared 3225399 event pairs, 48861 based on Foata normal form. 4854/378340 useless extension candidates. Maximal degree in co-relation 1044675. Up to 185401 conditions per place. [2023-08-29 23:44:41,907 INFO L137 encePairwiseOnDemand]: 385/399 looper letters, 223 selfloop transitions, 129 changer transitions 0/380 dead transitions. [2023-08-29 23:44:41,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 380 transitions, 2064 flow [2023-08-29 23:44:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 23:44:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 23:44:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1824 transitions. [2023-08-29 23:44:41,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2023-08-29 23:44:41,911 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1824 transitions. [2023-08-29 23:44:41,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1824 transitions. [2023-08-29 23:44:41,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:44:41,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1824 transitions. [2023-08-29 23:44:41,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 202.66666666666666) internal successors, (1824), 9 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:44:41,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 399.0) internal successors, (3990), 10 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:44:41,934 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 399.0) internal successors, (3990), 10 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:44:41,934 INFO L175 Difference]: Start difference. First operand has 91 places, 181 transitions, 720 flow. Second operand 9 states and 1824 transitions. [2023-08-29 23:44:41,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 380 transitions, 2064 flow [2023-08-29 23:45:15,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 380 transitions, 2064 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 23:45:15,863 INFO L231 Difference]: Finished difference. Result has 102 places, 233 transitions, 1377 flow [2023-08-29 23:45:15,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1377, PETRI_PLACES=102, PETRI_TRANSITIONS=233} [2023-08-29 23:45:15,863 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 8 predicate places. [2023-08-29 23:45:15,864 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 233 transitions, 1377 flow [2023-08-29 23:45:15,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 184.14285714285714) internal successors, (1289), 7 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:45:15,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:45:15,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:45:15,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 23:45:15,864 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:45:15,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:45:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1291435257, now seen corresponding path program 4 times [2023-08-29 23:45:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:45:15,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007108943] [2023-08-29 23:45:15,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:45:15,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:45:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:45:16,076 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-29 23:45:16,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:45:16,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007108943] [2023-08-29 23:45:16,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007108943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:45:16,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:45:16,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 23:45:16,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361767603] [2023-08-29 23:45:16,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:45:16,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 23:45:16,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:45:16,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 23:45:16,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 23:45:16,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 399 [2023-08-29 23:45:16,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 233 transitions, 1377 flow. Second operand has 8 states, 8 states have (on average 185.375) internal successors, (1483), 8 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:45:16,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:45:16,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 399 [2023-08-29 23:45:16,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:45:43,621 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][391], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 39#thread5EXITtrue, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), Black: 333#(<= (+ ~s~0 1) ~t~0), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 37#thread2EXITtrue, 62#L181-4true, 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 346#true, Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 334#(<= (+ 2 ~s~0) ~t~0), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 221#L112true, 13#L52true, 307#true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)]) [2023-08-29 23:45:43,622 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 23:45:43,622 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:45:43,622 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:45:43,622 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:45:43,622 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([619] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][284], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 145#L131true, Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 90#thread6EXITtrue, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), Black: 333#(<= (+ ~s~0 1) ~t~0), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 37#thread2EXITtrue, 62#L181-4true, 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 346#true, Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 334#(<= (+ 2 ~s~0) ~t~0), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 221#L112true, 13#L52true, 307#true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)]) [2023-08-29 23:45:43,622 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 23:45:43,633 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:45:43,633 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:45:43,633 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:45:44,545 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][391], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), 39#thread5EXITtrue, Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 333#(<= (+ ~s~0 1) ~t~0), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 37#thread2EXITtrue, 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 346#true, Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 334#(<= (+ 2 ~s~0) ~t~0), 221#L112true, 13#L52true, 93#L182-1true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true]) [2023-08-29 23:45:44,545 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:45:44,545 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:45:44,545 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:45:44,545 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:45:44,546 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([619] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][284], [145#L131true, Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 90#thread6EXITtrue, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 333#(<= (+ ~s~0 1) ~t~0), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 37#thread2EXITtrue, 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 346#true, Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 334#(<= (+ 2 ~s~0) ~t~0), 221#L112true, 13#L52true, 93#L182-1true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true]) [2023-08-29 23:45:44,546 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:45:44,546 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:45:44,546 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:45:44,546 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:45:46,320 INFO L130 PetriNetUnfolder]: 297596/414896 cut-off events. [2023-08-29 23:45:46,320 INFO L131 PetriNetUnfolder]: For 646454/683230 co-relation queries the response was YES. [2023-08-29 23:45:49,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373462 conditions, 414896 events. 297596/414896 cut-off events. For 646454/683230 co-relation queries the response was YES. Maximal size of possible extension queue 16527. Compared 3384475 event pairs, 70514 based on Foata normal form. 12330/403209 useless extension candidates. Maximal degree in co-relation 1373449. Up to 292790 conditions per place. [2023-08-29 23:45:51,117 INFO L137 encePairwiseOnDemand]: 385/399 looper letters, 228 selfloop transitions, 202 changer transitions 0/458 dead transitions. [2023-08-29 23:45:51,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 458 transitions, 3420 flow [2023-08-29 23:45:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 23:45:51,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 23:45:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1823 transitions. [2023-08-29 23:45:51,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076580339738235 [2023-08-29 23:45:51,120 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1823 transitions. [2023-08-29 23:45:51,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1823 transitions. [2023-08-29 23:45:51,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:45:51,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1823 transitions. [2023-08-29 23:45:51,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 202.55555555555554) internal successors, (1823), 9 states have internal predecessors, (1823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:45:51,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 399.0) internal successors, (3990), 10 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:45:51,126 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 399.0) internal successors, (3990), 10 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:45:51,126 INFO L175 Difference]: Start difference. First operand has 102 places, 233 transitions, 1377 flow. Second operand 9 states and 1823 transitions. [2023-08-29 23:45:51,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 458 transitions, 3420 flow [2023-08-29 23:46:21,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 458 transitions, 3407 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 23:46:21,594 INFO L231 Difference]: Finished difference. Result has 111 places, 321 transitions, 2606 flow [2023-08-29 23:46:21,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2606, PETRI_PLACES=111, PETRI_TRANSITIONS=321} [2023-08-29 23:46:21,594 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 17 predicate places. [2023-08-29 23:46:21,595 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 321 transitions, 2606 flow [2023-08-29 23:46:21,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 185.375) internal successors, (1483), 8 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:46:21,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:46:21,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:46:21,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 23:46:21,595 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:46:21,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:46:21,596 INFO L85 PathProgramCache]: Analyzing trace with hash 493214089, now seen corresponding path program 5 times [2023-08-29 23:46:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:46:21,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129738312] [2023-08-29 23:46:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:46:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:46:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:46:21,796 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-29 23:46:21,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:46:21,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129738312] [2023-08-29 23:46:21,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129738312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:46:21,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:46:21,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 23:46:21,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425804637] [2023-08-29 23:46:21,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:46:21,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 23:46:21,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:46:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 23:46:21,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 23:46:21,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 399 [2023-08-29 23:46:21,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 321 transitions, 2606 flow. Second operand has 6 states, 6 states have (on average 186.16666666666666) internal successors, (1117), 6 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:46:21,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:46:21,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 399 [2023-08-29 23:46:21,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:46:54,474 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][395], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 192#L128true, 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 167#thread1EXITtrue, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 214#L74true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 333#(<= (+ ~s~0 1) ~t~0), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 362#true, Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 62#L181-4true, 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 346#true, 140#thread4EXITtrue, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true]) [2023-08-29 23:46:54,474 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 23:46:54,482 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:46:54,482 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:46:54,482 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:46:54,483 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][395], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 192#L128true, 213#L150true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 167#thread1EXITtrue, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 214#L74true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 333#(<= (+ ~s~0 1) ~t~0), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 353#(<= (+ 2 ~s~0) ~m4~0), 362#true, Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 62#L181-4true, 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 346#true, Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 140#thread4EXITtrue, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 334#(<= (+ 2 ~s~0) ~t~0), 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true]) [2023-08-29 23:46:54,483 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 23:46:54,483 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:46:54,483 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:46:54,483 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:46:55,555 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][395], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, 192#L128true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 167#thread1EXITtrue, 214#L74true, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 333#(<= (+ ~s~0 1) ~t~0), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 353#(<= (+ 2 ~s~0) ~m4~0), 362#true, Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 346#true, Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 140#thread4EXITtrue, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 93#L182-1true, 307#true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)]) [2023-08-29 23:46:55,555 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:46:55,555 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:46:55,555 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:46:55,555 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:46:55,557 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][395], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, 192#L128true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 167#thread1EXITtrue, 214#L74true, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 333#(<= (+ ~s~0 1) ~t~0), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 353#(<= (+ 2 ~s~0) ~m4~0), 362#true, Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 346#true, Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 140#thread4EXITtrue, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 334#(<= (+ 2 ~s~0) ~t~0), 93#L182-1true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true]) [2023-08-29 23:46:55,557 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:46:55,557 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:46:55,557 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:46:55,557 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:46:55,615 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][265], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 145#L131true, Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 167#thread1EXITtrue, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 214#L74true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), Black: 333#(<= (+ ~s~0 1) ~t~0), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 362#true, Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 62#L181-4true, 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 329#true, Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 346#true, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 221#L112true, 64#thread3EXITtrue, 307#true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)]) [2023-08-29 23:46:55,615 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-08-29 23:46:55,616 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-29 23:46:55,616 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-29 23:46:55,616 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-29 23:46:56,114 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][265], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 145#L131true, Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 167#thread1EXITtrue, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 214#L74true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), Black: 333#(<= (+ ~s~0 1) ~t~0), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 362#true, Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 329#true, Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 346#true, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 221#L112true, 64#thread3EXITtrue, 93#L182-1true, 307#true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)]) [2023-08-29 23:46:56,115 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-08-29 23:46:56,115 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-29 23:46:56,115 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-29 23:46:56,115 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-29 23:46:57,317 INFO L130 PetriNetUnfolder]: 296973/412652 cut-off events. [2023-08-29 23:46:57,318 INFO L131 PetriNetUnfolder]: For 976825/1020386 co-relation queries the response was YES. [2023-08-29 23:47:00,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1511868 conditions, 412652 events. 296973/412652 cut-off events. For 976825/1020386 co-relation queries the response was YES. Maximal size of possible extension queue 16080. Compared 3336460 event pairs, 85427 based on Foata normal form. 7562/396112 useless extension candidates. Maximal degree in co-relation 1511851. Up to 308340 conditions per place. [2023-08-29 23:47:02,137 INFO L137 encePairwiseOnDemand]: 385/399 looper letters, 220 selfloop transitions, 250 changer transitions 0/498 dead transitions. [2023-08-29 23:47:02,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 498 transitions, 4772 flow [2023-08-29 23:47:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 23:47:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 23:47:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1411 transitions. [2023-08-29 23:47:02,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051915503043323 [2023-08-29 23:47:02,140 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1411 transitions. [2023-08-29 23:47:02,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1411 transitions. [2023-08-29 23:47:02,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:47:02,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1411 transitions. [2023-08-29 23:47:02,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 201.57142857142858) internal successors, (1411), 7 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:47:02,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 399.0) internal successors, (3192), 8 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:47:02,144 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 399.0) internal successors, (3192), 8 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:47:02,144 INFO L175 Difference]: Start difference. First operand has 111 places, 321 transitions, 2606 flow. Second operand 7 states and 1411 transitions. [2023-08-29 23:47:02,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 498 transitions, 4772 flow [2023-08-29 23:47:32,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 498 transitions, 4501 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 23:47:32,721 INFO L231 Difference]: Finished difference. Result has 115 places, 401 transitions, 3794 flow [2023-08-29 23:47:32,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=2250, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3794, PETRI_PLACES=115, PETRI_TRANSITIONS=401} [2023-08-29 23:47:32,722 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 21 predicate places. [2023-08-29 23:47:32,722 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 401 transitions, 3794 flow [2023-08-29 23:47:32,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.16666666666666) internal successors, (1117), 6 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:47:32,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:47:32,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:47:32,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 23:47:32,723 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:47:32,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:47:32,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1021202661, now seen corresponding path program 6 times [2023-08-29 23:47:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:47:32,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731795172] [2023-08-29 23:47:32,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:47:32,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:47:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:47:32,973 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-29 23:47:32,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:47:32,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731795172] [2023-08-29 23:47:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731795172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:47:32,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:47:32,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 23:47:32,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306511774] [2023-08-29 23:47:32,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:47:32,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 23:47:32,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:47:32,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 23:47:32,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 23:47:33,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 399 [2023-08-29 23:47:33,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 401 transitions, 3794 flow. Second operand has 9 states, 9 states have (on average 183.77777777777777) internal successors, (1654), 9 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:47:33,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:47:33,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 399 [2023-08-29 23:47:33,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:48:06,546 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][438], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 192#L128true, 213#L150true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 167#thread1EXITtrue, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 214#L74true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 333#(<= (+ ~s~0 1) ~t~0), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 375#true, 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 362#true, Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 62#L181-4true, 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 140#thread4EXITtrue, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true]) [2023-08-29 23:48:06,546 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 23:48:06,546 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:48:06,546 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:48:06,546 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:48:07,456 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][438], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 213#L150true, 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 167#thread1EXITtrue, 214#L74true, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 39#thread5EXITtrue, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 333#(<= (+ ~s~0 1) ~t~0), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 375#true, 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 353#(<= (+ 2 ~s~0) ~m4~0), 362#true, Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 62#L181-4true, 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 334#(<= (+ 2 ~s~0) ~t~0), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 221#L112true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true]) [2023-08-29 23:48:07,457 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:48:07,457 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:48:07,457 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:48:07,457 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:48:07,661 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][438], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 213#L150true, 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 192#L128true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 167#thread1EXITtrue, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 214#L74true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 333#(<= (+ ~s~0 1) ~t~0), 375#true, 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 362#true, Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 140#thread4EXITtrue, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 93#L182-1true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true]) [2023-08-29 23:48:07,661 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:48:07,662 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:48:07,662 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:48:07,662 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:48:08,346 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][438], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 213#L150true, 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 167#thread1EXITtrue, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 214#L74true, 39#thread5EXITtrue, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), Black: 333#(<= (+ ~s~0 1) ~t~0), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 375#true, 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 362#true, Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 334#(<= (+ 2 ~s~0) ~t~0), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 221#L112true, 93#L182-1true, 307#true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)]) [2023-08-29 23:48:08,347 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 23:48:08,347 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:48:08,347 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:48:08,347 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:48:09,565 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([745] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork3_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_5|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_7|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_7|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_#res#1.base, ~s~0][213], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 192#L128true, 213#L150true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, 87#L93true, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 183#L183-1true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 333#(<= (+ ~s~0 1) ~t~0), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 375#true, 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 37#thread2EXITtrue, 362#true, Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, 329#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 140#thread4EXITtrue, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 307#true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)]) [2023-08-29 23:48:09,566 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 23:48:09,566 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:48:09,566 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:48:09,566 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:48:10,479 INFO L130 PetriNetUnfolder]: 300577/418940 cut-off events. [2023-08-29 23:48:10,479 INFO L131 PetriNetUnfolder]: For 1155409/1209762 co-relation queries the response was YES. [2023-08-29 23:48:13,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568238 conditions, 418940 events. 300577/418940 cut-off events. For 1155409/1209762 co-relation queries the response was YES. Maximal size of possible extension queue 16409. Compared 3414107 event pairs, 84358 based on Foata normal form. 8898/403513 useless extension candidates. Maximal degree in co-relation 1568219. Up to 308622 conditions per place. [2023-08-29 23:48:15,953 INFO L137 encePairwiseOnDemand]: 385/399 looper letters, 226 selfloop transitions, 375 changer transitions 0/629 dead transitions. [2023-08-29 23:48:15,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 629 transitions, 6694 flow [2023-08-29 23:48:15,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 23:48:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 23:48:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2599 transitions. [2023-08-29 23:48:15,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010603431656063 [2023-08-29 23:48:15,958 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2599 transitions. [2023-08-29 23:48:15,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2599 transitions. [2023-08-29 23:48:15,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:48:15,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2599 transitions. [2023-08-29 23:48:15,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 199.92307692307693) internal successors, (2599), 13 states have internal predecessors, (2599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:48:15,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 399.0) internal successors, (5586), 14 states have internal predecessors, (5586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:48:15,972 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 399.0) internal successors, (5586), 14 states have internal predecessors, (5586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:48:15,973 INFO L175 Difference]: Start difference. First operand has 115 places, 401 transitions, 3794 flow. Second operand 13 states and 2599 transitions. [2023-08-29 23:48:15,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 629 transitions, 6694 flow [2023-08-29 23:49:15,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 629 transitions, 6355 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 23:49:15,965 INFO L231 Difference]: Finished difference. Result has 127 places, 499 transitions, 5534 flow [2023-08-29 23:49:15,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=3553, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5534, PETRI_PLACES=127, PETRI_TRANSITIONS=499} [2023-08-29 23:49:15,966 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 33 predicate places. [2023-08-29 23:49:15,966 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 499 transitions, 5534 flow [2023-08-29 23:49:15,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 183.77777777777777) internal successors, (1654), 9 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:49:15,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:49:15,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:49:15,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 23:49:15,967 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:49:15,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:49:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1566796969, now seen corresponding path program 7 times [2023-08-29 23:49:15,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:49:15,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376703754] [2023-08-29 23:49:15,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:49:15,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:49:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:49:16,169 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-29 23:49:16,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:49:16,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376703754] [2023-08-29 23:49:16,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376703754] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:49:16,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:49:16,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 23:49:16,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907846531] [2023-08-29 23:49:16,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:49:16,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 23:49:16,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:49:16,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 23:49:16,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-29 23:49:16,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 399 [2023-08-29 23:49:16,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 499 transitions, 5534 flow. Second operand has 8 states, 8 states have (on average 183.375) internal successors, (1467), 8 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:49:16,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:49:16,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 399 [2023-08-29 23:49:16,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:49:56,943 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_141 1) v_~s~0_140)) InVars {~s~0=v_~s~0_141} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_7|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0][219], [397#true, Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 213#L150true, 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), Black: 391#(and (<= 4 ~m6~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, Black: 393#(and (<= 4 ~m6~0) (<= 4 ~t~0) (= ~s~0 0)), 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), 39#thread5EXITtrue, Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), Black: 333#(<= (+ ~s~0 1) ~t~0), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 375#true, 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), 14#L182-2true, Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, 125#$Ultimate##0true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 329#true, Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 221#L112true, 64#thread3EXITtrue, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true]) [2023-08-29 23:49:56,943 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:49:56,943 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:49:56,943 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:49:56,944 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:49:58,102 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_141 1) v_~s~0_140)) InVars {~s~0=v_~s~0_141} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_7|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0][219], [397#true, Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 213#L150true, 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), Black: 391#(and (<= 4 ~m6~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, Black: 393#(and (<= 4 ~m6~0) (<= 4 ~t~0) (= ~s~0 0)), 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 183#L183-1true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), 39#thread5EXITtrue, Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 333#(<= (+ ~s~0 1) ~t~0), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 375#true, 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, 125#$Ultimate##0true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 329#true, Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 221#L112true, 64#thread3EXITtrue, 307#true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)]) [2023-08-29 23:49:58,103 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 23:49:58,103 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:49:58,103 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:49:58,103 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 23:50:01,100 INFO L130 PetriNetUnfolder]: 309218/435635 cut-off events. [2023-08-29 23:50:01,100 INFO L131 PetriNetUnfolder]: For 1299357/1403511 co-relation queries the response was YES. [2023-08-29 23:50:04,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668473 conditions, 435635 events. 309218/435635 cut-off events. For 1299357/1403511 co-relation queries the response was YES. Maximal size of possible extension queue 17258. Compared 3672262 event pairs, 48220 based on Foata normal form. 25708/437581 useless extension candidates. Maximal degree in co-relation 1668452. Up to 199374 conditions per place. [2023-08-29 23:50:06,891 INFO L137 encePairwiseOnDemand]: 385/399 looper letters, 297 selfloop transitions, 499 changer transitions 1/825 dead transitions. [2023-08-29 23:50:06,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 825 transitions, 9310 flow [2023-08-29 23:50:06,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 23:50:06,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 23:50:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2422 transitions. [2023-08-29 23:50:06,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058479532163743 [2023-08-29 23:50:06,896 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2422 transitions. [2023-08-29 23:50:06,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2422 transitions. [2023-08-29 23:50:06,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:50:06,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2422 transitions. [2023-08-29 23:50:06,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 201.83333333333334) internal successors, (2422), 12 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:50:06,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 399.0) internal successors, (5187), 13 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:50:06,917 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 399.0) internal successors, (5187), 13 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:50:06,917 INFO L175 Difference]: Start difference. First operand has 127 places, 499 transitions, 5534 flow. Second operand 12 states and 2422 transitions. [2023-08-29 23:50:06,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 825 transitions, 9310 flow [2023-08-29 23:50:48,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 825 transitions, 8714 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-29 23:50:48,116 INFO L231 Difference]: Finished difference. Result has 133 places, 603 transitions, 7484 flow [2023-08-29 23:50:48,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=4741, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=369, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7484, PETRI_PLACES=133, PETRI_TRANSITIONS=603} [2023-08-29 23:50:48,116 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 39 predicate places. [2023-08-29 23:50:48,116 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 603 transitions, 7484 flow [2023-08-29 23:50:48,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 183.375) internal successors, (1467), 8 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:50:48,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:50:48,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:50:48,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 23:50:48,118 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:50:48,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:50:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1102637373, now seen corresponding path program 8 times [2023-08-29 23:50:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:50:48,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38308151] [2023-08-29 23:50:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:50:48,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:50:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:50:48,346 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-29 23:50:48,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:50:48,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38308151] [2023-08-29 23:50:48,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38308151] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:50:48,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:50:48,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 23:50:48,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966648713] [2023-08-29 23:50:48,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:50:48,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 23:50:48,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:50:48,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 23:50:48,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 23:50:48,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 399 [2023-08-29 23:50:48,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 603 transitions, 7484 flow. Second operand has 8 states, 8 states have (on average 184.375) internal successors, (1475), 8 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:50:48,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:50:48,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 399 [2023-08-29 23:50:48,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 23:51:33,600 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][491], [397#true, Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 213#L150true, 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 109#L124true, Black: 391#(and (<= 4 ~m6~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 239#true, Black: 393#(and (<= 4 ~m6~0) (<= 4 ~t~0) (= ~s~0 0)), 87#L93true, 167#thread1EXITtrue, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 214#L74true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 333#(<= (+ ~s~0 1) ~t~0), 421#true, 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 408#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 416#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 410#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 62#L181-4true, 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 329#true, Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 140#thread4EXITtrue, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true]) [2023-08-29 23:51:33,601 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 23:51:33,601 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:51:33,601 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:51:33,601 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 23:51:35,240 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][491], [397#true, Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), Black: 391#(and (<= 4 ~m6~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 109#L124true, 239#true, Black: 393#(and (<= 4 ~m6~0) (<= 4 ~t~0) (= ~s~0 0)), 87#L93true, 167#thread1EXITtrue, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 214#L74true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 333#(<= (+ ~s~0 1) ~t~0), 421#true, 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 408#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 416#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 410#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), 329#true, Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 140#thread4EXITtrue, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 93#L182-1true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true]) [2023-08-29 23:51:35,240 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 23:51:35,240 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:51:35,241 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:51:35,241 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:51:35,242 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][491], [397#true, Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, 192#L128true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), Black: 391#(and (<= 4 ~m6~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 239#true, Black: 393#(and (<= 4 ~m6~0) (<= 4 ~t~0) (= ~s~0 0)), 87#L93true, 167#thread1EXITtrue, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 214#L74true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 333#(<= (+ ~s~0 1) ~t~0), 421#true, 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 408#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 416#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 410#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 62#L181-4true, 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, 329#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 140#thread4EXITtrue, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 307#true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)]) [2023-08-29 23:51:35,242 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-29 23:51:35,242 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:51:35,242 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:51:35,243 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-29 23:51:36,508 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([625] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][491], [397#true, Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 192#L128true, 213#L150true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), Black: 391#(and (<= 4 ~m6~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 239#true, Black: 393#(and (<= 4 ~m6~0) (<= 4 ~t~0) (= ~s~0 0)), 87#L93true, 167#thread1EXITtrue, 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 214#L74true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 333#(<= (+ ~s~0 1) ~t~0), 421#true, 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), Black: 408#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 416#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 410#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, 329#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 140#thread4EXITtrue, 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 93#L182-1true, 307#true, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)]) [2023-08-29 23:51:36,508 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-29 23:51:36,508 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:51:36,509 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:51:36,509 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-29 23:51:38,012 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_141 1) v_~s~0_140)) InVars {~s~0=v_~s~0_141} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_7|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0][226], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, Black: 391#(and (<= 4 ~m6~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 109#L124true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, Black: 393#(and (<= 4 ~m6~0) (<= 4 ~t~0) (= ~s~0 0)), 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 183#L183-1true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 421#true, 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 333#(<= (+ ~s~0 1) ~t~0), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 408#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 416#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m3~0)), 37#thread2EXITtrue, Black: 410#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 221#L112true, 64#thread3EXITtrue, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true, 401#(<= (+ ~s~0 1) ~t~0)]) [2023-08-29 23:51:38,012 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-29 23:51:38,012 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:51:38,012 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:51:38,012 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-29 23:51:38,400 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_141 1) v_~s~0_140)) InVars {~s~0=v_~s~0_141} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_7|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0][226], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, 192#L128true, Black: 391#(and (<= 4 ~m6~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, Black: 393#(and (<= 4 ~m6~0) (<= 4 ~t~0) (= ~s~0 0)), 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 183#L183-1true, Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 421#true, 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 333#(<= (+ ~s~0 1) ~t~0), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 408#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 416#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m3~0)), 37#thread2EXITtrue, Black: 410#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 221#L112true, 64#thread3EXITtrue, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 307#true, 401#(<= (+ ~s~0 1) ~t~0)]) [2023-08-29 23:51:38,400 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 23:51:38,400 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:51:38,401 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:51:38,401 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:51:38,401 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_141 1) v_~s~0_140)) InVars {~s~0=v_~s~0_141} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_7|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0][226], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, Black: 391#(and (<= 4 ~m6~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 109#L124true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, Black: 393#(and (<= 4 ~m6~0) (<= 4 ~t~0) (= ~s~0 0)), 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 421#true, 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 126#L183-2true, 333#(<= (+ ~s~0 1) ~t~0), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 408#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 416#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 410#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 221#L112true, 64#thread3EXITtrue, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 401#(<= (+ ~s~0 1) ~t~0), 307#true]) [2023-08-29 23:51:38,401 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 23:51:38,401 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:51:38,402 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:51:38,402 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 23:51:38,644 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_141 1) v_~s~0_140)) InVars {~s~0=v_~s~0_141} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_7|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0][226], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, 192#L128true, Black: 391#(and (<= 4 ~m6~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, Black: 393#(and (<= 4 ~m6~0) (<= 4 ~t~0) (= ~s~0 0)), 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 421#true, 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 126#L183-2true, 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 333#(<= (+ ~s~0 1) ~t~0), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 408#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 416#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 410#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 221#L112true, 64#thread3EXITtrue, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 401#(<= (+ ~s~0 1) ~t~0), 307#true]) [2023-08-29 23:51:38,644 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 23:51:38,644 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 23:51:38,645 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 23:51:38,645 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 23:51:38,645 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_141 1) v_~s~0_140)) InVars {~s~0=v_~s~0_141} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_7|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0][226], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, Black: 391#(and (<= 4 ~m6~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 109#L124true, 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, Black: 393#(and (<= 4 ~m6~0) (<= 4 ~t~0) (= ~s~0 0)), 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 421#true, 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 333#(<= (+ ~s~0 1) ~t~0), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 408#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 416#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m3~0)), 83#L184-1true, Black: 410#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 221#L112true, 64#thread3EXITtrue, 307#true, 401#(<= (+ ~s~0 1) ~t~0), 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)]) [2023-08-29 23:51:38,645 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 23:51:38,645 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 23:51:38,645 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 23:51:38,646 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 23:51:38,796 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L93-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~s~0_141 1) v_~s~0_140)) InVars {~s~0=v_~s~0_141} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_7|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_7|, thread3Thread1of1ForFork1_#t~post6#1=|v_thread3Thread1of1ForFork1_#t~post6#1_7|, ~s~0=v_~s~0_140} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork1_#t~post6#1, ~s~0][226], [Black: 323#(and (<= 4 ~m5~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), Black: 325#(and (<= 4 ~m5~0) (<= 4 ~t~0) (= ~s~0 0)), 276#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 213#L150true, 192#L128true, Black: 391#(and (<= 4 ~m6~0) (= ~m1~0 0) (<= 4 ~t~0) (= ~s~0 0)), 284#(and (<= (+ |ULTIMATE.start_main_~#t1~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (< 0 (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1))), 239#true, Black: 393#(and (<= 4 ~m6~0) (<= 4 ~t~0) (= ~s~0 0)), 260#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 339#(and (<= (+ 2 ~s~0) ~m3~0) (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0)), Black: 341#(and (<= (+ 2 ~s~0) ~m3~0) (<= (+ 2 ~s~0) ~t~0)), 244#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 421#true, 280#(and (= (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|) 4) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 272#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 264#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 333#(<= (+ ~s~0 1) ~t~0), 256#(and (<= 0 |ULTIMATE.start_main_~#t3~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t3~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 248#(and (<= 0 |ULTIMATE.start_main_~#t2~0#1.offset|) (<= (+ |ULTIMATE.start_main_~#t2~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 408#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 416#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m3~0)), 83#L184-1true, Black: 410#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) ~m3~0)), Black: 353#(<= (+ 2 ~s~0) ~m4~0), Black: 357#(and (<= 3 ~m4~0) (<= 3 ~t~0) (= ~s~0 0)), Black: 355#(and (<= 3 ~t~0) (<= (+ 2 ~s~0) ~m4~0) (= ~s~0 0)), 252#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 295#true, Black: 297#(= (+ (* (div ~b~0 256) 256) (* (div (+ (* (- 256) (div ~b~0 256)) ~b~0) 4294967296) 4294967296)) ~b~0), Black: 300#(and (<= ~b~0 0) (<= 0 ~b~0)), 268#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), Black: 369#(and (= ~m1~0 0) (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), Black: 371#(and (<= 1 ~t~0) (<= 1 ~m2~0) (= ~s~0 0)), 221#L112true, 64#thread3EXITtrue, 293#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 401#(<= (+ ~s~0 1) ~t~0), 307#true]) [2023-08-29 23:51:38,797 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-29 23:51:38,797 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 23:51:38,797 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 23:51:38,797 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-29 23:51:39,249 INFO L130 PetriNetUnfolder]: 320385/451917 cut-off events. [2023-08-29 23:51:39,250 INFO L131 PetriNetUnfolder]: For 2093009/2158794 co-relation queries the response was YES. [2023-08-29 23:51:43,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895310 conditions, 451917 events. 320385/451917 cut-off events. For 2093009/2158794 co-relation queries the response was YES. Maximal size of possible extension queue 17777. Compared 3811317 event pairs, 85829 based on Foata normal form. 7744/435080 useless extension candidates. Maximal degree in co-relation 1895286. Up to 332493 conditions per place. [2023-08-29 23:51:45,416 INFO L137 encePairwiseOnDemand]: 385/399 looper letters, 240 selfloop transitions, 570 changer transitions 1/839 dead transitions. [2023-08-29 23:51:45,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 839 transitions, 11390 flow [2023-08-29 23:51:45,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 23:51:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 23:51:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2192 transitions. [2023-08-29 23:51:45,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4994303941672363 [2023-08-29 23:51:45,418 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2192 transitions. [2023-08-29 23:51:45,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2192 transitions. [2023-08-29 23:51:45,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 23:51:45,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2192 transitions. [2023-08-29 23:51:45,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 199.27272727272728) internal successors, (2192), 11 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:51:45,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 399.0) internal successors, (4788), 12 states have internal predecessors, (4788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:51:45,426 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 399.0) internal successors, (4788), 12 states have internal predecessors, (4788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:51:45,427 INFO L175 Difference]: Start difference. First operand has 133 places, 603 transitions, 7484 flow. Second operand 11 states and 2192 transitions. [2023-08-29 23:51:45,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 839 transitions, 11390 flow [2023-08-29 23:53:13,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 839 transitions, 10110 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-08-29 23:53:13,844 INFO L231 Difference]: Finished difference. Result has 137 places, 726 transitions, 9410 flow [2023-08-29 23:53:13,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=6379, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=441, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9410, PETRI_PLACES=137, PETRI_TRANSITIONS=726} [2023-08-29 23:53:13,844 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, 43 predicate places. [2023-08-29 23:53:13,844 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 726 transitions, 9410 flow [2023-08-29 23:53:13,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 184.375) internal successors, (1475), 8 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:53:13,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 23:53:13,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 23:53:13,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 23:53:13,845 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2023-08-29 23:53:13,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 23:53:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash 393005015, now seen corresponding path program 9 times [2023-08-29 23:53:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 23:53:13,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485544836] [2023-08-29 23:53:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 23:53:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 23:53:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 23:53:14,019 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-29 23:53:14,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 23:53:14,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485544836] [2023-08-29 23:53:14,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485544836] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 23:53:14,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 23:53:14,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 23:53:14,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495595126] [2023-08-29 23:53:14,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 23:53:14,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 23:53:14,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 23:53:14,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 23:53:14,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 23:53:14,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 399 [2023-08-29 23:53:14,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 726 transitions, 9410 flow. Second operand has 8 states, 8 states have (on average 183.375) internal successors, (1467), 8 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 23:53:14,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 23:53:14,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 399 [2023-08-29 23:53:14,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15