./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 13:47:27,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 13:47:27,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 13:47:27,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 13:47:27,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 13:47:27,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 13:47:27,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 13:47:27,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 13:47:27,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 13:47:27,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 13:47:27,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 13:47:27,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 13:47:27,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 13:47:27,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 13:47:27,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 13:47:27,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 13:47:27,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 13:47:27,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 13:47:27,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 13:47:27,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 13:47:27,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 13:47:27,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 13:47:27,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 13:47:27,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 13:47:27,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 13:47:27,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 13:47:27,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 13:47:27,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 13:47:27,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 13:47:27,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 13:47:27,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 13:47:27,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 13:47:27,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 13:47:27,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 13:47:27,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 13:47:27,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 13:47:27,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 13:47:27,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 13:47:27,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 13:47:27,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 13:47:27,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 13:47:27,383 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 13:47:27,414 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 13:47:27,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 13:47:27,415 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 13:47:27,415 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 13:47:27,416 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 13:47:27,416 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 13:47:27,416 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 13:47:27,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 13:47:27,417 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 13:47:27,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 13:47:27,417 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 13:47:27,418 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 13:47:27,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 13:47:27,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 13:47:27,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 13:47:27,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 13:47:27,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 13:47:27,418 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 13:47:27,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 13:47:27,419 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 13:47:27,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 13:47:27,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 13:47:27,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 13:47:27,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 13:47:27,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:47:27,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 13:47:27,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 13:47:27,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 13:47:27,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 13:47:27,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 13:47:27,421 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 13:47:27,421 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 13:47:27,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 13:47:27,422 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 13:47:27,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc [2021-12-22 13:47:27,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 13:47:27,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 13:47:27,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 13:47:27,664 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 13:47:27,665 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 13:47:27,666 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2021-12-22 13:47:27,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b2c7ab2b/d7d0b69adb8e4d129303d5d4c7be1260/FLAG0179e92b7 [2021-12-22 13:47:28,098 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 13:47:28,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2021-12-22 13:47:28,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b2c7ab2b/d7d0b69adb8e4d129303d5d4c7be1260/FLAG0179e92b7 [2021-12-22 13:47:28,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b2c7ab2b/d7d0b69adb8e4d129303d5d4c7be1260 [2021-12-22 13:47:28,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 13:47:28,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 13:47:28,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 13:47:28,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 13:47:28,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 13:47:28,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:47:28" (1/1) ... [2021-12-22 13:47:28,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7356d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:47:28, skipping insertion in model container [2021-12-22 13:47:28,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:47:28" (1/1) ... [2021-12-22 13:47:28,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 13:47:28,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:47:28,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2021-12-22 13:47:28,381 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:47:28,388 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 13:47:28,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2021-12-22 13:47:28,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:47:28,444 INFO L208 MainTranslator]: Completed translation [2021-12-22 13:47:28,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:47:28 WrapperNode [2021-12-22 13:47:28,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 13:47:28,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 13:47:28,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 13:47:28,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 13:47:28,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:47:28" (1/1) ... [2021-12-22 13:47:28,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:47:28" (1/1) ... [2021-12-22 13:47:28,508 INFO L137 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 346 [2021-12-22 13:47:28,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 13:47:28,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 13:47:28,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 13:47:28,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 13:47:28,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:47:28" (1/1) ... [2021-12-22 13:47:28,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:47:28" (1/1) ... [2021-12-22 13:47:28,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:47:28" (1/1) ... [2021-12-22 13:47:28,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:47:28" (1/1) ... [2021-12-22 13:47:28,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:47:28" (1/1) ... [2021-12-22 13:47:28,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:47:28" (1/1) ... [2021-12-22 13:47:28,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:47:28" (1/1) ... [2021-12-22 13:47:28,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 13:47:28,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 13:47:28,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 13:47:28,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 13:47:28,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:47:28" (1/1) ... [2021-12-22 13:47:28,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:47:28,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:47:28,600 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) [2021-12-22 13:47:28,642 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 [2021-12-22 13:47:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 13:47:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 13:47:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 13:47:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 13:47:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-22 13:47:28,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-22 13:47:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-22 13:47:28,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-22 13:47:28,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-22 13:47:28,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-22 13:47:28,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-12-22 13:47:28,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-12-22 13:47:28,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 13:47:28,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-22 13:47:28,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-22 13:47:28,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 13:47:28,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 13:47:28,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 13:47:28,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 13:47:28,658 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-22 13:47:28,746 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 13:47:28,747 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 13:47:29,115 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 13:47:29,235 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 13:47:29,235 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-12-22 13:47:29,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:47:29 BoogieIcfgContainer [2021-12-22 13:47:29,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 13:47:29,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 13:47:29,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 13:47:29,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 13:47:29,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:47:28" (1/3) ... [2021-12-22 13:47:29,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7b95e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:47:29, skipping insertion in model container [2021-12-22 13:47:29,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:47:28" (2/3) ... [2021-12-22 13:47:29,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7b95e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:47:29, skipping insertion in model container [2021-12-22 13:47:29,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:47:29" (3/3) ... [2021-12-22 13:47:29,243 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2021-12-22 13:47:29,247 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-22 13:47:29,247 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 13:47:29,247 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-22 13:47:29,247 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-22 13:47:29,311 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,311 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,311 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,312 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,312 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,312 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,312 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,312 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,312 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,313 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,313 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,313 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,313 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,313 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,313 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,314 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,314 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,314 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,314 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,314 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,314 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,315 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,315 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,315 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,316 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,316 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,316 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,316 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,316 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,317 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,317 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,317 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,317 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,317 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,317 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,320 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,320 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,320 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,321 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,321 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,321 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,321 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,321 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,321 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,322 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,323 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,323 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,323 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,323 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,324 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,324 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,324 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,324 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,325 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,325 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,325 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,325 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,326 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,327 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,327 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,327 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,328 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,329 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,329 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,329 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,329 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,330 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,330 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,331 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,331 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,331 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,331 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,331 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,331 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,332 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,332 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,332 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,332 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,332 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,332 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,332 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,332 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,333 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,333 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,333 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,334 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,334 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,334 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,334 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,334 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,334 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,334 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,334 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,335 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,335 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,338 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,339 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,339 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,339 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,339 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,339 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,340 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,340 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,340 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,340 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,340 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,340 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,341 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,341 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,342 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,343 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,343 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,343 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,343 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,343 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,344 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,344 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,344 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,344 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,344 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,344 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,344 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,345 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,345 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,345 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,345 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,345 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,345 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,346 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,346 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,346 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,346 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:47:29,350 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-12-22 13:47:29,411 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 13:47:29,416 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 13:47:29,417 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-22 13:47:29,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 256 places, 265 transitions, 562 flow [2021-12-22 13:47:29,519 INFO L129 PetriNetUnfolder]: 22/261 cut-off events. [2021-12-22 13:47:29,523 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-22 13:47:29,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 261 events. 22/261 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 128 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 222. Up to 2 conditions per place. [2021-12-22 13:47:29,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 265 transitions, 562 flow [2021-12-22 13:47:29,535 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 248 transitions, 520 flow [2021-12-22 13:47:29,580 INFO L129 PetriNetUnfolder]: 22/247 cut-off events. [2021-12-22 13:47:29,580 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-22 13:47:29,581 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:29,582 INFO L254 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, 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, 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, 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] [2021-12-22 13:47:29,582 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:29,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1929909788, now seen corresponding path program 1 times [2021-12-22 13:47:29,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:29,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854507693] [2021-12-22 13:47:29,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:29,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:47:29,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:29,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854507693] [2021-12-22 13:47:29,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854507693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:47:29,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:47:29,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 13:47:29,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138797418] [2021-12-22 13:47:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:47:29,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-22 13:47:29,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:47:29,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-22 13:47:29,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-22 13:47:29,904 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 265 [2021-12-22 13:47:29,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 248 transitions, 520 flow. Second operand has 2 states, 2 states have (on average 242.0) internal successors, (484), 2 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:29,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:47:29,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 265 [2021-12-22 13:47:29,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:47:30,091 INFO L129 PetriNetUnfolder]: 124/548 cut-off events. [2021-12-22 13:47:30,091 INFO L130 PetriNetUnfolder]: For 105/106 co-relation queries the response was YES. [2021-12-22 13:47:30,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 548 events. 124/548 cut-off events. For 105/106 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1720 event pairs, 51 based on Foata normal form. 128/613 useless extension candidates. Maximal degree in co-relation 504. Up to 163 conditions per place. [2021-12-22 13:47:30,098 INFO L132 encePairwiseOnDemand]: 250/265 looper letters, 12 selfloop transitions, 0 changer transitions 8/233 dead transitions. [2021-12-22 13:47:30,099 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 233 transitions, 514 flow [2021-12-22 13:47:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-22 13:47:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-22 13:47:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 501 transitions. [2021-12-22 13:47:30,116 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9452830188679245 [2021-12-22 13:47:30,117 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 501 transitions. [2021-12-22 13:47:30,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 501 transitions. [2021-12-22 13:47:30,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:47:30,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 501 transitions. [2021-12-22 13:47:30,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 250.5) internal successors, (501), 2 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,137 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,138 INFO L186 Difference]: Start difference. First operand has 239 places, 248 transitions, 520 flow. Second operand 2 states and 501 transitions. [2021-12-22 13:47:30,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 233 transitions, 514 flow [2021-12-22 13:47:30,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 233 transitions, 498 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-12-22 13:47:30,147 INFO L242 Difference]: Finished difference. Result has 232 places, 225 transitions, 458 flow [2021-12-22 13:47:30,148 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=458, PETRI_PLACES=232, PETRI_TRANSITIONS=225} [2021-12-22 13:47:30,155 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -7 predicate places. [2021-12-22 13:47:30,155 INFO L470 AbstractCegarLoop]: Abstraction has has 232 places, 225 transitions, 458 flow [2021-12-22 13:47:30,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 242.0) internal successors, (484), 2 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,156 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:30,156 INFO L254 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, 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, 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, 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] [2021-12-22 13:47:30,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 13:47:30,157 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1432313826, now seen corresponding path program 1 times [2021-12-22 13:47:30,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:30,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115917704] [2021-12-22 13:47:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:30,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:47:30,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:30,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115917704] [2021-12-22 13:47:30,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115917704] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:47:30,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:47:30,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 13:47:30,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874897292] [2021-12-22 13:47:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:47:30,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 13:47:30,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:47:30,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 13:47:30,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 13:47:30,509 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 265 [2021-12-22 13:47:30,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 225 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:47:30,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 265 [2021-12-22 13:47:30,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:47:30,704 INFO L129 PetriNetUnfolder]: 134/552 cut-off events. [2021-12-22 13:47:30,704 INFO L130 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2021-12-22 13:47:30,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 552 events. 134/552 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1675 event pairs, 14 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 775. Up to 133 conditions per place. [2021-12-22 13:47:30,710 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 50 selfloop transitions, 3 changer transitions 4/237 dead transitions. [2021-12-22 13:47:30,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 237 transitions, 601 flow [2021-12-22 13:47:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 13:47:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-22 13:47:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1038 transitions. [2021-12-22 13:47:30,713 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7833962264150943 [2021-12-22 13:47:30,713 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1038 transitions. [2021-12-22 13:47:30,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1038 transitions. [2021-12-22 13:47:30,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:47:30,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1038 transitions. [2021-12-22 13:47:30,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 207.6) internal successors, (1038), 5 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,721 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,721 INFO L186 Difference]: Start difference. First operand has 232 places, 225 transitions, 458 flow. Second operand 5 states and 1038 transitions. [2021-12-22 13:47:30,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 237 transitions, 601 flow [2021-12-22 13:47:30,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 237 transitions, 601 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-22 13:47:30,727 INFO L242 Difference]: Finished difference. Result has 231 places, 227 transitions, 481 flow [2021-12-22 13:47:30,727 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=231, PETRI_TRANSITIONS=227} [2021-12-22 13:47:30,728 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2021-12-22 13:47:30,728 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 227 transitions, 481 flow [2021-12-22 13:47:30,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,729 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:30,729 INFO L254 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, 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, 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, 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] [2021-12-22 13:47:30,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 13:47:30,729 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:30,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:30,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1766303309, now seen corresponding path program 1 times [2021-12-22 13:47:30,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:30,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341383021] [2021-12-22 13:47:30,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:30,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:47:30,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:30,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341383021] [2021-12-22 13:47:30,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341383021] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:47:30,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:47:30,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 13:47:30,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939928423] [2021-12-22 13:47:30,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:47:30,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:47:30,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:47:30,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:47:30,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 13:47:30,808 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2021-12-22 13:47:30,809 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 227 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,809 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:47:30,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2021-12-22 13:47:30,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:47:30,918 INFO L129 PetriNetUnfolder]: 208/757 cut-off events. [2021-12-22 13:47:30,918 INFO L130 PetriNetUnfolder]: For 138/140 co-relation queries the response was YES. [2021-12-22 13:47:30,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 757 events. 208/757 cut-off events. For 138/140 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3026 event pairs, 36 based on Foata normal form. 13/694 useless extension candidates. Maximal degree in co-relation 1181. Up to 207 conditions per place. [2021-12-22 13:47:30,924 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 30 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2021-12-22 13:47:30,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 239 transitions, 581 flow [2021-12-22 13:47:30,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:47:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-22 13:47:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2021-12-22 13:47:30,926 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.909433962264151 [2021-12-22 13:47:30,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2021-12-22 13:47:30,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2021-12-22 13:47:30,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:47:30,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2021-12-22 13:47:30,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,930 INFO L186 Difference]: Start difference. First operand has 231 places, 227 transitions, 481 flow. Second operand 3 states and 723 transitions. [2021-12-22 13:47:30,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 239 transitions, 581 flow [2021-12-22 13:47:30,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 239 transitions, 573 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-12-22 13:47:30,934 INFO L242 Difference]: Finished difference. Result has 229 places, 228 transitions, 488 flow [2021-12-22 13:47:30,935 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2021-12-22 13:47:30,935 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -10 predicate places. [2021-12-22 13:47:30,935 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 488 flow [2021-12-22 13:47:30,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,936 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:30,936 INFO L254 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, 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, 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, 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] [2021-12-22 13:47:30,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 13:47:30,937 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:30,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:30,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1267494493, now seen corresponding path program 1 times [2021-12-22 13:47:30,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:30,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155230957] [2021-12-22 13:47:30,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:30,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:47:30,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:30,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155230957] [2021-12-22 13:47:30,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155230957] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:47:30,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:47:30,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 13:47:30,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002604254] [2021-12-22 13:47:30,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:47:30,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:47:30,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:47:30,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:47:30,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 13:47:30,995 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2021-12-22 13:47:30,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:30,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:47:30,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2021-12-22 13:47:30,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:47:31,095 INFO L129 PetriNetUnfolder]: 153/696 cut-off events. [2021-12-22 13:47:31,095 INFO L130 PetriNetUnfolder]: For 212/215 co-relation queries the response was YES. [2021-12-22 13:47:31,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 696 events. 153/696 cut-off events. For 212/215 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2788 event pairs, 27 based on Foata normal form. 12/635 useless extension candidates. Maximal degree in co-relation 1086. Up to 171 conditions per place. [2021-12-22 13:47:31,100 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 31 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2021-12-22 13:47:31,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 240 transitions, 597 flow [2021-12-22 13:47:31,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:47:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-22 13:47:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2021-12-22 13:47:31,101 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9081761006289308 [2021-12-22 13:47:31,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 722 transitions. [2021-12-22 13:47:31,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 722 transitions. [2021-12-22 13:47:31,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:47:31,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 722 transitions. [2021-12-22 13:47:31,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,105 INFO L186 Difference]: Start difference. First operand has 229 places, 228 transitions, 488 flow. Second operand 3 states and 722 transitions. [2021-12-22 13:47:31,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 240 transitions, 597 flow [2021-12-22 13:47:31,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 240 transitions, 594 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-22 13:47:31,109 INFO L242 Difference]: Finished difference. Result has 231 places, 229 transitions, 500 flow [2021-12-22 13:47:31,110 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=231, PETRI_TRANSITIONS=229} [2021-12-22 13:47:31,111 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2021-12-22 13:47:31,111 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 229 transitions, 500 flow [2021-12-22 13:47:31,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,111 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:31,112 INFO L254 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, 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, 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, 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] [2021-12-22 13:47:31,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 13:47:31,112 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:31,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1061679038, now seen corresponding path program 1 times [2021-12-22 13:47:31,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:31,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230470241] [2021-12-22 13:47:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:31,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:47:31,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:31,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230470241] [2021-12-22 13:47:31,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230470241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:47:31,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:47:31,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:47:31,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83844496] [2021-12-22 13:47:31,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:47:31,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:47:31,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:47:31,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:47:31,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:47:31,185 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2021-12-22 13:47:31,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 229 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:47:31,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2021-12-22 13:47:31,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:47:31,367 INFO L129 PetriNetUnfolder]: 109/773 cut-off events. [2021-12-22 13:47:31,367 INFO L130 PetriNetUnfolder]: For 229/230 co-relation queries the response was YES. [2021-12-22 13:47:31,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 773 events. 109/773 cut-off events. For 229/230 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2942 event pairs, 36 based on Foata normal form. 8/712 useless extension candidates. Maximal degree in co-relation 1224. Up to 167 conditions per place. [2021-12-22 13:47:31,371 INFO L132 encePairwiseOnDemand]: 255/265 looper letters, 84 selfloop transitions, 11 changer transitions 0/270 dead transitions. [2021-12-22 13:47:31,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 270 transitions, 793 flow [2021-12-22 13:47:31,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:47:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:47:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1881 transitions. [2021-12-22 13:47:31,375 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7886792452830189 [2021-12-22 13:47:31,375 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1881 transitions. [2021-12-22 13:47:31,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1881 transitions. [2021-12-22 13:47:31,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:47:31,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1881 transitions. [2021-12-22 13:47:31,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,400 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,400 INFO L186 Difference]: Start difference. First operand has 231 places, 229 transitions, 500 flow. Second operand 9 states and 1881 transitions. [2021-12-22 13:47:31,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 270 transitions, 793 flow [2021-12-22 13:47:31,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 270 transitions, 790 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-22 13:47:31,404 INFO L242 Difference]: Finished difference. Result has 240 places, 233 transitions, 540 flow [2021-12-22 13:47:31,405 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=540, PETRI_PLACES=240, PETRI_TRANSITIONS=233} [2021-12-22 13:47:31,405 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places. [2021-12-22 13:47:31,406 INFO L470 AbstractCegarLoop]: Abstraction has has 240 places, 233 transitions, 540 flow [2021-12-22 13:47:31,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,406 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:31,407 INFO L254 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, 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, 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, 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] [2021-12-22 13:47:31,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 13:47:31,407 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:31,407 INFO L85 PathProgramCache]: Analyzing trace with hash 848372614, now seen corresponding path program 1 times [2021-12-22 13:47:31,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:31,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671240682] [2021-12-22 13:47:31,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:31,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 13:47:31,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:31,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671240682] [2021-12-22 13:47:31,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671240682] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:47:31,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:47:31,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:47:31,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099949220] [2021-12-22 13:47:31,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:47:31,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:47:31,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:47:31,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:47:31,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:47:31,480 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2021-12-22 13:47:31,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 233 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,481 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:47:31,481 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2021-12-22 13:47:31,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:47:31,670 INFO L129 PetriNetUnfolder]: 127/1067 cut-off events. [2021-12-22 13:47:31,670 INFO L130 PetriNetUnfolder]: For 321/323 co-relation queries the response was YES. [2021-12-22 13:47:31,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1067 events. 127/1067 cut-off events. For 321/323 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4977 event pairs, 42 based on Foata normal form. 15/997 useless extension candidates. Maximal degree in co-relation 1650. Up to 219 conditions per place. [2021-12-22 13:47:31,677 INFO L132 encePairwiseOnDemand]: 255/265 looper letters, 75 selfloop transitions, 12 changer transitions 0/262 dead transitions. [2021-12-22 13:47:31,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 262 transitions, 794 flow [2021-12-22 13:47:31,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:47:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:47:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1869 transitions. [2021-12-22 13:47:31,681 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7836477987421384 [2021-12-22 13:47:31,681 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1869 transitions. [2021-12-22 13:47:31,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1869 transitions. [2021-12-22 13:47:31,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:47:31,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1869 transitions. [2021-12-22 13:47:31,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 207.66666666666666) internal successors, (1869), 9 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,688 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,688 INFO L186 Difference]: Start difference. First operand has 240 places, 233 transitions, 540 flow. Second operand 9 states and 1869 transitions. [2021-12-22 13:47:31,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 262 transitions, 794 flow [2021-12-22 13:47:31,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 262 transitions, 785 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-22 13:47:31,693 INFO L242 Difference]: Finished difference. Result has 247 places, 237 transitions, 575 flow [2021-12-22 13:47:31,694 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=575, PETRI_PLACES=247, PETRI_TRANSITIONS=237} [2021-12-22 13:47:31,694 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places. [2021-12-22 13:47:31,695 INFO L470 AbstractCegarLoop]: Abstraction has has 247 places, 237 transitions, 575 flow [2021-12-22 13:47:31,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,695 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:31,696 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1] [2021-12-22 13:47:31,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 13:47:31,696 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:31,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1769428669, now seen corresponding path program 1 times [2021-12-22 13:47:31,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:31,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149330417] [2021-12-22 13:47:31,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:31,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 13:47:31,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:31,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149330417] [2021-12-22 13:47:31,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149330417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:47:31,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:47:31,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:47:31,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510128138] [2021-12-22 13:47:31,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:47:31,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:47:31,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:47:31,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:47:31,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:47:31,924 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2021-12-22 13:47:31,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 237 transitions, 575 flow. Second operand has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:31,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:47:31,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2021-12-22 13:47:31,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:47:33,212 INFO L129 PetriNetUnfolder]: 3272/9314 cut-off events. [2021-12-22 13:47:33,213 INFO L130 PetriNetUnfolder]: For 2799/2802 co-relation queries the response was YES. [2021-12-22 13:47:33,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16569 conditions, 9314 events. 3272/9314 cut-off events. For 2799/2802 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 87639 event pairs, 1597 based on Foata normal form. 0/7843 useless extension candidates. Maximal degree in co-relation 16558. Up to 1850 conditions per place. [2021-12-22 13:47:33,287 INFO L132 encePairwiseOnDemand]: 254/265 looper letters, 117 selfloop transitions, 11 changer transitions 0/291 dead transitions. [2021-12-22 13:47:33,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 291 transitions, 998 flow [2021-12-22 13:47:33,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:47:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:47:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1795 transitions. [2021-12-22 13:47:33,292 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7526205450733753 [2021-12-22 13:47:33,292 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1795 transitions. [2021-12-22 13:47:33,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1795 transitions. [2021-12-22 13:47:33,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:47:33,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1795 transitions. [2021-12-22 13:47:33,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 199.44444444444446) internal successors, (1795), 9 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:33,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:33,299 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:33,299 INFO L186 Difference]: Start difference. First operand has 247 places, 237 transitions, 575 flow. Second operand 9 states and 1795 transitions. [2021-12-22 13:47:33,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 291 transitions, 998 flow [2021-12-22 13:47:33,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 291 transitions, 987 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-22 13:47:33,308 INFO L242 Difference]: Finished difference. Result has 255 places, 240 transitions, 606 flow [2021-12-22 13:47:33,308 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=606, PETRI_PLACES=255, PETRI_TRANSITIONS=240} [2021-12-22 13:47:33,309 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places. [2021-12-22 13:47:33,309 INFO L470 AbstractCegarLoop]: Abstraction has has 255 places, 240 transitions, 606 flow [2021-12-22 13:47:33,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:33,310 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:33,311 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1] [2021-12-22 13:47:33,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 13:47:33,311 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:33,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:33,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1581181163, now seen corresponding path program 1 times [2021-12-22 13:47:33,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:33,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300950232] [2021-12-22 13:47:33,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:33,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 13:47:33,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:33,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300950232] [2021-12-22 13:47:33,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300950232] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:47:33,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:47:33,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:47:33,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960130405] [2021-12-22 13:47:33,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:47:33,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:47:33,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:47:33,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:47:33,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:47:33,504 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2021-12-22 13:47:33,505 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 240 transitions, 606 flow. Second operand has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:33,506 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:47:33,506 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2021-12-22 13:47:33,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:47:34,441 INFO L129 PetriNetUnfolder]: 2420/7206 cut-off events. [2021-12-22 13:47:34,442 INFO L130 PetriNetUnfolder]: For 2888/2926 co-relation queries the response was YES. [2021-12-22 13:47:34,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13425 conditions, 7206 events. 2420/7206 cut-off events. For 2888/2926 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 63264 event pairs, 1207 based on Foata normal form. 0/6226 useless extension candidates. Maximal degree in co-relation 13411. Up to 1609 conditions per place. [2021-12-22 13:47:34,539 INFO L132 encePairwiseOnDemand]: 254/265 looper letters, 87 selfloop transitions, 9 changer transitions 21/280 dead transitions. [2021-12-22 13:47:34,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 280 transitions, 960 flow [2021-12-22 13:47:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:47:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:47:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1788 transitions. [2021-12-22 13:47:34,543 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7496855345911949 [2021-12-22 13:47:34,543 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1788 transitions. [2021-12-22 13:47:34,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1788 transitions. [2021-12-22 13:47:34,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:47:34,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1788 transitions. [2021-12-22 13:47:34,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.66666666666666) internal successors, (1788), 9 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:34,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:34,552 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:34,553 INFO L186 Difference]: Start difference. First operand has 255 places, 240 transitions, 606 flow. Second operand 9 states and 1788 transitions. [2021-12-22 13:47:34,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 280 transitions, 960 flow [2021-12-22 13:47:34,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 280 transitions, 944 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-22 13:47:34,560 INFO L242 Difference]: Finished difference. Result has 260 places, 238 transitions, 602 flow [2021-12-22 13:47:34,560 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=602, PETRI_PLACES=260, PETRI_TRANSITIONS=238} [2021-12-22 13:47:34,562 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 21 predicate places. [2021-12-22 13:47:34,562 INFO L470 AbstractCegarLoop]: Abstraction has has 260 places, 238 transitions, 602 flow [2021-12-22 13:47:34,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:34,563 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:34,563 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:47:34,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 13:47:34,564 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:34,564 INFO L85 PathProgramCache]: Analyzing trace with hash 670833297, now seen corresponding path program 1 times [2021-12-22 13:47:34,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:34,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469226419] [2021-12-22 13:47:34,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:34,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 13:47:34,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:34,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469226419] [2021-12-22 13:47:34,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469226419] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:47:34,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347515253] [2021-12-22 13:47:34,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:34,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:47:34,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:47:34,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 13:47:34,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 13:47:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:34,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 13:47:34,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:47:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 13:47:35,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 13:47:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 13:47:36,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347515253] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-22 13:47:36,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-22 13:47:36,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 8] total 22 [2021-12-22 13:47:36,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479124123] [2021-12-22 13:47:36,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:47:36,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:47:36,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:47:36,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:47:36,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-12-22 13:47:36,053 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 265 [2021-12-22 13:47:36,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 238 transitions, 602 flow. Second operand has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:36,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:47:36,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 265 [2021-12-22 13:47:36,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:47:37,237 INFO L129 PetriNetUnfolder]: 3111/6652 cut-off events. [2021-12-22 13:47:37,237 INFO L130 PetriNetUnfolder]: For 3365/3381 co-relation queries the response was YES. [2021-12-22 13:47:37,256 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14591 conditions, 6652 events. 3111/6652 cut-off events. For 3365/3381 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 46322 event pairs, 179 based on Foata normal form. 200/6442 useless extension candidates. Maximal degree in co-relation 14575. Up to 885 conditions per place. [2021-12-22 13:47:37,292 INFO L132 encePairwiseOnDemand]: 246/265 looper letters, 156 selfloop transitions, 39 changer transitions 3/355 dead transitions. [2021-12-22 13:47:37,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 355 transitions, 1383 flow [2021-12-22 13:47:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-22 13:47:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-12-22 13:47:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3802 transitions. [2021-12-22 13:47:37,300 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7173584905660377 [2021-12-22 13:47:37,300 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3802 transitions. [2021-12-22 13:47:37,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3802 transitions. [2021-12-22 13:47:37,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:47:37,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3802 transitions. [2021-12-22 13:47:37,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 190.1) internal successors, (3802), 20 states have internal predecessors, (3802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:37,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 265.0) internal successors, (5565), 21 states have internal predecessors, (5565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:37,328 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 265.0) internal successors, (5565), 21 states have internal predecessors, (5565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:37,328 INFO L186 Difference]: Start difference. First operand has 260 places, 238 transitions, 602 flow. Second operand 20 states and 3802 transitions. [2021-12-22 13:47:37,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 355 transitions, 1383 flow [2021-12-22 13:47:37,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 355 transitions, 1335 flow, removed 14 selfloop flow, removed 10 redundant places. [2021-12-22 13:47:37,344 INFO L242 Difference]: Finished difference. Result has 276 places, 256 transitions, 790 flow [2021-12-22 13:47:37,344 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=790, PETRI_PLACES=276, PETRI_TRANSITIONS=256} [2021-12-22 13:47:37,345 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 37 predicate places. [2021-12-22 13:47:37,345 INFO L470 AbstractCegarLoop]: Abstraction has has 276 places, 256 transitions, 790 flow [2021-12-22 13:47:37,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:37,346 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:37,346 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:47:37,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 13:47:37,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:47:37,560 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:37,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1881327333, now seen corresponding path program 1 times [2021-12-22 13:47:37,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:37,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390222669] [2021-12-22 13:47:37,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:37,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 13:47:37,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:37,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390222669] [2021-12-22 13:47:37,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390222669] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:47:37,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:47:37,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:47:37,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322689586] [2021-12-22 13:47:37,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:47:37,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:47:37,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:47:37,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:47:37,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:47:37,726 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 265 [2021-12-22 13:47:37,727 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 256 transitions, 790 flow. Second operand has 9 states, 9 states have (on average 189.33333333333334) internal successors, (1704), 9 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:37,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:47:37,727 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 265 [2021-12-22 13:47:37,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:47:38,559 INFO L129 PetriNetUnfolder]: 2365/4801 cut-off events. [2021-12-22 13:47:38,559 INFO L130 PetriNetUnfolder]: For 9509/9509 co-relation queries the response was YES. [2021-12-22 13:47:38,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12699 conditions, 4801 events. 2365/4801 cut-off events. For 9509/9509 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 31209 event pairs, 396 based on Foata normal form. 134/4536 useless extension candidates. Maximal degree in co-relation 12677. Up to 1800 conditions per place. [2021-12-22 13:47:38,596 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 116 selfloop transitions, 15 changer transitions 7/300 dead transitions. [2021-12-22 13:47:38,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 300 transitions, 1264 flow [2021-12-22 13:47:38,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:47:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:47:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1755 transitions. [2021-12-22 13:47:38,600 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7358490566037735 [2021-12-22 13:47:38,600 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1755 transitions. [2021-12-22 13:47:38,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1755 transitions. [2021-12-22 13:47:38,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:47:38,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1755 transitions. [2021-12-22 13:47:38,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:38,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:38,607 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:38,607 INFO L186 Difference]: Start difference. First operand has 276 places, 256 transitions, 790 flow. Second operand 9 states and 1755 transitions. [2021-12-22 13:47:38,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 300 transitions, 1264 flow [2021-12-22 13:47:38,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 300 transitions, 1191 flow, removed 9 selfloop flow, removed 12 redundant places. [2021-12-22 13:47:38,628 INFO L242 Difference]: Finished difference. Result has 272 places, 258 transitions, 798 flow [2021-12-22 13:47:38,628 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=798, PETRI_PLACES=272, PETRI_TRANSITIONS=258} [2021-12-22 13:47:38,629 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 33 predicate places. [2021-12-22 13:47:38,629 INFO L470 AbstractCegarLoop]: Abstraction has has 272 places, 258 transitions, 798 flow [2021-12-22 13:47:38,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 189.33333333333334) internal successors, (1704), 9 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:38,630 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:38,630 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:47:38,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 13:47:38,630 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:38,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:38,631 INFO L85 PathProgramCache]: Analyzing trace with hash 195790739, now seen corresponding path program 1 times [2021-12-22 13:47:38,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:38,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262848239] [2021-12-22 13:47:38,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:38,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-22 13:47:38,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:38,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262848239] [2021-12-22 13:47:38,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262848239] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:47:38,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:47:38,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 13:47:38,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431494939] [2021-12-22 13:47:38,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:47:38,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 13:47:38,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:47:38,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 13:47:38,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 13:47:38,708 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 265 [2021-12-22 13:47:38,709 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 258 transitions, 798 flow. Second operand has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:38,709 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:47:38,709 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 265 [2021-12-22 13:47:38,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:47:39,040 INFO L129 PetriNetUnfolder]: 864/2281 cut-off events. [2021-12-22 13:47:39,040 INFO L130 PetriNetUnfolder]: For 5799/5850 co-relation queries the response was YES. [2021-12-22 13:47:39,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6394 conditions, 2281 events. 864/2281 cut-off events. For 5799/5850 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14496 event pairs, 74 based on Foata normal form. 26/2075 useless extension candidates. Maximal degree in co-relation 6372. Up to 538 conditions per place. [2021-12-22 13:47:39,069 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 63 selfloop transitions, 23 changer transitions 0/302 dead transitions. [2021-12-22 13:47:39,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 302 transitions, 1200 flow [2021-12-22 13:47:39,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 13:47:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-22 13:47:39,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1425 transitions. [2021-12-22 13:47:39,072 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2021-12-22 13:47:39,072 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1425 transitions. [2021-12-22 13:47:39,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1425 transitions. [2021-12-22 13:47:39,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:47:39,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1425 transitions. [2021-12-22 13:47:39,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:39,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:39,077 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:39,078 INFO L186 Difference]: Start difference. First operand has 272 places, 258 transitions, 798 flow. Second operand 6 states and 1425 transitions. [2021-12-22 13:47:39,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 302 transitions, 1200 flow [2021-12-22 13:47:39,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 302 transitions, 1159 flow, removed 9 selfloop flow, removed 8 redundant places. [2021-12-22 13:47:39,088 INFO L242 Difference]: Finished difference. Result has 271 places, 270 transitions, 953 flow [2021-12-22 13:47:39,088 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=953, PETRI_PLACES=271, PETRI_TRANSITIONS=270} [2021-12-22 13:47:39,089 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 32 predicate places. [2021-12-22 13:47:39,089 INFO L470 AbstractCegarLoop]: Abstraction has has 271 places, 270 transitions, 953 flow [2021-12-22 13:47:39,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:39,089 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:39,089 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:47:39,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 13:47:39,090 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:39,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:39,090 INFO L85 PathProgramCache]: Analyzing trace with hash -514632839, now seen corresponding path program 1 times [2021-12-22 13:47:39,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:39,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082760800] [2021-12-22 13:47:39,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:39,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-22 13:47:39,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:39,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082760800] [2021-12-22 13:47:39,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082760800] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:47:39,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256111913] [2021-12-22 13:47:39,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:39,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:47:39,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:47:39,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 13:47:39,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 13:47:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:39,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 13:47:39,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:47:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-22 13:47:39,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 13:47:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-22 13:47:40,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256111913] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-22 13:47:40,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-22 13:47:40,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 6] total 11 [2021-12-22 13:47:40,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186477647] [2021-12-22 13:47:40,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:47:40,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:47:40,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:47:40,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:47:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-22 13:47:40,149 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 265 [2021-12-22 13:47:40,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 270 transitions, 953 flow. Second operand has 7 states, 7 states have (on average 224.57142857142858) internal successors, (1572), 7 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:40,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:47:40,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 265 [2021-12-22 13:47:40,150 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:47:41,615 INFO L129 PetriNetUnfolder]: 4525/9682 cut-off events. [2021-12-22 13:47:41,616 INFO L130 PetriNetUnfolder]: For 45844/46244 co-relation queries the response was YES. [2021-12-22 13:47:41,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32947 conditions, 9682 events. 4525/9682 cut-off events. For 45844/46244 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 83372 event pairs, 699 based on Foata normal form. 54/8446 useless extension candidates. Maximal degree in co-relation 32922. Up to 2009 conditions per place. [2021-12-22 13:47:41,707 INFO L132 encePairwiseOnDemand]: 253/265 looper letters, 150 selfloop transitions, 56 changer transitions 0/414 dead transitions. [2021-12-22 13:47:41,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 414 transitions, 2463 flow [2021-12-22 13:47:41,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:47:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-22 13:47:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2529 transitions. [2021-12-22 13:47:41,713 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8675814751286449 [2021-12-22 13:47:41,714 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2529 transitions. [2021-12-22 13:47:41,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2529 transitions. [2021-12-22 13:47:41,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:47:41,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2529 transitions. [2021-12-22 13:47:41,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 229.9090909090909) internal successors, (2529), 11 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:41,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 265.0) internal successors, (3180), 12 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:41,723 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 265.0) internal successors, (3180), 12 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:41,724 INFO L186 Difference]: Start difference. First operand has 271 places, 270 transitions, 953 flow. Second operand 11 states and 2529 transitions. [2021-12-22 13:47:41,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 414 transitions, 2463 flow [2021-12-22 13:47:41,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 414 transitions, 2403 flow, removed 20 selfloop flow, removed 2 redundant places. [2021-12-22 13:47:41,803 INFO L242 Difference]: Finished difference. Result has 285 places, 309 transitions, 1456 flow [2021-12-22 13:47:41,803 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1456, PETRI_PLACES=285, PETRI_TRANSITIONS=309} [2021-12-22 13:47:41,804 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 46 predicate places. [2021-12-22 13:47:41,804 INFO L470 AbstractCegarLoop]: Abstraction has has 285 places, 309 transitions, 1456 flow [2021-12-22 13:47:41,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 224.57142857142858) internal successors, (1572), 7 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:41,805 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:41,805 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:47:41,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 13:47:42,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-22 13:47:42,023 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:42,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:42,024 INFO L85 PathProgramCache]: Analyzing trace with hash 778151649, now seen corresponding path program 2 times [2021-12-22 13:47:42,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:42,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187563483] [2021-12-22 13:47:42,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:42,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:42,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-22 13:47:42,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:42,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187563483] [2021-12-22 13:47:42,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187563483] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:47:42,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:47:42,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:47:42,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119600917] [2021-12-22 13:47:42,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:47:42,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:47:42,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:47:42,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:47:42,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:47:42,215 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 265 [2021-12-22 13:47:42,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 309 transitions, 1456 flow. Second operand has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:42,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:47:42,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 265 [2021-12-22 13:47:42,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:47:44,615 INFO L129 PetriNetUnfolder]: 7558/14275 cut-off events. [2021-12-22 13:47:44,616 INFO L130 PetriNetUnfolder]: For 59580/59619 co-relation queries the response was YES. [2021-12-22 13:47:44,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51675 conditions, 14275 events. 7558/14275 cut-off events. For 59580/59619 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 115295 event pairs, 2183 based on Foata normal form. 251/13713 useless extension candidates. Maximal degree in co-relation 51645. Up to 7112 conditions per place. [2021-12-22 13:47:44,772 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 219 selfloop transitions, 18 changer transitions 0/408 dead transitions. [2021-12-22 13:47:44,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 408 transitions, 2781 flow [2021-12-22 13:47:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:47:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:47:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1751 transitions. [2021-12-22 13:47:44,776 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7341719077568134 [2021-12-22 13:47:44,776 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1751 transitions. [2021-12-22 13:47:44,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1751 transitions. [2021-12-22 13:47:44,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:47:44,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1751 transitions. [2021-12-22 13:47:44,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 194.55555555555554) internal successors, (1751), 9 states have internal predecessors, (1751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:44,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:44,782 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:44,782 INFO L186 Difference]: Start difference. First operand has 285 places, 309 transitions, 1456 flow. Second operand 9 states and 1751 transitions. [2021-12-22 13:47:44,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 408 transitions, 2781 flow [2021-12-22 13:47:44,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 408 transitions, 2758 flow, removed 9 selfloop flow, removed 2 redundant places. [2021-12-22 13:47:44,973 INFO L242 Difference]: Finished difference. Result has 293 places, 315 transitions, 1549 flow [2021-12-22 13:47:44,974 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1549, PETRI_PLACES=293, PETRI_TRANSITIONS=315} [2021-12-22 13:47:44,975 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 54 predicate places. [2021-12-22 13:47:44,975 INFO L470 AbstractCegarLoop]: Abstraction has has 293 places, 315 transitions, 1549 flow [2021-12-22 13:47:44,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:47:44,976 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:47:44,976 INFO L254 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, 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, 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, 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, 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] [2021-12-22 13:47:44,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 13:47:44,977 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-22 13:47:44,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:47:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1347663800, now seen corresponding path program 1 times [2021-12-22 13:47:44,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:47:44,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081447343] [2021-12-22 13:47:44,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:44,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:47:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 13:47:47,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:47:47,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081447343] [2021-12-22 13:47:47,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081447343] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:47:47,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698509951] [2021-12-22 13:47:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:47:47,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:47:47,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:47:47,528 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 13:47:47,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 13:47:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:47:47,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 89 conjunts are in the unsatisfiable core [2021-12-22 13:47:47,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:47:53,706 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 13:47:53,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 13:47:53,727 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-22 13:47:53,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 31 [2021-12-22 13:47:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 13:47:53,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 13:47:54,904 INFO L353 Elim1Store]: treesize reduction 31, result has 88.8 percent of original size [2021-12-22 13:47:54,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 269 [2021-12-22 13:48:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 13:48:03,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698509951] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 13:48:03,911 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 13:48:03,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 25] total 91 [2021-12-22 13:48:03,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812090558] [2021-12-22 13:48:03,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 13:48:03,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2021-12-22 13:48:03,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:48:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2021-12-22 13:48:03,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1503, Invalid=6687, Unknown=0, NotChecked=0, Total=8190 [2021-12-22 13:48:03,926 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 265 [2021-12-22 13:48:03,932 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 315 transitions, 1549 flow. Second operand has 91 states, 91 states have (on average 109.98901098901099) internal successors, (10009), 91 states have internal predecessors, (10009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:03,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:48:03,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 265 [2021-12-22 13:48:03,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:48:12,877 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][636], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 264#(= ~total~0 0), 202#L143-4true, 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 40#L79true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:12,877 INFO L384 tUnfolder$Statistics]: this new event has 191 ancestors and is cut-off event [2021-12-22 13:48:12,877 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2021-12-22 13:48:12,877 INFO L387 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2021-12-22 13:48:12,877 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-22 13:48:13,589 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][636], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, 109#L82true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 264#(= ~total~0 0), 202#L143-4true, 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:13,590 INFO L384 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2021-12-22 13:48:13,608 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2021-12-22 13:48:13,608 INFO L387 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2021-12-22 13:48:13,608 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-12-22 13:48:16,306 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 240#L118true, Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 40#L79true, 17#L58true, Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:16,307 INFO L384 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2021-12-22 13:48:16,307 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-22 13:48:16,307 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-22 13:48:16,307 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-22 13:48:17,388 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 240#L118true, Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:17,388 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2021-12-22 13:48:17,389 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-22 13:48:17,389 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-12-22 13:48:17,389 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-12-22 13:48:18,392 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), 24#L115true, Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 38#L144-4true, 17#L58true, 40#L79true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:18,392 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2021-12-22 13:48:18,393 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2021-12-22 13:48:18,393 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-12-22 13:48:18,393 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2021-12-22 13:48:19,459 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 240#L118true, Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 40#L79true, 74#L145-1true, Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:19,460 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2021-12-22 13:48:19,460 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-22 13:48:19,460 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-22 13:48:19,460 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-12-22 13:48:19,461 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 240#L118true, Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, 40#L79true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:19,461 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2021-12-22 13:48:19,461 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-22 13:48:19,461 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-22 13:48:19,461 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-12-22 13:48:19,462 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 38#L144-4true, 17#L58true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:19,462 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2021-12-22 13:48:19,462 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-22 13:48:19,462 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-12-22 13:48:19,463 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-22 13:48:20,518 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 240#L118true, Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 74#L145-1true, Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:20,518 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-12-22 13:48:20,518 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-22 13:48:20,518 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-22 13:48:20,518 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-22 13:48:20,520 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 240#L118true, Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:20,520 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-12-22 13:48:20,520 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-22 13:48:20,520 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-12-22 13:48:20,520 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-12-22 13:48:20,537 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 99#L61true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:20,537 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-12-22 13:48:20,537 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-22 13:48:20,537 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-22 13:48:20,537 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-22 13:48:21,491 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 40#L79true, 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:21,491 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2021-12-22 13:48:21,491 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-12-22 13:48:21,492 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-12-22 13:48:21,492 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-12-22 13:48:21,492 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, 40#L79true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:21,493 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2021-12-22 13:48:21,493 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-12-22 13:48:21,493 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-12-22 13:48:21,493 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-12-22 13:48:22,478 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 240#L118true, Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 40#L79true, 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:22,478 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2021-12-22 13:48:22,478 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-22 13:48:22,478 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2021-12-22 13:48:22,479 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-22 13:48:22,479 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:22,479 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2021-12-22 13:48:22,480 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-22 13:48:22,480 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2021-12-22 13:48:22,480 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-22 13:48:22,480 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:22,481 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2021-12-22 13:48:22,481 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-22 13:48:22,481 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-22 13:48:22,481 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2021-12-22 13:48:23,212 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 240#L118true, Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:23,212 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2021-12-22 13:48:23,212 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2021-12-22 13:48:23,212 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-22 13:48:23,212 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-22 13:48:23,219 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 99#L61true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:23,219 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2021-12-22 13:48:23,219 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-22 13:48:23,220 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2021-12-22 13:48:23,220 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-22 13:48:23,829 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 40#L79true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:23,830 INFO L384 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2021-12-22 13:48:23,830 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2021-12-22 13:48:23,830 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-12-22 13:48:23,830 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-12-22 13:48:24,279 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:24,279 INFO L384 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2021-12-22 13:48:24,279 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-12-22 13:48:24,279 INFO L387 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2021-12-22 13:48:24,279 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-12-22 13:48:25,028 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, 56#L145-2true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:25,028 INFO L384 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2021-12-22 13:48:25,028 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2021-12-22 13:48:25,029 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2021-12-22 13:48:25,029 INFO L387 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2021-12-22 13:48:25,632 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 151#L146-1true, Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:25,633 INFO L384 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2021-12-22 13:48:25,633 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2021-12-22 13:48:25,633 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2021-12-22 13:48:25,633 INFO L387 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2021-12-22 13:48:26,053 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 228#L146-2true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:26,054 INFO L384 tUnfolder$Statistics]: this new event has 211 ancestors and is cut-off event [2021-12-22 13:48:26,054 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2021-12-22 13:48:26,054 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2021-12-22 13:48:26,054 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2021-12-22 13:48:26,171 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 69#L147-1true, Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-22 13:48:26,172 INFO L384 tUnfolder$Statistics]: this new event has 213 ancestors and is cut-off event [2021-12-22 13:48:26,172 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2021-12-22 13:48:26,172 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2021-12-22 13:48:26,172 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2021-12-22 13:48:26,866 INFO L129 PetriNetUnfolder]: 55321/103718 cut-off events. [2021-12-22 13:48:26,867 INFO L130 PetriNetUnfolder]: For 447193/449504 co-relation queries the response was YES. [2021-12-22 13:48:27,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 379107 conditions, 103718 events. 55321/103718 cut-off events. For 447193/449504 co-relation queries the response was YES. Maximal size of possible extension queue 4184. Compared 1098930 event pairs, 2924 based on Foata normal form. 316/98668 useless extension candidates. Maximal degree in co-relation 379075. Up to 23137 conditions per place. [2021-12-22 13:48:28,385 INFO L132 encePairwiseOnDemand]: 191/265 looper letters, 702 selfloop transitions, 535 changer transitions 12/1355 dead transitions. [2021-12-22 13:48:28,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 1355 transitions, 10485 flow [2021-12-22 13:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-22 13:48:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-12-22 13:48:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 10794 transitions. [2021-12-22 13:48:28,413 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4333199518265757 [2021-12-22 13:48:28,413 INFO L72 ComplementDD]: Start complementDD. Operand 94 states and 10794 transitions. [2021-12-22 13:48:28,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 10794 transitions. [2021-12-22 13:48:28,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:48:28,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 94 states and 10794 transitions. [2021-12-22 13:48:28,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 95 states, 94 states have (on average 114.82978723404256) internal successors, (10794), 94 states have internal predecessors, (10794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:28,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 95 states, 95 states have (on average 265.0) internal successors, (25175), 95 states have internal predecessors, (25175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:28,459 INFO L81 ComplementDD]: Finished complementDD. Result has 95 states, 95 states have (on average 265.0) internal successors, (25175), 95 states have internal predecessors, (25175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 13:48:28,459 INFO L186 Difference]: Start difference. First operand has 293 places, 315 transitions, 1549 flow. Second operand 94 states and 10794 transitions. [2021-12-22 13:48:28,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 1355 transitions, 10485 flow