./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/parallel-misc-5.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 3f696f3d7a078e1a0d9bb5ce793945c7092990826a45e57529562474d0b18f4a --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:44:29,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:44:29,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:44:29,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:44:29,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:44:29,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:44:29,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:44:29,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:44:29,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:44:29,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:44:29,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:44:29,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:44:29,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:44:29,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:44:29,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:44:29,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:44:29,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:44:29,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:44:29,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:44:29,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:44:29,410 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:44:29,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:44:29,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:44:29,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:44:29,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:44:29,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:44:29,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:44:29,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:44:29,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:44:29,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:44:29,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:44:29,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:44:29,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:44:29,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:44:29,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:44:29,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:44:29,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:44:29,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:44:29,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:44:29,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:44:29,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:44:29,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:44:29,426 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 21:44:29,448 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:44:29,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:44:29,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:44:29,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:44:29,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:44:29,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:44:29,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:44:29,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:44:29,451 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:44:29,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:44:29,452 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:44:29,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:44:29,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:44:29,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:44:29,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:44:29,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:44:29,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:44:29,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:44:29,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:44:29,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:44:29,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:44:29,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:44:29,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:44:29,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:44:29,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:44:29,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:44:29,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:44:29,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:44:29,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:44:29,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:44:29,455 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:44:29,455 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:44:29,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:44:29,455 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 -> 3f696f3d7a078e1a0d9bb5ce793945c7092990826a45e57529562474d0b18f4a [2022-07-22 21:44:29,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:44:29,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:44:29,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:44:29,683 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:44:29,684 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:44:29,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-07-22 21:44:29,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124923046/446e9df1fe774b4a8f0db29943dc0871/FLAG57dfc024b [2022-07-22 21:44:30,085 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:44:30,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-07-22 21:44:30,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124923046/446e9df1fe774b4a8f0db29943dc0871/FLAG57dfc024b [2022-07-22 21:44:30,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124923046/446e9df1fe774b4a8f0db29943dc0871 [2022-07-22 21:44:30,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:44:30,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:44:30,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:44:30,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:44:30,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:44:30,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:44:30" (1/1) ... [2022-07-22 21:44:30,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1a79b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:30, skipping insertion in model container [2022-07-22 21:44:30,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:44:30" (1/1) ... [2022-07-22 21:44:30,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:44:30,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:44:30,656 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/parallel-misc-5.wvr.c[3027,3040] [2022-07-22 21:44:30,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:44:30,664 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:44:30,678 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/parallel-misc-5.wvr.c[3027,3040] [2022-07-22 21:44:30,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:44:30,688 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:44:30,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:30 WrapperNode [2022-07-22 21:44:30,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:44:30,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:44:30,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:44:30,690 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:44:30,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:30" (1/1) ... [2022-07-22 21:44:30,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:30" (1/1) ... [2022-07-22 21:44:30,729 INFO L137 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-07-22 21:44:30,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:44:30,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:44:30,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:44:30,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:44:30,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:30" (1/1) ... [2022-07-22 21:44:30,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:30" (1/1) ... [2022-07-22 21:44:30,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:30" (1/1) ... [2022-07-22 21:44:30,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:30" (1/1) ... [2022-07-22 21:44:30,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:30" (1/1) ... [2022-07-22 21:44:30,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:30" (1/1) ... [2022-07-22 21:44:30,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:30" (1/1) ... [2022-07-22 21:44:30,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:44:30,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:44:30,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:44:30,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:44:30,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:30" (1/1) ... [2022-07-22 21:44:30,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:44:30,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:30,795 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) [2022-07-22 21:44:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:44:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 21:44:30,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 21:44:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 21:44:30,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 21:44:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 21:44:30,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 21:44:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:44:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:44:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:44:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:44:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:44:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:44:30,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:44:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 21:44:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:44:30,825 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 21:44:30,812 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 [2022-07-22 21:44:30,892 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:44:30,893 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:44:31,105 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:44:31,174 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:44:31,174 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 21:44:31,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:44:31 BoogieIcfgContainer [2022-07-22 21:44:31,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:44:31,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:44:31,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:44:31,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:44:31,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:44:30" (1/3) ... [2022-07-22 21:44:31,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71802a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:44:31, skipping insertion in model container [2022-07-22 21:44:31,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:30" (2/3) ... [2022-07-22 21:44:31,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71802a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:44:31, skipping insertion in model container [2022-07-22 21:44:31,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:44:31" (3/3) ... [2022-07-22 21:44:31,183 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2022-07-22 21:44:31,186 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:44:31,193 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:44:31,193 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 21:44:31,193 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:44:31,236 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 21:44:31,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 109 transitions, 242 flow [2022-07-22 21:44:31,292 INFO L129 PetriNetUnfolder]: 7/106 cut-off events. [2022-07-22 21:44:31,292 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 21:44:31,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 7/106 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-07-22 21:44:31,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 109 transitions, 242 flow [2022-07-22 21:44:31,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 95 transitions, 208 flow [2022-07-22 21:44:31,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:44:31,311 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@289bdaf1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@201c4f34 [2022-07-22 21:44:31,312 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-22 21:44:31,329 INFO L129 PetriNetUnfolder]: 7/94 cut-off events. [2022-07-22 21:44:31,329 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 21:44:31,330 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:31,330 INFO L200 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] [2022-07-22 21:44:31,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:31,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:31,335 INFO L85 PathProgramCache]: Analyzing trace with hash 722273223, now seen corresponding path program 1 times [2022-07-22 21:44:31,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:31,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795701878] [2022-07-22 21:44:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:31,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:31,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795701878] [2022-07-22 21:44:31,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795701878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:31,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:31,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:44:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019913867] [2022-07-22 21:44:31,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:31,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 21:44:31,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:31,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 21:44:31,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 21:44:31,545 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2022-07-22 21:44:31,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 208 flow. Second operand has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:31,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:31,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2022-07-22 21:44:31,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:31,597 INFO L129 PetriNetUnfolder]: 36/184 cut-off events. [2022-07-22 21:44:31,598 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-07-22 21:44:31,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 184 events. 36/184 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 463 event pairs, 7 based on Foata normal form. 18/184 useless extension candidates. Maximal degree in co-relation 178. Up to 49 conditions per place. [2022-07-22 21:44:31,601 INFO L132 encePairwiseOnDemand]: 106/109 looper letters, 10 selfloop transitions, 0 changer transitions 1/92 dead transitions. [2022-07-22 21:44:31,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 222 flow [2022-07-22 21:44:31,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 21:44:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-22 21:44:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions. [2022-07-22 21:44:31,611 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9311926605504587 [2022-07-22 21:44:31,611 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 203 transitions. [2022-07-22 21:44:31,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 203 transitions. [2022-07-22 21:44:31,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:31,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 203 transitions. [2022-07-22 21:44:31,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:31,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:31,621 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:31,622 INFO L186 Difference]: Start difference. First operand has 98 places, 95 transitions, 208 flow. Second operand 2 states and 203 transitions. [2022-07-22 21:44:31,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 222 flow [2022-07-22 21:44:31,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 210 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-22 21:44:31,628 INFO L242 Difference]: Finished difference. Result has 93 places, 91 transitions, 188 flow [2022-07-22 21:44:31,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=188, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2022-07-22 21:44:31,632 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, -5 predicate places. [2022-07-22 21:44:31,632 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 188 flow [2022-07-22 21:44:31,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:31,633 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:31,633 INFO L200 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] [2022-07-22 21:44:31,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:44:31,634 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1307011461, now seen corresponding path program 1 times [2022-07-22 21:44:31,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:31,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644198621] [2022-07-22 21:44:31,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:31,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:31,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:31,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644198621] [2022-07-22 21:44:31,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644198621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:31,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:31,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:44:31,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108539160] [2022-07-22 21:44:31,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:31,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:44:31,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:31,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:44:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:44:31,908 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-07-22 21:44:31,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:31,913 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:31,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-07-22 21:44:31,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:32,113 INFO L129 PetriNetUnfolder]: 95/279 cut-off events. [2022-07-22 21:44:32,114 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-22 21:44:32,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 279 events. 95/279 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 967 event pairs, 2 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 445. Up to 71 conditions per place. [2022-07-22 21:44:32,119 INFO L132 encePairwiseOnDemand]: 103/109 looper letters, 33 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2022-07-22 21:44:32,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 107 transitions, 300 flow [2022-07-22 21:44:32,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 21:44:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-22 21:44:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2022-07-22 21:44:32,126 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8042813455657493 [2022-07-22 21:44:32,126 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 526 transitions. [2022-07-22 21:44:32,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 526 transitions. [2022-07-22 21:44:32,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:32,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 526 transitions. [2022-07-22 21:44:32,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,132 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,132 INFO L186 Difference]: Start difference. First operand has 93 places, 91 transitions, 188 flow. Second operand 6 states and 526 transitions. [2022-07-22 21:44:32,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 107 transitions, 300 flow [2022-07-22 21:44:32,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 107 transitions, 300 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-22 21:44:32,136 INFO L242 Difference]: Finished difference. Result has 99 places, 93 transitions, 213 flow [2022-07-22 21:44:32,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=99, PETRI_TRANSITIONS=93} [2022-07-22 21:44:32,137 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2022-07-22 21:44:32,137 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 213 flow [2022-07-22 21:44:32,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,137 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:32,138 INFO L200 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] [2022-07-22 21:44:32,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:44:32,138 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:32,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1981283141, now seen corresponding path program 2 times [2022-07-22 21:44:32,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:32,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136355747] [2022-07-22 21:44:32,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:32,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:32,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:32,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136355747] [2022-07-22 21:44:32,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136355747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:32,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:32,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:44:32,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033910928] [2022-07-22 21:44:32,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:32,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:44:32,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:32,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:44:32,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:44:32,282 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-07-22 21:44:32,283 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 93 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,283 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:32,283 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-07-22 21:44:32,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:32,435 INFO L129 PetriNetUnfolder]: 99/326 cut-off events. [2022-07-22 21:44:32,435 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-07-22 21:44:32,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 326 events. 99/326 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1305 event pairs, 20 based on Foata normal form. 3/297 useless extension candidates. Maximal degree in co-relation 546. Up to 71 conditions per place. [2022-07-22 21:44:32,437 INFO L132 encePairwiseOnDemand]: 101/109 looper letters, 36 selfloop transitions, 8 changer transitions 0/112 dead transitions. [2022-07-22 21:44:32,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 112 transitions, 341 flow [2022-07-22 21:44:32,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:44:32,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:44:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2022-07-22 21:44:32,440 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8020969855832241 [2022-07-22 21:44:32,440 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2022-07-22 21:44:32,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2022-07-22 21:44:32,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:32,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2022-07-22 21:44:32,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,443 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,444 INFO L186 Difference]: Start difference. First operand has 99 places, 93 transitions, 213 flow. Second operand 7 states and 612 transitions. [2022-07-22 21:44:32,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 112 transitions, 341 flow [2022-07-22 21:44:32,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 112 transitions, 334 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-22 21:44:32,446 INFO L242 Difference]: Finished difference. Result has 104 places, 95 transitions, 239 flow [2022-07-22 21:44:32,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=104, PETRI_TRANSITIONS=95} [2022-07-22 21:44:32,447 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2022-07-22 21:44:32,447 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 239 flow [2022-07-22 21:44:32,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,448 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:32,448 INFO L200 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] [2022-07-22 21:44:32,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:44:32,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:32,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:32,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1355540335, now seen corresponding path program 3 times [2022-07-22 21:44:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:32,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486042032] [2022-07-22 21:44:32,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:32,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:32,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:32,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486042032] [2022-07-22 21:44:32,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486042032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:32,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:32,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:44:32,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908322659] [2022-07-22 21:44:32,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:32,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:44:32,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:32,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:44:32,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:44:32,564 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-07-22 21:44:32,564 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 95 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:32,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-07-22 21:44:32,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:32,733 INFO L129 PetriNetUnfolder]: 224/608 cut-off events. [2022-07-22 21:44:32,733 INFO L130 PetriNetUnfolder]: For 242/242 co-relation queries the response was YES. [2022-07-22 21:44:32,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 608 events. 224/608 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3197 event pairs, 29 based on Foata normal form. 6/557 useless extension candidates. Maximal degree in co-relation 1166. Up to 157 conditions per place. [2022-07-22 21:44:32,737 INFO L132 encePairwiseOnDemand]: 98/109 looper letters, 33 selfloop transitions, 7 changer transitions 36/142 dead transitions. [2022-07-22 21:44:32,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 142 transitions, 539 flow [2022-07-22 21:44:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:44:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:44:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 784 transitions. [2022-07-22 21:44:32,740 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.799184505606524 [2022-07-22 21:44:32,740 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 784 transitions. [2022-07-22 21:44:32,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 784 transitions. [2022-07-22 21:44:32,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:32,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 784 transitions. [2022-07-22 21:44:32,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.11111111111111) internal successors, (784), 9 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,765 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,765 INFO L186 Difference]: Start difference. First operand has 104 places, 95 transitions, 239 flow. Second operand 9 states and 784 transitions. [2022-07-22 21:44:32,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 142 transitions, 539 flow [2022-07-22 21:44:32,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 142 transitions, 526 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-22 21:44:32,768 INFO L242 Difference]: Finished difference. Result has 113 places, 97 transitions, 281 flow [2022-07-22 21:44:32,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2022-07-22 21:44:32,769 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 15 predicate places. [2022-07-22 21:44:32,769 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 281 flow [2022-07-22 21:44:32,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,770 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:32,770 INFO L200 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] [2022-07-22 21:44:32,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:44:32,770 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:32,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash -214740210, now seen corresponding path program 1 times [2022-07-22 21:44:32,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:32,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308594736] [2022-07-22 21:44:32,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:32,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:32,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:32,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308594736] [2022-07-22 21:44:32,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308594736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:32,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:32,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:44:32,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506426927] [2022-07-22 21:44:32,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:32,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:32,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:32,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:32,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:44:32,852 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-22 21:44:32,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:32,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-22 21:44:32,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:33,010 INFO L129 PetriNetUnfolder]: 323/803 cut-off events. [2022-07-22 21:44:33,011 INFO L130 PetriNetUnfolder]: For 645/652 co-relation queries the response was YES. [2022-07-22 21:44:33,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 803 events. 323/803 cut-off events. For 645/652 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4554 event pairs, 25 based on Foata normal form. 6/724 useless extension candidates. Maximal degree in co-relation 1858. Up to 179 conditions per place. [2022-07-22 21:44:33,017 INFO L132 encePairwiseOnDemand]: 100/109 looper letters, 55 selfloop transitions, 18 changer transitions 6/148 dead transitions. [2022-07-22 21:44:33,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 148 transitions, 678 flow [2022-07-22 21:44:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:44:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:44:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2022-07-22 21:44:33,019 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.854521625163827 [2022-07-22 21:44:33,019 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2022-07-22 21:44:33,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2022-07-22 21:44:33,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:33,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2022-07-22 21:44:33,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,022 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,023 INFO L186 Difference]: Start difference. First operand has 113 places, 97 transitions, 281 flow. Second operand 7 states and 652 transitions. [2022-07-22 21:44:33,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 148 transitions, 678 flow [2022-07-22 21:44:33,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 148 transitions, 650 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-07-22 21:44:33,028 INFO L242 Difference]: Finished difference. Result has 116 places, 110 transitions, 420 flow [2022-07-22 21:44:33,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=420, PETRI_PLACES=116, PETRI_TRANSITIONS=110} [2022-07-22 21:44:33,029 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 18 predicate places. [2022-07-22 21:44:33,029 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 110 transitions, 420 flow [2022-07-22 21:44:33,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,029 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:33,030 INFO L200 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] [2022-07-22 21:44:33,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:44:33,030 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:33,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:33,030 INFO L85 PathProgramCache]: Analyzing trace with hash -108227670, now seen corresponding path program 2 times [2022-07-22 21:44:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:33,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592374102] [2022-07-22 21:44:33,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:33,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:33,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:33,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592374102] [2022-07-22 21:44:33,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592374102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:33,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:33,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:44:33,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898965200] [2022-07-22 21:44:33,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:33,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:44:33,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:33,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:44:33,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:44:33,150 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-07-22 21:44:33,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 110 transitions, 420 flow. Second operand has 8 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:33,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-07-22 21:44:33,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:33,401 INFO L129 PetriNetUnfolder]: 433/1135 cut-off events. [2022-07-22 21:44:33,401 INFO L130 PetriNetUnfolder]: For 2069/2085 co-relation queries the response was YES. [2022-07-22 21:44:33,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 1135 events. 433/1135 cut-off events. For 2069/2085 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7301 event pairs, 67 based on Foata normal form. 16/1053 useless extension candidates. Maximal degree in co-relation 3181. Up to 236 conditions per place. [2022-07-22 21:44:33,410 INFO L132 encePairwiseOnDemand]: 97/109 looper letters, 68 selfloop transitions, 10 changer transitions 38/182 dead transitions. [2022-07-22 21:44:33,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 182 transitions, 1095 flow [2022-07-22 21:44:33,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 21:44:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-22 21:44:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 931 transitions. [2022-07-22 21:44:33,413 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7764804003336113 [2022-07-22 21:44:33,413 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 931 transitions. [2022-07-22 21:44:33,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 931 transitions. [2022-07-22 21:44:33,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:33,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 931 transitions. [2022-07-22 21:44:33,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 84.63636363636364) internal successors, (931), 11 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,419 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,419 INFO L186 Difference]: Start difference. First operand has 116 places, 110 transitions, 420 flow. Second operand 11 states and 931 transitions. [2022-07-22 21:44:33,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 182 transitions, 1095 flow [2022-07-22 21:44:33,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 182 transitions, 1084 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-22 21:44:33,428 INFO L242 Difference]: Finished difference. Result has 130 places, 112 transitions, 486 flow [2022-07-22 21:44:33,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=486, PETRI_PLACES=130, PETRI_TRANSITIONS=112} [2022-07-22 21:44:33,431 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 32 predicate places. [2022-07-22 21:44:33,431 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 112 transitions, 486 flow [2022-07-22 21:44:33,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,432 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:33,432 INFO L200 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] [2022-07-22 21:44:33,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:44:33,432 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:33,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:33,433 INFO L85 PathProgramCache]: Analyzing trace with hash 477981010, now seen corresponding path program 3 times [2022-07-22 21:44:33,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:33,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959952982] [2022-07-22 21:44:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:33,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:33,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:33,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959952982] [2022-07-22 21:44:33,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959952982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:33,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:33,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:44:33,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872171979] [2022-07-22 21:44:33,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:33,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:33,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:33,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:33,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:44:33,556 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-22 21:44:33,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 112 transitions, 486 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:33,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-22 21:44:33,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:33,768 INFO L129 PetriNetUnfolder]: 594/1490 cut-off events. [2022-07-22 21:44:33,768 INFO L130 PetriNetUnfolder]: For 4347/4374 co-relation queries the response was YES. [2022-07-22 21:44:33,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4675 conditions, 1490 events. 594/1490 cut-off events. For 4347/4374 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10737 event pairs, 42 based on Foata normal form. 12/1388 useless extension candidates. Maximal degree in co-relation 4654. Up to 334 conditions per place. [2022-07-22 21:44:33,779 INFO L132 encePairwiseOnDemand]: 101/109 looper letters, 74 selfloop transitions, 30 changer transitions 2/175 dead transitions. [2022-07-22 21:44:33,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 175 transitions, 1212 flow [2022-07-22 21:44:33,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:44:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:44:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions. [2022-07-22 21:44:33,781 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8558322411533421 [2022-07-22 21:44:33,781 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 653 transitions. [2022-07-22 21:44:33,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 653 transitions. [2022-07-22 21:44:33,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:33,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 653 transitions. [2022-07-22 21:44:33,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,784 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,784 INFO L186 Difference]: Start difference. First operand has 130 places, 112 transitions, 486 flow. Second operand 7 states and 653 transitions. [2022-07-22 21:44:33,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 175 transitions, 1212 flow [2022-07-22 21:44:33,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 175 transitions, 1149 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-07-22 21:44:33,798 INFO L242 Difference]: Finished difference. Result has 130 places, 130 transitions, 785 flow [2022-07-22 21:44:33,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=785, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2022-07-22 21:44:33,799 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 32 predicate places. [2022-07-22 21:44:33,799 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 785 flow [2022-07-22 21:44:33,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,799 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:33,800 INFO L200 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] [2022-07-22 21:44:33,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 21:44:33,800 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:33,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash 768641710, now seen corresponding path program 4 times [2022-07-22 21:44:33,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:33,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736455769] [2022-07-22 21:44:33,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:33,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:33,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:33,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736455769] [2022-07-22 21:44:33,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736455769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:33,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:33,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:44:33,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250558594] [2022-07-22 21:44:33,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:33,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:33,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:33,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:33,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:44:33,876 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-22 21:44:33,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 785 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:33,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-22 21:44:33,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:34,167 INFO L129 PetriNetUnfolder]: 832/2072 cut-off events. [2022-07-22 21:44:34,168 INFO L130 PetriNetUnfolder]: For 8233/8267 co-relation queries the response was YES. [2022-07-22 21:44:34,175 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6890 conditions, 2072 events. 832/2072 cut-off events. For 8233/8267 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 16208 event pairs, 118 based on Foata normal form. 96/2036 useless extension candidates. Maximal degree in co-relation 6867. Up to 578 conditions per place. [2022-07-22 21:44:34,184 INFO L132 encePairwiseOnDemand]: 100/109 looper letters, 98 selfloop transitions, 49 changer transitions 22/238 dead transitions. [2022-07-22 21:44:34,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 238 transitions, 2090 flow [2022-07-22 21:44:34,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:44:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:44:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 841 transitions. [2022-07-22 21:44:34,187 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8572884811416922 [2022-07-22 21:44:34,187 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 841 transitions. [2022-07-22 21:44:34,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 841 transitions. [2022-07-22 21:44:34,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:34,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 841 transitions. [2022-07-22 21:44:34,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.44444444444444) internal successors, (841), 9 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:34,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:34,220 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:34,220 INFO L186 Difference]: Start difference. First operand has 130 places, 130 transitions, 785 flow. Second operand 9 states and 841 transitions. [2022-07-22 21:44:34,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 238 transitions, 2090 flow [2022-07-22 21:44:34,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 238 transitions, 2080 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-07-22 21:44:34,241 INFO L242 Difference]: Finished difference. Result has 146 places, 157 transitions, 1337 flow [2022-07-22 21:44:34,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1337, PETRI_PLACES=146, PETRI_TRANSITIONS=157} [2022-07-22 21:44:34,242 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 48 predicate places. [2022-07-22 21:44:34,242 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 157 transitions, 1337 flow [2022-07-22 21:44:34,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:34,243 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:34,243 INFO L200 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] [2022-07-22 21:44:34,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 21:44:34,243 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:34,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:34,243 INFO L85 PathProgramCache]: Analyzing trace with hash 683985028, now seen corresponding path program 5 times [2022-07-22 21:44:34,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:34,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362795485] [2022-07-22 21:44:34,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:34,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:34,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:34,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362795485] [2022-07-22 21:44:34,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362795485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:34,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:34,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:44:34,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147478615] [2022-07-22 21:44:34,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:34,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:34,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:34,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:34,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:44:34,300 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-22 21:44:34,300 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 157 transitions, 1337 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:34,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:34,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-22 21:44:34,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:34,623 INFO L129 PetriNetUnfolder]: 871/2130 cut-off events. [2022-07-22 21:44:34,624 INFO L130 PetriNetUnfolder]: For 11966/12013 co-relation queries the response was YES. [2022-07-22 21:44:34,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8342 conditions, 2130 events. 871/2130 cut-off events. For 11966/12013 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16671 event pairs, 54 based on Foata normal form. 14/1983 useless extension candidates. Maximal degree in co-relation 8311. Up to 621 conditions per place. [2022-07-22 21:44:34,640 INFO L132 encePairwiseOnDemand]: 100/109 looper letters, 88 selfloop transitions, 64 changer transitions 3/224 dead transitions. [2022-07-22 21:44:34,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 224 transitions, 2274 flow [2022-07-22 21:44:34,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:44:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:44:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 833 transitions. [2022-07-22 21:44:34,642 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8491335372069317 [2022-07-22 21:44:34,642 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 833 transitions. [2022-07-22 21:44:34,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 833 transitions. [2022-07-22 21:44:34,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:34,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 833 transitions. [2022-07-22 21:44:34,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.55555555555556) internal successors, (833), 9 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:34,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:34,646 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:34,646 INFO L186 Difference]: Start difference. First operand has 146 places, 157 transitions, 1337 flow. Second operand 9 states and 833 transitions. [2022-07-22 21:44:34,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 224 transitions, 2274 flow [2022-07-22 21:44:34,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 224 transitions, 2226 flow, removed 24 selfloop flow, removed 1 redundant places. [2022-07-22 21:44:34,676 INFO L242 Difference]: Finished difference. Result has 157 places, 171 transitions, 1734 flow [2022-07-22 21:44:34,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1734, PETRI_PLACES=157, PETRI_TRANSITIONS=171} [2022-07-22 21:44:34,677 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 59 predicate places. [2022-07-22 21:44:34,677 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 171 transitions, 1734 flow [2022-07-22 21:44:34,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:34,677 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:34,677 INFO L200 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] [2022-07-22 21:44:34,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 21:44:34,678 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:34,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:34,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1839617844, now seen corresponding path program 6 times [2022-07-22 21:44:34,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:34,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662742834] [2022-07-22 21:44:34,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:34,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:34,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:34,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662742834] [2022-07-22 21:44:34,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662742834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:34,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:34,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:44:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983690285] [2022-07-22 21:44:34,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:34,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:34,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:34,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:34,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:44:34,741 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-22 21:44:34,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 171 transitions, 1734 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:34,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:34,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-22 21:44:34,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:35,023 INFO L129 PetriNetUnfolder]: 853/2078 cut-off events. [2022-07-22 21:44:35,023 INFO L130 PetriNetUnfolder]: For 15407/15432 co-relation queries the response was YES. [2022-07-22 21:44:35,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9036 conditions, 2078 events. 853/2078 cut-off events. For 15407/15432 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16188 event pairs, 220 based on Foata normal form. 7/1915 useless extension candidates. Maximal degree in co-relation 9000. Up to 1010 conditions per place. [2022-07-22 21:44:35,044 INFO L132 encePairwiseOnDemand]: 99/109 looper letters, 97 selfloop transitions, 38 changer transitions 10/214 dead transitions. [2022-07-22 21:44:35,044 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 214 transitions, 2540 flow [2022-07-22 21:44:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 21:44:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-22 21:44:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 723 transitions. [2022-07-22 21:44:35,046 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8291284403669725 [2022-07-22 21:44:35,046 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 723 transitions. [2022-07-22 21:44:35,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 723 transitions. [2022-07-22 21:44:35,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:35,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 723 transitions. [2022-07-22 21:44:35,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.375) internal successors, (723), 8 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) [2022-07-22 21:44:35,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,049 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,049 INFO L186 Difference]: Start difference. First operand has 157 places, 171 transitions, 1734 flow. Second operand 8 states and 723 transitions. [2022-07-22 21:44:35,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 214 transitions, 2540 flow [2022-07-22 21:44:35,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 214 transitions, 2381 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-07-22 21:44:35,096 INFO L242 Difference]: Finished difference. Result has 162 places, 176 transitions, 1811 flow [2022-07-22 21:44:35,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1811, PETRI_PLACES=162, PETRI_TRANSITIONS=176} [2022-07-22 21:44:35,097 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 64 predicate places. [2022-07-22 21:44:35,097 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 176 transitions, 1811 flow [2022-07-22 21:44:35,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,097 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:35,098 INFO L200 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] [2022-07-22 21:44:35,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 21:44:35,098 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:35,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:35,098 INFO L85 PathProgramCache]: Analyzing trace with hash -646087402, now seen corresponding path program 7 times [2022-07-22 21:44:35,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:35,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263360615] [2022-07-22 21:44:35,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:35,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:35,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:35,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263360615] [2022-07-22 21:44:35,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263360615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:35,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:35,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:44:35,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145580891] [2022-07-22 21:44:35,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:35,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:35,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:35,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:35,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:44:35,169 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-22 21:44:35,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 176 transitions, 1811 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,169 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:35,169 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-22 21:44:35,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:35,449 INFO L129 PetriNetUnfolder]: 832/1897 cut-off events. [2022-07-22 21:44:35,449 INFO L130 PetriNetUnfolder]: For 14689/14733 co-relation queries the response was YES. [2022-07-22 21:44:35,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 1897 events. 832/1897 cut-off events. For 14689/14733 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13901 event pairs, 48 based on Foata normal form. 2/1751 useless extension candidates. Maximal degree in co-relation 8487. Up to 615 conditions per place. [2022-07-22 21:44:35,472 INFO L132 encePairwiseOnDemand]: 101/109 looper letters, 110 selfloop transitions, 45 changer transitions 6/230 dead transitions. [2022-07-22 21:44:35,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 230 transitions, 2690 flow [2022-07-22 21:44:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:44:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:44:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 647 transitions. [2022-07-22 21:44:35,474 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8479685452162516 [2022-07-22 21:44:35,474 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 647 transitions. [2022-07-22 21:44:35,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 647 transitions. [2022-07-22 21:44:35,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:35,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 647 transitions. [2022-07-22 21:44:35,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,477 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,477 INFO L186 Difference]: Start difference. First operand has 162 places, 176 transitions, 1811 flow. Second operand 7 states and 647 transitions. [2022-07-22 21:44:35,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 230 transitions, 2690 flow [2022-07-22 21:44:35,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 230 transitions, 2583 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-07-22 21:44:35,527 INFO L242 Difference]: Finished difference. Result has 165 places, 176 transitions, 1851 flow [2022-07-22 21:44:35,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1851, PETRI_PLACES=165, PETRI_TRANSITIONS=176} [2022-07-22 21:44:35,528 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 67 predicate places. [2022-07-22 21:44:35,528 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 176 transitions, 1851 flow [2022-07-22 21:44:35,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,528 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:35,529 INFO L200 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] [2022-07-22 21:44:35,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 21:44:35,529 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:35,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:35,529 INFO L85 PathProgramCache]: Analyzing trace with hash 881879063, now seen corresponding path program 1 times [2022-07-22 21:44:35,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:35,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760788760] [2022-07-22 21:44:35,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:35,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:35,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:35,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760788760] [2022-07-22 21:44:35,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760788760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:35,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:35,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:44:35,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606335235] [2022-07-22 21:44:35,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:35,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:35,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:35,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:35,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:44:35,588 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-22 21:44:35,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 176 transitions, 1851 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:35,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-22 21:44:35,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:35,817 INFO L129 PetriNetUnfolder]: 608/1824 cut-off events. [2022-07-22 21:44:35,817 INFO L130 PetriNetUnfolder]: For 11600/11693 co-relation queries the response was YES. [2022-07-22 21:44:35,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7026 conditions, 1824 events. 608/1824 cut-off events. For 11600/11693 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13717 event pairs, 53 based on Foata normal form. 34/1656 useless extension candidates. Maximal degree in co-relation 6987. Up to 381 conditions per place. [2022-07-22 21:44:35,838 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 18 selfloop transitions, 6 changer transitions 0/181 dead transitions. [2022-07-22 21:44:35,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 181 transitions, 1920 flow [2022-07-22 21:44:35,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:44:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:44:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-07-22 21:44:35,839 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8458715596330275 [2022-07-22 21:44:35,840 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 461 transitions. [2022-07-22 21:44:35,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 461 transitions. [2022-07-22 21:44:35,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:35,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 461 transitions. [2022-07-22 21:44:35,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,842 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,843 INFO L186 Difference]: Start difference. First operand has 165 places, 176 transitions, 1851 flow. Second operand 5 states and 461 transitions. [2022-07-22 21:44:35,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 181 transitions, 1920 flow [2022-07-22 21:44:35,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 181 transitions, 1845 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-07-22 21:44:35,881 INFO L242 Difference]: Finished difference. Result has 165 places, 177 transitions, 1800 flow [2022-07-22 21:44:35,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1800, PETRI_PLACES=165, PETRI_TRANSITIONS=177} [2022-07-22 21:44:35,883 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 67 predicate places. [2022-07-22 21:44:35,883 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 177 transitions, 1800 flow [2022-07-22 21:44:35,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,884 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:35,884 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:35,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 21:44:35,884 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:35,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash -222094646, now seen corresponding path program 1 times [2022-07-22 21:44:35,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:35,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117640983] [2022-07-22 21:44:35,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:35,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:35,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:35,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117640983] [2022-07-22 21:44:35,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117640983] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:35,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138543863] [2022-07-22 21:44:35,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:35,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:35,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:35,966 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) [2022-07-22 21:44:35,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 21:44:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:36,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 21:44:36,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:36,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:36,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138543863] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:44:36,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:44:36,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2022-07-22 21:44:36,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515578821] [2022-07-22 21:44:36,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:44:36,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 21:44:36,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:36,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 21:44:36,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-22 21:44:36,333 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-07-22 21:44:36,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 177 transitions, 1800 flow. Second operand has 14 states, 14 states have (on average 81.78571428571429) internal successors, (1145), 14 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:36,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:36,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-07-22 21:44:36,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:37,310 INFO L129 PetriNetUnfolder]: 2093/5285 cut-off events. [2022-07-22 21:44:37,310 INFO L130 PetriNetUnfolder]: For 36424/36566 co-relation queries the response was YES. [2022-07-22 21:44:37,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21883 conditions, 5285 events. 2093/5285 cut-off events. For 36424/36566 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 48805 event pairs, 76 based on Foata normal form. 30/4845 useless extension candidates. Maximal degree in co-relation 21845. Up to 767 conditions per place. [2022-07-22 21:44:37,356 INFO L132 encePairwiseOnDemand]: 96/109 looper letters, 101 selfloop transitions, 118 changer transitions 166/465 dead transitions. [2022-07-22 21:44:37,357 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 465 transitions, 6491 flow [2022-07-22 21:44:37,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 21:44:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-22 21:44:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1809 transitions. [2022-07-22 21:44:37,360 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7903014416775884 [2022-07-22 21:44:37,360 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1809 transitions. [2022-07-22 21:44:37,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1809 transitions. [2022-07-22 21:44:37,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:37,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1809 transitions. [2022-07-22 21:44:37,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 86.14285714285714) internal successors, (1809), 21 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:37,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 109.0) internal successors, (2398), 22 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:37,367 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 109.0) internal successors, (2398), 22 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:37,367 INFO L186 Difference]: Start difference. First operand has 165 places, 177 transitions, 1800 flow. Second operand 21 states and 1809 transitions. [2022-07-22 21:44:37,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 465 transitions, 6491 flow [2022-07-22 21:44:37,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 465 transitions, 6480 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-22 21:44:37,527 INFO L242 Difference]: Finished difference. Result has 193 places, 258 transitions, 3415 flow [2022-07-22 21:44:37,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3415, PETRI_PLACES=193, PETRI_TRANSITIONS=258} [2022-07-22 21:44:37,528 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 95 predicate places. [2022-07-22 21:44:37,528 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 258 transitions, 3415 flow [2022-07-22 21:44:37,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.78571428571429) internal successors, (1145), 14 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:37,528 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:37,529 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:37,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 21:44:37,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 21:44:37,737 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:37,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:37,737 INFO L85 PathProgramCache]: Analyzing trace with hash 722917089, now seen corresponding path program 1 times [2022-07-22 21:44:37,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:37,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459420430] [2022-07-22 21:44:37,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:37,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 21:44:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:37,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459420430] [2022-07-22 21:44:37,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459420430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:37,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:37,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:44:37,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467319982] [2022-07-22 21:44:37,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:37,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:37,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:37,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:44:37,797 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-22 21:44:37,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 258 transitions, 3415 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:37,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:37,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-22 21:44:37,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:38,175 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][185], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), 56#L115-4true, Black: 253#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 131#true, Black: 261#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 279#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), 62#L72true, Black: 294#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 296#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 304#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 165#true, 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 176#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 28#L61true, Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 167#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 865#true, Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 840#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 850#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 314#(<= 1 ~pos~0), Black: 838#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 852#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), 266#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 115#true, Black: 236#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 846#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 234#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), Black: 232#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|))]) [2022-07-22 21:44:38,175 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-07-22 21:44:38,176 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-22 21:44:38,176 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-22 21:44:38,176 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-22 21:44:38,401 INFO L129 PetriNetUnfolder]: 1293/4073 cut-off events. [2022-07-22 21:44:38,402 INFO L130 PetriNetUnfolder]: For 41940/42635 co-relation queries the response was YES. [2022-07-22 21:44:38,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18787 conditions, 4073 events. 1293/4073 cut-off events. For 41940/42635 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 37842 event pairs, 166 based on Foata normal form. 188/3819 useless extension candidates. Maximal degree in co-relation 18738. Up to 1017 conditions per place. [2022-07-22 21:44:38,444 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 43 selfloop transitions, 10 changer transitions 4/269 dead transitions. [2022-07-22 21:44:38,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 269 transitions, 3602 flow [2022-07-22 21:44:38,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:44:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:44:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-07-22 21:44:38,446 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8532110091743119 [2022-07-22 21:44:38,446 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 465 transitions. [2022-07-22 21:44:38,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 465 transitions. [2022-07-22 21:44:38,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:38,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 465 transitions. [2022-07-22 21:44:38,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:38,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:38,448 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:38,448 INFO L186 Difference]: Start difference. First operand has 193 places, 258 transitions, 3415 flow. Second operand 5 states and 465 transitions. [2022-07-22 21:44:38,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 269 transitions, 3602 flow [2022-07-22 21:44:38,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 269 transitions, 3486 flow, removed 55 selfloop flow, removed 5 redundant places. [2022-07-22 21:44:38,573 INFO L242 Difference]: Finished difference. Result has 188 places, 253 transitions, 3239 flow [2022-07-22 21:44:38,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=3271, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3239, PETRI_PLACES=188, PETRI_TRANSITIONS=253} [2022-07-22 21:44:38,574 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 90 predicate places. [2022-07-22 21:44:38,574 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 253 transitions, 3239 flow [2022-07-22 21:44:38,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:38,574 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:38,575 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:38,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 21:44:38,575 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:38,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:38,575 INFO L85 PathProgramCache]: Analyzing trace with hash -677892328, now seen corresponding path program 2 times [2022-07-22 21:44:38,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:38,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156823570] [2022-07-22 21:44:38,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:38,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:44:38,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:38,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156823570] [2022-07-22 21:44:38,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156823570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:38,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244804003] [2022-07-22 21:44:38,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:44:38,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:38,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:38,650 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) [2022-07-22 21:44:38,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 21:44:38,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:44:38,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:44:38,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 21:44:38,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:38,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:44:38,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244804003] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:44:38,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:44:38,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-07-22 21:44:38,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907178773] [2022-07-22 21:44:38,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:44:38,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 21:44:38,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:38,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 21:44:38,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:44:38,892 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-22 21:44:38,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 253 transitions, 3239 flow. Second operand has 9 states, 9 states have (on average 90.55555555555556) internal successors, (815), 9 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:38,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:38,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-22 21:44:38,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:39,931 INFO L129 PetriNetUnfolder]: 2531/7808 cut-off events. [2022-07-22 21:44:39,931 INFO L130 PetriNetUnfolder]: For 80880/81745 co-relation queries the response was YES. [2022-07-22 21:44:39,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37012 conditions, 7808 events. 2531/7808 cut-off events. For 80880/81745 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 80543 event pairs, 201 based on Foata normal form. 186/7216 useless extension candidates. Maximal degree in co-relation 36963. Up to 1105 conditions per place. [2022-07-22 21:44:40,025 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 76 selfloop transitions, 20 changer transitions 0/308 dead transitions. [2022-07-22 21:44:40,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 308 transitions, 3938 flow [2022-07-22 21:44:40,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:44:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:44:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2022-07-22 21:44:40,026 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.854521625163827 [2022-07-22 21:44:40,026 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2022-07-22 21:44:40,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2022-07-22 21:44:40,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:40,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2022-07-22 21:44:40,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:40,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:40,029 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:40,029 INFO L186 Difference]: Start difference. First operand has 188 places, 253 transitions, 3239 flow. Second operand 7 states and 652 transitions. [2022-07-22 21:44:40,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 308 transitions, 3938 flow [2022-07-22 21:44:40,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 308 transitions, 3911 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-07-22 21:44:40,377 INFO L242 Difference]: Finished difference. Result has 193 places, 265 transitions, 3437 flow [2022-07-22 21:44:40,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=3223, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3437, PETRI_PLACES=193, PETRI_TRANSITIONS=265} [2022-07-22 21:44:40,378 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 95 predicate places. [2022-07-22 21:44:40,378 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 265 transitions, 3437 flow [2022-07-22 21:44:40,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.55555555555556) internal successors, (815), 9 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:40,378 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:40,378 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:40,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-22 21:44:40,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 21:44:40,614 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:40,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash -551060997, now seen corresponding path program 1 times [2022-07-22 21:44:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:40,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842439169] [2022-07-22 21:44:40,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:40,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:40,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842439169] [2022-07-22 21:44:40,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842439169] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:40,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222278394] [2022-07-22 21:44:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:40,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:40,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:40,776 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) [2022-07-22 21:44:40,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 21:44:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:40,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 21:44:40,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:41,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:41,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222278394] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:44:41,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:44:41,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2022-07-22 21:44:41,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008589351] [2022-07-22 21:44:41,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:44:41,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 21:44:41,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:41,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 21:44:41,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-07-22 21:44:41,115 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 109 [2022-07-22 21:44:41,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 265 transitions, 3437 flow. Second operand has 18 states, 18 states have (on average 77.94444444444444) internal successors, (1403), 18 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:41,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:41,116 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 109 [2022-07-22 21:44:41,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:45,025 INFO L129 PetriNetUnfolder]: 8350/20885 cut-off events. [2022-07-22 21:44:45,025 INFO L130 PetriNetUnfolder]: For 250856/252124 co-relation queries the response was YES. [2022-07-22 21:44:45,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112568 conditions, 20885 events. 8350/20885 cut-off events. For 250856/252124 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 231633 event pairs, 273 based on Foata normal form. 343/19701 useless extension candidates. Maximal degree in co-relation 112517. Up to 3153 conditions per place. [2022-07-22 21:44:45,296 INFO L132 encePairwiseOnDemand]: 95/109 looper letters, 286 selfloop transitions, 206 changer transitions 177/745 dead transitions. [2022-07-22 21:44:45,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 745 transitions, 12513 flow [2022-07-22 21:44:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 21:44:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-22 21:44:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1982 transitions. [2022-07-22 21:44:45,299 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7576452599388379 [2022-07-22 21:44:45,299 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1982 transitions. [2022-07-22 21:44:45,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1982 transitions. [2022-07-22 21:44:45,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:45,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1982 transitions. [2022-07-22 21:44:45,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 82.58333333333333) internal successors, (1982), 24 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:45,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 109.0) internal successors, (2725), 25 states have internal predecessors, (2725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:45,306 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 109.0) internal successors, (2725), 25 states have internal predecessors, (2725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:45,307 INFO L186 Difference]: Start difference. First operand has 193 places, 265 transitions, 3437 flow. Second operand 24 states and 1982 transitions. [2022-07-22 21:44:45,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 745 transitions, 12513 flow [2022-07-22 21:44:46,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 745 transitions, 12425 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-07-22 21:44:46,328 INFO L242 Difference]: Finished difference. Result has 226 places, 416 transitions, 6636 flow [2022-07-22 21:44:46,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=3391, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6636, PETRI_PLACES=226, PETRI_TRANSITIONS=416} [2022-07-22 21:44:46,329 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 128 predicate places. [2022-07-22 21:44:46,329 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 416 transitions, 6636 flow [2022-07-22 21:44:46,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 77.94444444444444) internal successors, (1403), 18 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:46,330 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:46,330 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:46,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 21:44:46,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:46,541 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:46,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:46,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2095513248, now seen corresponding path program 2 times [2022-07-22 21:44:46,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:46,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43231463] [2022-07-22 21:44:46,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:46,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 21:44:46,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:46,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43231463] [2022-07-22 21:44:46,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43231463] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:46,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411152332] [2022-07-22 21:44:46,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:44:46,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:46,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:46,607 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 21:44:46,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 21:44:46,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:44:46,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:44:46,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 21:44:46,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:44:46,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 21:44:46,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411152332] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:44:46,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:44:46,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-07-22 21:44:46,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530585739] [2022-07-22 21:44:46,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:44:46,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 21:44:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:46,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 21:44:46,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:44:46,804 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-22 21:44:46,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 416 transitions, 6636 flow. Second operand has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:46,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:46,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-22 21:44:46,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:47,482 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][212], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 127#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 2041#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 879#(<= ~c2~0 1), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 131#true, Black: 261#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 279#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), 62#L72true, Black: 294#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 296#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 987#(= ~c2~0 0), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 304#(<= ~c2~0 0), 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 165#true, Black: 176#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 28#L61true, Black: 167#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 840#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 314#(<= 1 ~pos~0), Black: 838#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 869#(<= ~c1~0 0), 266#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 115#true, Black: 236#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 846#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 234#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), Black: 232#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 2043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= 2 ~pos~0) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1424#true]) [2022-07-22 21:44:47,484 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-07-22 21:44:47,484 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-22 21:44:47,484 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-22 21:44:47,484 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-22 21:44:47,857 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][285], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 127#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 2041#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 987#(= ~c2~0 0), Black: 131#true, Black: 261#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 279#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), Black: 294#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 296#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 27#L87true, Black: 304#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 165#true, Black: 176#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 28#L61true, Black: 167#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 879#(<= ~c2~0 1), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 840#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 314#(<= 1 ~pos~0), Black: 838#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 869#(<= ~c1~0 0), 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 115#true, 848#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 236#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), Black: 232#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 2033#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 2043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= 2 ~pos~0) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1424#true]) [2022-07-22 21:44:47,857 INFO L384 tUnfolder$Statistics]: this new event has 75 ancestors and is not cut-off event [2022-07-22 21:44:47,857 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-07-22 21:44:47,858 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-07-22 21:44:47,858 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-07-22 21:44:48,070 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][282], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 127#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 2041#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 879#(<= ~c2~0 1), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 987#(= ~c2~0 0), Black: 131#true, Black: 261#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 279#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), Black: 294#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 62#L72true, Black: 296#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 304#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 165#true, Black: 176#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 28#L61true, 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 167#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 840#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 874#true, Black: 314#(<= 1 ~pos~0), Black: 838#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 313#(<= 0 ~pos~0), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 869#(<= ~c1~0 0), 266#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 115#true, Black: 236#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 846#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 234#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), Black: 232#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 2033#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 2043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= 2 ~pos~0) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1424#true]) [2022-07-22 21:44:48,070 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-07-22 21:44:48,070 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-07-22 21:44:48,070 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-07-22 21:44:48,070 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-07-22 21:44:50,747 INFO L129 PetriNetUnfolder]: 7517/23503 cut-off events. [2022-07-22 21:44:50,747 INFO L130 PetriNetUnfolder]: For 406186/410623 co-relation queries the response was YES. [2022-07-22 21:44:51,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131221 conditions, 23503 events. 7517/23503 cut-off events. For 406186/410623 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 289350 event pairs, 668 based on Foata normal form. 827/22197 useless extension candidates. Maximal degree in co-relation 131157. Up to 3493 conditions per place. [2022-07-22 21:44:51,157 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 241 selfloop transitions, 52 changer transitions 11/559 dead transitions. [2022-07-22 21:44:51,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 559 transitions, 9418 flow [2022-07-22 21:44:51,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:44:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:44:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 658 transitions. [2022-07-22 21:44:51,159 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8623853211009175 [2022-07-22 21:44:51,159 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 658 transitions. [2022-07-22 21:44:51,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 658 transitions. [2022-07-22 21:44:51,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:51,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 658 transitions. [2022-07-22 21:44:51,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:51,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:51,162 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:51,162 INFO L186 Difference]: Start difference. First operand has 226 places, 416 transitions, 6636 flow. Second operand 7 states and 658 transitions. [2022-07-22 21:44:51,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 559 transitions, 9418 flow [2022-07-22 21:44:53,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 559 transitions, 8475 flow, removed 462 selfloop flow, removed 5 redundant places. [2022-07-22 21:44:53,582 INFO L242 Difference]: Finished difference. Result has 229 places, 432 transitions, 6590 flow [2022-07-22 21:44:53,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=5977, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6590, PETRI_PLACES=229, PETRI_TRANSITIONS=432} [2022-07-22 21:44:53,582 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 131 predicate places. [2022-07-22 21:44:53,582 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 432 transitions, 6590 flow [2022-07-22 21:44:53,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:53,583 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:53,583 INFO L200 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:44:53,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 21:44:53,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 21:44:53,784 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:44:53,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2082952329, now seen corresponding path program 3 times [2022-07-22 21:44:53,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:53,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789584665] [2022-07-22 21:44:53,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 21:44:53,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:53,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789584665] [2022-07-22 21:44:53,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789584665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:53,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:53,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:44:53,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549602284] [2022-07-22 21:44:53,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:53,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:44:53,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:53,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:44:53,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:44:53,860 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-07-22 21:44:53,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 432 transitions, 6590 flow. Second operand has 8 states, 8 states have (on average 80.125) internal successors, (641), 8 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:53,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:53,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-07-22 21:44:53,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:59,988 INFO L129 PetriNetUnfolder]: 13549/34794 cut-off events. [2022-07-22 21:44:59,988 INFO L130 PetriNetUnfolder]: For 607767/611600 co-relation queries the response was YES. [2022-07-22 21:45:00,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204166 conditions, 34794 events. 13549/34794 cut-off events. For 607767/611600 co-relation queries the response was YES. Maximal size of possible extension queue 1731. Compared 424557 event pairs, 1437 based on Foata normal form. 841/33167 useless extension candidates. Maximal degree in co-relation 204101. Up to 13330 conditions per place. [2022-07-22 21:45:00,534 INFO L132 encePairwiseOnDemand]: 97/109 looper letters, 285 selfloop transitions, 56 changer transitions 211/665 dead transitions. [2022-07-22 21:45:00,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 665 transitions, 12078 flow [2022-07-22 21:45:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 21:45:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-22 21:45:00,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 914 transitions. [2022-07-22 21:45:00,535 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.762301918265221 [2022-07-22 21:45:00,535 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 914 transitions. [2022-07-22 21:45:00,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 914 transitions. [2022-07-22 21:45:00,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:00,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 914 transitions. [2022-07-22 21:45:00,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 83.0909090909091) internal successors, (914), 11 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:00,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:00,538 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:00,538 INFO L186 Difference]: Start difference. First operand has 229 places, 432 transitions, 6590 flow. Second operand 11 states and 914 transitions. [2022-07-22 21:45:00,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 665 transitions, 12078 flow [2022-07-22 21:45:04,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 665 transitions, 11932 flow, removed 63 selfloop flow, removed 3 redundant places. [2022-07-22 21:45:04,973 INFO L242 Difference]: Finished difference. Result has 241 places, 378 transitions, 5577 flow [2022-07-22 21:45:04,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=6509, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5577, PETRI_PLACES=241, PETRI_TRANSITIONS=378} [2022-07-22 21:45:04,974 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 143 predicate places. [2022-07-22 21:45:04,974 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 378 transitions, 5577 flow [2022-07-22 21:45:04,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.125) internal successors, (641), 8 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:04,974 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:04,975 INFO L200 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:45:04,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 21:45:04,975 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:45:04,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash -4919890, now seen corresponding path program 3 times [2022-07-22 21:45:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:04,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482360285] [2022-07-22 21:45:04,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:04,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 21:45:05,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:45:05,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482360285] [2022-07-22 21:45:05,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482360285] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:45:05,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512684413] [2022-07-22 21:45:05,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 21:45:05,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:45:05,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:45:05,076 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 21:45:05,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 21:45:05,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-22 21:45:05,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:45:05,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 21:45:05,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:45:05,290 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 21:45:05,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:45:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 21:45:05,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512684413] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:45:05,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:45:05,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 16 [2022-07-22 21:45:05,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443692932] [2022-07-22 21:45:05,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:45:05,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 21:45:05,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:45:05,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 21:45:05,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-22 21:45:05,382 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-07-22 21:45:05,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 378 transitions, 5577 flow. Second operand has 16 states, 16 states have (on average 81.9375) internal successors, (1311), 16 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:05,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:45:05,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-07-22 21:45:05,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:16,235 INFO L129 PetriNetUnfolder]: 23729/57348 cut-off events. [2022-07-22 21:45:16,235 INFO L130 PetriNetUnfolder]: For 1014519/1020302 co-relation queries the response was YES. [2022-07-22 21:45:16,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 341008 conditions, 57348 events. 23729/57348 cut-off events. For 1014519/1020302 co-relation queries the response was YES. Maximal size of possible extension queue 2560. Compared 713628 event pairs, 326 based on Foata normal form. 1916/54904 useless extension candidates. Maximal degree in co-relation 340937. Up to 8805 conditions per place. [2022-07-22 21:45:17,251 INFO L132 encePairwiseOnDemand]: 96/109 looper letters, 247 selfloop transitions, 558 changer transitions 306/1226 dead transitions. [2022-07-22 21:45:17,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 1226 transitions, 23646 flow [2022-07-22 21:45:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 21:45:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-07-22 21:45:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2638 transitions. [2022-07-22 21:45:17,257 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7807043503995265 [2022-07-22 21:45:17,257 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2638 transitions. [2022-07-22 21:45:17,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2638 transitions. [2022-07-22 21:45:17,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:45:17,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2638 transitions. [2022-07-22 21:45:17,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 85.09677419354838) internal successors, (2638), 31 states have internal predecessors, (2638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:17,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 109.0) internal successors, (3488), 32 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:17,266 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 109.0) internal successors, (3488), 32 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:17,266 INFO L186 Difference]: Start difference. First operand has 241 places, 378 transitions, 5577 flow. Second operand 31 states and 2638 transitions. [2022-07-22 21:45:17,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 1226 transitions, 23646 flow [2022-07-22 21:45:25,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 1226 transitions, 22768 flow, removed 280 selfloop flow, removed 15 redundant places. [2022-07-22 21:45:25,312 INFO L242 Difference]: Finished difference. Result has 266 places, 792 transitions, 14480 flow [2022-07-22 21:45:25,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=5378, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=14480, PETRI_PLACES=266, PETRI_TRANSITIONS=792} [2022-07-22 21:45:25,313 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 168 predicate places. [2022-07-22 21:45:25,313 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 792 transitions, 14480 flow [2022-07-22 21:45:25,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 81.9375) internal successors, (1311), 16 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:25,314 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:45:25,314 INFO L200 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 21:45:25,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 21:45:25,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:45:25,521 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-22 21:45:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:45:25,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1997142877, now seen corresponding path program 4 times [2022-07-22 21:45:25,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:45:25,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161172726] [2022-07-22 21:45:25,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:45:25,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:45:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:45:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 31 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 21:45:25,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:45:25,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161172726] [2022-07-22 21:45:25,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161172726] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:45:25,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401443205] [2022-07-22 21:45:25,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 21:45:25,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:45:25,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:45:25,599 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 21:45:25,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 21:45:25,674 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 21:45:25,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:45:25,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 21:45:25,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:45:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 21:45:25,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:45:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 31 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 21:45:25,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401443205] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:45:25,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:45:25,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 10 [2022-07-22 21:45:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959631932] [2022-07-22 21:45:25,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:45:25,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 21:45:25,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:45:25,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 21:45:25,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-22 21:45:25,825 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-22 21:45:25,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 792 transitions, 14480 flow. Second operand has 10 states, 10 states have (on average 90.7) internal successors, (907), 10 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:45:25,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:45:25,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-22 21:45:25,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:45:26,738 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([347] L73-->L83: Formula: (and (= v_~c2~0_37 (+ v_~c2~0_38 1)) (= v_~pos~0_61 (+ v_~pos~0_62 1))) InVars {~c2~0=v_~c2~0_38, ~pos~0=v_~pos~0_62} OutVars{thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~pos~0=v_~pos~0_61, ~c2~0=v_~c2~0_37, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post8#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post7#1][241], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2682#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2684#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 987#(= ~c2~0 0), Black: 131#true, Black: 261#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 3402#(<= ~c1~0 1), Black: 279#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 148#(<= 0 ~pos~0), Black: 3348#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3366#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 2698#(<= 1 ~pos~0), Black: 2697#(<= 0 ~pos~0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 3364#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 304#(<= ~c2~0 0), Black: 165#true, Black: 3374#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 3372#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 3 ~pos~0)), Black: 176#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 294#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 28#L61true, Black: 3360#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 167#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 3342#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3346#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 3 ~pos~0)), Black: 3354#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3350#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3370#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3356#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3340#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3352#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 879#(<= ~c2~0 1), Black: 3362#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3358#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3344#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 2700#(<= 3 ~pos~0), 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 2699#(<= 2 ~pos~0), 275#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 236#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 2023#(and (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 314#(<= 1 ~pos~0), 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 19#L83true, Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 213#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 869#(<= ~c1~0 0), Black: 2171#(= ~c1~0 0), 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), 115#true, Black: 241#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 2677#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 228#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), 64#thread3ENTRYtrue, Black: 232#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 1424#true]) [2022-07-22 21:45:26,738 INFO L384 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-07-22 21:45:26,738 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-22 21:45:26,738 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-22 21:45:26,738 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-22 21:45:27,665 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([347] L73-->L83: Formula: (and (= v_~c2~0_37 (+ v_~c2~0_38 1)) (= v_~pos~0_61 (+ v_~pos~0_62 1))) InVars {~c2~0=v_~c2~0_38, ~pos~0=v_~pos~0_62} OutVars{thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~pos~0=v_~pos~0_61, ~c2~0=v_~c2~0_37, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post8#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post7#1][339], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2682#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2684#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 879#(<= ~c2~0 1), Black: 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 131#true, Black: 987#(= ~c2~0 0), Black: 261#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 3402#(<= ~c1~0 1), 2700#(<= 3 ~pos~0), Black: 279#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 148#(<= 0 ~pos~0), Black: 3348#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3366#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 2698#(<= 1 ~pos~0), Black: 2697#(<= 0 ~pos~0), Black: 3364#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 304#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 165#true, Black: 3374#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 2699#(<= 2 ~pos~0), Black: 3372#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 3 ~pos~0)), Black: 176#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 294#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 3360#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 28#L61true, Black: 3342#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 167#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 3346#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 3 ~pos~0)), Black: 3354#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3350#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3370#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3356#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3340#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3352#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3362#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3358#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3344#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 275#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 236#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 2023#(and (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), 874#true, Black: 314#(<= 1 ~pos~0), 19#L83true, 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 213#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 869#(<= ~c1~0 0), Black: 2171#(= ~c1~0 0), 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), 115#true, Black: 241#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 2677#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), 64#thread3ENTRYtrue, Black: 232#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 1424#true]) [2022-07-22 21:45:27,665 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-07-22 21:45:27,665 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-22 21:45:27,666 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-22 21:45:27,666 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-07-22 21:45:28,277 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][340], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2682#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2684#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 879#(<= ~c2~0 1), Black: 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 987#(= ~c2~0 0), Black: 131#true, Black: 261#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 3402#(<= ~c1~0 1), 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 279#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 148#(<= 0 ~pos~0), 2698#(<= 1 ~pos~0), Black: 3348#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3366#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 2697#(<= 0 ~pos~0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 304#(<= ~c2~0 0), Black: 3364#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 3374#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 165#true, Black: 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 2699#(<= 2 ~pos~0), Black: 176#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3372#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 3 ~pos~0)), Black: 3360#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), 294#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 28#L61true, Black: 167#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 3342#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3346#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 3 ~pos~0)), Black: 3354#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3350#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3370#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3356#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3340#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3352#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3362#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3358#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3344#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 2700#(<= 3 ~pos~0), 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 275#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 236#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 874#true, Black: 314#(<= 1 ~pos~0), 19#L83true, Black: 213#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 869#(<= ~c1~0 0), Black: 2171#(= ~c1~0 0), 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), 115#true, Black: 241#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 2677#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), Black: 232#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 64#thread3ENTRYtrue, Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 1424#true]) [2022-07-22 21:45:28,278 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-07-22 21:45:28,278 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-07-22 21:45:28,278 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-07-22 21:45:28,278 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-07-22 21:45:30,985 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([347] L73-->L83: Formula: (and (= v_~c2~0_37 (+ v_~c2~0_38 1)) (= v_~pos~0_61 (+ v_~pos~0_62 1))) InVars {~c2~0=v_~c2~0_38, ~pos~0=v_~pos~0_62} OutVars{thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_1|, ~pos~0=v_~pos~0_61, ~c2~0=v_~c2~0_37, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post8#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post7#1][339], [Black: 2677#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2682#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2684#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 879#(<= ~c2~0 1), Black: 131#true, Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 987#(= ~c2~0 0), Black: 261#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 3402#(<= ~c1~0 1), 2700#(<= 3 ~pos~0), Black: 279#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 148#(<= 0 ~pos~0), Black: 3348#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3366#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 2698#(<= 1 ~pos~0), Black: 2697#(<= 0 ~pos~0), Black: 304#(<= ~c2~0 0), Black: 3364#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 3374#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 165#true, Black: 2699#(<= 2 ~pos~0), Black: 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 3372#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 3 ~pos~0)), Black: 176#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3360#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 28#L61true, 294#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 3342#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 167#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 3346#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 3 ~pos~0)), Black: 3354#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3350#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3370#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3356#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3340#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3352#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3362#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3358#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3344#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 275#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 236#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 2023#(and (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), 874#true, Black: 314#(<= 1 ~pos~0), 19#L83true, 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 213#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 869#(<= ~c1~0 0), Black: 2171#(= ~c1~0 0), 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), 115#true, Black: 241#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), 64#thread3ENTRYtrue, Black: 232#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 1424#true]) [2022-07-22 21:45:30,985 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-07-22 21:45:30,985 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:45:30,985 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:45:30,985 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-07-22 21:45:31,960 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([348] L79-->L83: Formula: (and (= v_~c2~0_46 (+ v_~c2~0_45 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_69 1) v_~pos~0_70)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_70} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_69, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork1_#t~post9#1=|v_thread2Thread1of1ForFork1_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork1_#t~post9#1][340], [Black: 2677#(and (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2682#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 2684#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= ~c2~0 ~pos~0) (<= 0 ~pos~0)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 879#(<= ~c2~0 1), Black: 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 131#true, Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 987#(= ~c2~0 0), Black: 261#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 3402#(<= ~c1~0 1), 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 279#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 148#(<= 0 ~pos~0), 2698#(<= 1 ~pos~0), Black: 3348#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3366#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 2697#(<= 0 ~pos~0), Black: 304#(<= ~c2~0 0), Black: 3364#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), Black: 3374#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 3 ~pos~0)), Black: 165#true, Black: 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 2699#(<= 2 ~pos~0), Black: 3372#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 3 ~pos~0)), Black: 176#(and (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 3360#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 2 ~pos~0)), 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), 294#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 28#L61true, Black: 167#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 3342#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 0 ~pos~0)), Black: 3346#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 3 ~pos~0)), Black: 3354#(and (<= 1 ~v_assert~0) (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3350#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), Black: 3370#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3356#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3340#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 1 ~pos~0)), Black: 3352#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 3362#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 3358#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 3344#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= 2 ~pos~0)), Black: 2700#(<= 3 ~pos~0), 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 275#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), 236#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 874#true, Black: 314#(<= 1 ~pos~0), 19#L83true, Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 869#(<= ~c1~0 0), Black: 2171#(= ~c1~0 0), 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= (+ (* (- 1) |thread1Thread1of1ForFork0_~cond~0#1|) ~v_assert~0) 0)), 115#true, Black: 241#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0), Black: 232#(and (= (+ ~v_assert~0 (* (- 1) |thread2Thread1of1ForFork1_~cond~1#1|)) 0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 64#thread3ENTRYtrue, Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 1424#true]) [2022-07-22 21:45:31,961 INFO L384 tUnfolder$Statistics]: this new event has 88 ancestors and is not cut-off event [2022-07-22 21:45:31,961 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-22 21:45:31,961 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-07-22 21:45:31,961 INFO L387 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event