./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-4.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-4.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 4ed4cbcf73a390a7811d007883e420d1e9d8d4b9f5e59201847b4262dc4b0025 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 21:44:28,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 21:44:28,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 21:44:28,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 21:44:28,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 21:44:28,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 21:44:28,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 21:44:28,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 21:44:28,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 21:44:28,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 21:44:28,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 21:44:28,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 21:44:28,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 21:44:28,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 21:44:28,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 21:44:28,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 21:44:28,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 21:44:28,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 21:44:28,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 21:44:28,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 21:44:28,782 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 21:44:28,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 21:44:28,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 21:44:28,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 21:44:28,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 21:44:28,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 21:44:28,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 21:44:28,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 21:44:28,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 21:44:28,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 21:44:28,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 21:44:28,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 21:44:28,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 21:44:28,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 21:44:28,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 21:44:28,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 21:44:28,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 21:44:28,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 21:44:28,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 21:44:28,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 21:44:28,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 21:44:28,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 21:44:28,799 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:28,820 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 21:44:28,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 21:44:28,821 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 21:44:28,821 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 21:44:28,821 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 21:44:28,822 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 21:44:28,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 21:44:28,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 21:44:28,822 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 21:44:28,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 21:44:28,823 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 21:44:28,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 21:44:28,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 21:44:28,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 21:44:28,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 21:44:28,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 21:44:28,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 21:44:28,824 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 21:44:28,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 21:44:28,825 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 21:44:28,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 21:44:28,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 21:44:28,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 21:44:28,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 21:44:28,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:44:28,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 21:44:28,827 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 21:44:28,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 21:44:28,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 21:44:28,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 21:44:28,827 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 21:44:28,828 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 21:44:28,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 21:44:28,828 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 -> 4ed4cbcf73a390a7811d007883e420d1e9d8d4b9f5e59201847b4262dc4b0025 [2022-07-22 21:44:28,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 21:44:29,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 21:44:29,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 21:44:29,004 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 21:44:29,005 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 21:44:29,005 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2022-07-22 21:44:29,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a858d27/c155788ea41d431094f5075222e860a3/FLAGe95844d9d [2022-07-22 21:44:29,393 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 21:44:29,393 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2022-07-22 21:44:29,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a858d27/c155788ea41d431094f5075222e860a3/FLAGe95844d9d [2022-07-22 21:44:29,847 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9a858d27/c155788ea41d431094f5075222e860a3 [2022-07-22 21:44:29,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 21:44:29,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 21:44:29,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 21:44:29,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 21:44:29,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 21:44:29,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:44:29" (1/1) ... [2022-07-22 21:44:29,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3779cae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:44:29, skipping insertion in model container [2022-07-22 21:44:29,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:44:29" (1/1) ... [2022-07-22 21:44:29,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 21:44:29,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 21:44:30,063 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-4.wvr.c[2950,2963] [2022-07-22 21:44:30,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:44:30,076 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 21:44:30,107 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-4.wvr.c[2950,2963] [2022-07-22 21:44:30,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 21:44:30,118 INFO L208 MainTranslator]: Completed translation [2022-07-22 21:44:30,119 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,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 21:44:30,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 21:44:30,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 21:44:30,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 21:44:30,126 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,142 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,154 INFO L137 Inliner]: procedures = 22, calls = 43, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-07-22 21:44:30,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 21:44:30,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 21:44:30,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 21:44:30,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 21:44:30,162 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,162 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,167 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,167 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,170 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,173 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,174 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,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 21:44:30,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 21:44:30,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 21:44:30,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 21:44:30,177 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,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 21:44:30,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:30,210 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,226 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,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 21:44:30,260 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 21:44:30,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 21:44:30,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 21:44:30,262 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 21:44:30,262 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 21:44:30,262 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 21:44:30,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 21:44:30,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 21:44:30,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 21:44:30,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 21:44:30,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 21:44:30,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 21:44:30,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 21:44:30,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 21:44:30,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 21:44:30,267 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,319 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 21:44:30,320 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 21:44:30,566 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 21:44:30,605 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 21:44:30,605 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 21:44:30,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:44:30 BoogieIcfgContainer [2022-07-22 21:44:30,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 21:44:30,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 21:44:30,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 21:44:30,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 21:44:30,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:44:29" (1/3) ... [2022-07-22 21:44:30,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d00b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:44:30, skipping insertion in model container [2022-07-22 21:44:30,616 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:30,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d00b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:44:30, skipping insertion in model container [2022-07-22 21:44:30,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:44:30" (3/3) ... [2022-07-22 21:44:30,617 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2022-07-22 21:44:30,621 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-22 21:44:30,636 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 21:44:30,636 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 21:44:30,636 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-22 21:44:30,680 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 21:44:30,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 105 transitions, 234 flow [2022-07-22 21:44:30,747 INFO L129 PetriNetUnfolder]: 7/102 cut-off events. [2022-07-22 21:44:30,747 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 21:44:30,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 7/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-07-22 21:44:30,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 105 transitions, 234 flow [2022-07-22 21:44:30,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 91 transitions, 200 flow [2022-07-22 21:44:30,759 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 21:44:30,763 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@59db2e17, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1427fea2 [2022-07-22 21:44:30,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-22 21:44:30,793 INFO L129 PetriNetUnfolder]: 7/90 cut-off events. [2022-07-22 21:44:30,793 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 21:44:30,793 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:30,794 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] [2022-07-22 21:44:30,794 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:30,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash 237529111, now seen corresponding path program 1 times [2022-07-22 21:44:30,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:30,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527671342] [2022-07-22 21:44:30,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:30,930 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:30,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:30,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527671342] [2022-07-22 21:44:30,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527671342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:30,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:30,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 21:44:30,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179755420] [2022-07-22 21:44:30,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:30,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 21:44:30,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:30,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 21:44:30,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 21:44:30,958 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 105 [2022-07-22 21:44:30,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 200 flow. Second operand has 2 states, 2 states have (on average 97.0) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 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:30,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:30,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 105 [2022-07-22 21:44:30,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:30,989 INFO L129 PetriNetUnfolder]: 13/115 cut-off events. [2022-07-22 21:44:30,989 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-07-22 21:44:30,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 115 events. 13/115 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 160 event pairs, 2 based on Foata normal form. 11/115 useless extension candidates. Maximal degree in co-relation 100. Up to 20 conditions per place. [2022-07-22 21:44:30,991 INFO L132 encePairwiseOnDemand]: 102/105 looper letters, 8 selfloop transitions, 0 changer transitions 1/88 dead transitions. [2022-07-22 21:44:30,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 210 flow [2022-07-22 21:44:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 21:44:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-22 21:44:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2022-07-22 21:44:31,000 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9380952380952381 [2022-07-22 21:44:31,000 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2022-07-22 21:44:31,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2022-07-22 21:44:31,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:31,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2022-07-22 21:44:31,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 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,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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,008 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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,009 INFO L186 Difference]: Start difference. First operand has 94 places, 91 transitions, 200 flow. Second operand 2 states and 197 transitions. [2022-07-22 21:44:31,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 210 flow [2022-07-22 21:44:31,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 198 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-22 21:44:31,014 INFO L242 Difference]: Finished difference. Result has 89 places, 87 transitions, 180 flow [2022-07-22 21:44:31,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2022-07-22 21:44:31,018 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -5 predicate places. [2022-07-22 21:44:31,018 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 180 flow [2022-07-22 21:44:31,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.0) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 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,019 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:31,019 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] [2022-07-22 21:44:31,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 21:44:31,019 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,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:31,020 INFO L85 PathProgramCache]: Analyzing trace with hash -771818347, now seen corresponding path program 1 times [2022-07-22 21:44:31,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:31,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179996763] [2022-07-22 21:44:31,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:31,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:31,258 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,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:31,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179996763] [2022-07-22 21:44:31,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179996763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:31,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:31,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 21:44:31,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473842769] [2022-07-22 21:44:31,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:31,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:44:31,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:31,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:44:31,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:44:31,266 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2022-07-22 21:44:31,266 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 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,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:31,270 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2022-07-22 21:44:31,270 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:31,412 INFO L129 PetriNetUnfolder]: 79/268 cut-off events. [2022-07-22 21:44:31,412 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-07-22 21:44:31,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 268 events. 79/268 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 940 event pairs, 9 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 402. Up to 53 conditions per place. [2022-07-22 21:44:31,417 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 30 selfloop transitions, 6 changer transitions 0/102 dead transitions. [2022-07-22 21:44:31,417 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 102 transitions, 285 flow [2022-07-22 21:44:31,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 21:44:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-22 21:44:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2022-07-22 21:44:31,423 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8111111111111111 [2022-07-22 21:44:31,423 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 511 transitions. [2022-07-22 21:44:31,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 511 transitions. [2022-07-22 21:44:31,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:31,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 511 transitions. [2022-07-22 21:44:31,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 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,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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,429 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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,429 INFO L186 Difference]: Start difference. First operand has 89 places, 87 transitions, 180 flow. Second operand 6 states and 511 transitions. [2022-07-22 21:44:31,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 102 transitions, 285 flow [2022-07-22 21:44:31,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-22 21:44:31,432 INFO L242 Difference]: Finished difference. Result has 95 places, 89 transitions, 205 flow [2022-07-22 21:44:31,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2022-07-22 21:44:31,433 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 1 predicate places. [2022-07-22 21:44:31,434 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 205 flow [2022-07-22 21:44:31,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 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,434 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:31,434 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] [2022-07-22 21:44:31,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 21:44:31,435 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:31,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:31,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1620454695, now seen corresponding path program 2 times [2022-07-22 21:44:31,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:31,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229188388] [2022-07-22 21:44:31,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:31,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:31,625 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,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:31,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229188388] [2022-07-22 21:44:31,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229188388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:31,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:31,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:44:31,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124410947] [2022-07-22 21:44:31,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:31,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:44:31,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:31,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:44:31,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:44:31,629 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2022-07-22 21:44:31,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 205 flow. Second operand has 7 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 0 states have call successors, (0), 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,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:31,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2022-07-22 21:44:31,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:31,727 INFO L129 PetriNetUnfolder]: 66/249 cut-off events. [2022-07-22 21:44:31,727 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-07-22 21:44:31,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 249 events. 66/249 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 855 event pairs, 12 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 408. Up to 46 conditions per place. [2022-07-22 21:44:31,729 INFO L132 encePairwiseOnDemand]: 97/105 looper letters, 28 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2022-07-22 21:44:31,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 104 transitions, 325 flow [2022-07-22 21:44:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:44:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:44:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 591 transitions. [2022-07-22 21:44:31,731 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8040816326530612 [2022-07-22 21:44:31,731 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 591 transitions. [2022-07-22 21:44:31,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 591 transitions. [2022-07-22 21:44:31,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:31,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 591 transitions. [2022-07-22 21:44:31,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.42857142857143) internal successors, (591), 7 states have internal predecessors, (591), 0 states have call successors, (0), 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,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 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,735 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 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,735 INFO L186 Difference]: Start difference. First operand has 95 places, 89 transitions, 205 flow. Second operand 7 states and 591 transitions. [2022-07-22 21:44:31,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 104 transitions, 325 flow [2022-07-22 21:44:31,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 104 transitions, 316 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-22 21:44:31,737 INFO L242 Difference]: Finished difference. Result has 102 places, 94 transitions, 258 flow [2022-07-22 21:44:31,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=102, PETRI_TRANSITIONS=94} [2022-07-22 21:44:31,738 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 8 predicate places. [2022-07-22 21:44:31,738 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 94 transitions, 258 flow [2022-07-22 21:44:31,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 0 states have call successors, (0), 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,739 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:31,739 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] [2022-07-22 21:44:31,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 21:44:31,740 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:31,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:31,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1693986353, now seen corresponding path program 3 times [2022-07-22 21:44:31,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:31,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500422196] [2022-07-22 21:44:31,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:31,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:31,823 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,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:31,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500422196] [2022-07-22 21:44:31,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500422196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:31,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:31,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 21:44:31,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75873501] [2022-07-22 21:44:31,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:31,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 21:44:31,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:31,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 21:44:31,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 21:44:31,826 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-07-22 21:44:31,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 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,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:31,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-07-22 21:44:31,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:31,970 INFO L129 PetriNetUnfolder]: 224/586 cut-off events. [2022-07-22 21:44:31,971 INFO L130 PetriNetUnfolder]: For 279/279 co-relation queries the response was YES. [2022-07-22 21:44:31,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 586 events. 224/586 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3009 event pairs, 30 based on Foata normal form. 6/549 useless extension candidates. Maximal degree in co-relation 1212. Up to 157 conditions per place. [2022-07-22 21:44:31,974 INFO L132 encePairwiseOnDemand]: 94/105 looper letters, 35 selfloop transitions, 7 changer transitions 38/142 dead transitions. [2022-07-22 21:44:31,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 142 transitions, 586 flow [2022-07-22 21:44:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 21:44:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-22 21:44:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 748 transitions. [2022-07-22 21:44:31,976 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7915343915343915 [2022-07-22 21:44:31,976 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 748 transitions. [2022-07-22 21:44:31,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 748 transitions. [2022-07-22 21:44:31,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:31,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 748 transitions. [2022-07-22 21:44:31,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 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,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 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,980 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 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,980 INFO L186 Difference]: Start difference. First operand has 102 places, 94 transitions, 258 flow. Second operand 9 states and 748 transitions. [2022-07-22 21:44:31,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 142 transitions, 586 flow [2022-07-22 21:44:31,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 142 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:44:31,983 INFO L242 Difference]: Finished difference. Result has 113 places, 95 transitions, 299 flow [2022-07-22 21:44:31,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=299, PETRI_PLACES=113, PETRI_TRANSITIONS=95} [2022-07-22 21:44:31,984 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 19 predicate places. [2022-07-22 21:44:31,984 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 95 transitions, 299 flow [2022-07-22 21:44:31,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 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,985 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:31,985 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] [2022-07-22 21:44:31,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 21:44:31,985 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:31,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash 96015318, now seen corresponding path program 1 times [2022-07-22 21:44:31,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:31,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476151189] [2022-07-22 21:44:31,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:31,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:32,050 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,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:32,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476151189] [2022-07-22 21:44:32,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476151189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:32,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:32,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:44:32,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238081136] [2022-07-22 21:44:32,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:32,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:32,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:32,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:32,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:44:32,052 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-07-22 21:44:32,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 95 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 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,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:32,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-07-22 21:44:32,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:32,177 INFO L129 PetriNetUnfolder]: 243/625 cut-off events. [2022-07-22 21:44:32,177 INFO L130 PetriNetUnfolder]: For 681/681 co-relation queries the response was YES. [2022-07-22 21:44:32,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 625 events. 243/625 cut-off events. For 681/681 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3160 event pairs, 18 based on Foata normal form. 15/586 useless extension candidates. Maximal degree in co-relation 1507. Up to 125 conditions per place. [2022-07-22 21:44:32,181 INFO L132 encePairwiseOnDemand]: 96/105 looper letters, 51 selfloop transitions, 22 changer transitions 1/142 dead transitions. [2022-07-22 21:44:32,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 142 transitions, 684 flow [2022-07-22 21:44:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:44:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:44:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 632 transitions. [2022-07-22 21:44:32,183 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8598639455782313 [2022-07-22 21:44:32,183 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 632 transitions. [2022-07-22 21:44:32,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 632 transitions. [2022-07-22 21:44:32,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:32,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 632 transitions. [2022-07-22 21:44:32,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 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,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 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,186 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 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,186 INFO L186 Difference]: Start difference. First operand has 113 places, 95 transitions, 299 flow. Second operand 7 states and 632 transitions. [2022-07-22 21:44:32,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 142 transitions, 684 flow [2022-07-22 21:44:32,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 142 transitions, 658 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-07-22 21:44:32,191 INFO L242 Difference]: Finished difference. Result has 116 places, 113 transitions, 504 flow [2022-07-22 21:44:32,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=504, PETRI_PLACES=116, PETRI_TRANSITIONS=113} [2022-07-22 21:44:32,192 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 22 predicate places. [2022-07-22 21:44:32,192 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 113 transitions, 504 flow [2022-07-22 21:44:32,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 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,192 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:32,192 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] [2022-07-22 21:44:32,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 21:44:32,193 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:32,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:32,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1132419904, now seen corresponding path program 2 times [2022-07-22 21:44:32,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:32,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864838326] [2022-07-22 21:44:32,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:32,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:32,243 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,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864838326] [2022-07-22 21:44:32,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864838326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:32,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:32,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:44:32,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253512925] [2022-07-22 21:44:32,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:32,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:32,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:32,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:32,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:44:32,245 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2022-07-22 21:44:32,246 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 113 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 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,246 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:32,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2022-07-22 21:44:32,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:32,290 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([259] L83-->L70: Formula: (not (= (mod v_thread2Thread1of1ForFork2_~lv_assert~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~lv_assert~1=v_thread2Thread1of1ForFork2_~lv_assert~1_5} OutVars{thread2Thread1of1ForFork2_~lv_assert~1=v_thread2Thread1of1ForFork2_~lv_assert~1_5} AuxVars[] AssignedVars[][66], [111#true, Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 24#L110-4true, Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 137#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 6#L46true, 173#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 127#true, Black: 170#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 164#true, 185#true, Black: 175#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 35#L70true, 123#(and (= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0)]) [2022-07-22 21:44:32,290 INFO L384 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-07-22 21:44:32,290 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-07-22 21:44:32,290 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-07-22 21:44:32,291 INFO L387 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-07-22 21:44:32,311 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([259] L83-->L70: Formula: (not (= (mod v_thread2Thread1of1ForFork2_~lv_assert~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~lv_assert~1=v_thread2Thread1of1ForFork2_~lv_assert~1_5} OutVars{thread2Thread1of1ForFork2_~lv_assert~1=v_thread2Thread1of1ForFork2_~lv_assert~1_5} AuxVars[] AssignedVars[][66], [111#true, Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 73#thread3ENTRYtrue, 137#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 6#L46true, 173#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 127#true, 4#L111-4true, Black: 170#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 164#true, 185#true, Black: 175#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 35#L70true, 123#(and (= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0)]) [2022-07-22 21:44:32,312 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-07-22 21:44:32,312 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-07-22 21:44:32,312 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-07-22 21:44:32,312 INFO L387 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-07-22 21:44:32,312 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] thread3ENTRY-->L92: 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][79], [111#true, Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 29#L59true, 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, 57#L83true, 27#L92true, 4#L111-4true, Black: 170#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 185#true, Black: 164#true, Black: 175#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))), Black: 173#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 123#(and (= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0)]) [2022-07-22 21:44:32,312 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-07-22 21:44:32,313 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-07-22 21:44:32,313 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-07-22 21:44:32,313 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-07-22 21:44:32,326 INFO L129 PetriNetUnfolder]: 185/609 cut-off events. [2022-07-22 21:44:32,326 INFO L130 PetriNetUnfolder]: For 1254/1333 co-relation queries the response was YES. [2022-07-22 21:44:32,329 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 609 events. 185/609 cut-off events. For 1254/1333 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3475 event pairs, 18 based on Foata normal form. 17/562 useless extension candidates. Maximal degree in co-relation 1658. Up to 98 conditions per place. [2022-07-22 21:44:32,331 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 20 selfloop transitions, 5 changer transitions 0/120 dead transitions. [2022-07-22 21:44:32,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 120 transitions, 573 flow [2022-07-22 21:44:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:44:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:44:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-07-22 21:44:32,333 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8380952380952381 [2022-07-22 21:44:32,333 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 440 transitions. [2022-07-22 21:44:32,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 440 transitions. [2022-07-22 21:44:32,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:32,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 440 transitions. [2022-07-22 21:44:32,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:32,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 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,336 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 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,336 INFO L186 Difference]: Start difference. First operand has 116 places, 113 transitions, 504 flow. Second operand 5 states and 440 transitions. [2022-07-22 21:44:32,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 120 transitions, 573 flow [2022-07-22 21:44:32,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 120 transitions, 573 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-22 21:44:32,341 INFO L242 Difference]: Finished difference. Result has 122 places, 115 transitions, 530 flow [2022-07-22 21:44:32,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=530, PETRI_PLACES=122, PETRI_TRANSITIONS=115} [2022-07-22 21:44:32,342 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 28 predicate places. [2022-07-22 21:44:32,342 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 115 transitions, 530 flow [2022-07-22 21:44:32,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 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,342 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:32,342 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] [2022-07-22 21:44:32,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 21:44:32,343 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:32,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:32,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2140966008, now seen corresponding path program 1 times [2022-07-22 21:44:32,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:32,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382119058] [2022-07-22 21:44:32,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:32,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:32,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:32,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382119058] [2022-07-22 21:44:32,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382119058] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:32,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038758669] [2022-07-22 21:44:32,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:32,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:32,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:32,428 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:32,460 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:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:32,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 21:44:32,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:32,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:32,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038758669] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:44:32,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:44:32,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-07-22 21:44:32,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189448824] [2022-07-22 21:44:32,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:44:32,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 21:44:32,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:32,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 21:44:32,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 21:44:32,609 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2022-07-22 21:44:32,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 115 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 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,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:32,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2022-07-22 21:44:32,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:32,811 INFO L129 PetriNetUnfolder]: 450/1233 cut-off events. [2022-07-22 21:44:32,811 INFO L130 PetriNetUnfolder]: For 3060/3077 co-relation queries the response was YES. [2022-07-22 21:44:32,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3895 conditions, 1233 events. 450/1233 cut-off events. For 3060/3077 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8038 event pairs, 40 based on Foata normal form. 33/1208 useless extension candidates. Maximal degree in co-relation 3875. Up to 277 conditions per place. [2022-07-22 21:44:32,823 INFO L132 encePairwiseOnDemand]: 100/105 looper letters, 61 selfloop transitions, 21 changer transitions 9/168 dead transitions. [2022-07-22 21:44:32,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 168 transitions, 1094 flow [2022-07-22 21:44:32,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 21:44:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-22 21:44:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 548 transitions. [2022-07-22 21:44:32,825 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8698412698412699 [2022-07-22 21:44:32,825 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 548 transitions. [2022-07-22 21:44:32,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 548 transitions. [2022-07-22 21:44:32,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:32,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 548 transitions. [2022-07-22 21:44:32,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 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,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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,828 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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,828 INFO L186 Difference]: Start difference. First operand has 122 places, 115 transitions, 530 flow. Second operand 6 states and 548 transitions. [2022-07-22 21:44:32,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 168 transitions, 1094 flow [2022-07-22 21:44:32,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 168 transitions, 1090 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:44:32,835 INFO L242 Difference]: Finished difference. Result has 129 places, 127 transitions, 731 flow [2022-07-22 21:44:32,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=731, PETRI_PLACES=129, PETRI_TRANSITIONS=127} [2022-07-22 21:44:32,836 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 35 predicate places. [2022-07-22 21:44:32,836 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 127 transitions, 731 flow [2022-07-22 21:44:32,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 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,837 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:32,837 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] [2022-07-22 21:44:32,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 21:44:33,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:33,054 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,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:33,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1843048384, now seen corresponding path program 2 times [2022-07-22 21:44:33,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:33,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639008406] [2022-07-22 21:44:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:33,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:33,148 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,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:33,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639008406] [2022-07-22 21:44:33,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639008406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:33,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:33,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 21:44:33,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639267152] [2022-07-22 21:44:33,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:33,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:33,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:33,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 21:44:33,151 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2022-07-22 21:44:33,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 127 transitions, 731 flow. Second operand has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 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,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:33,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2022-07-22 21:44:33,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:33,399 INFO L129 PetriNetUnfolder]: 436/1289 cut-off events. [2022-07-22 21:44:33,399 INFO L130 PetriNetUnfolder]: For 3413/3480 co-relation queries the response was YES. [2022-07-22 21:44:33,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 1289 events. 436/1289 cut-off events. For 3413/3480 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8977 event pairs, 73 based on Foata normal form. 33/1203 useless extension candidates. Maximal degree in co-relation 4051. Up to 263 conditions per place. [2022-07-22 21:44:33,410 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 22 selfloop transitions, 5 changer transitions 1/136 dead transitions. [2022-07-22 21:44:33,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 136 transitions, 815 flow [2022-07-22 21:44:33,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 21:44:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-22 21:44:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2022-07-22 21:44:33,412 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.84 [2022-07-22 21:44:33,412 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 441 transitions. [2022-07-22 21:44:33,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 441 transitions. [2022-07-22 21:44:33,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:33,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 441 transitions. [2022-07-22 21:44:33,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 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,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 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,415 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 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,415 INFO L186 Difference]: Start difference. First operand has 129 places, 127 transitions, 731 flow. Second operand 5 states and 441 transitions. [2022-07-22 21:44:33,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 136 transitions, 815 flow [2022-07-22 21:44:33,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 136 transitions, 813 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-07-22 21:44:33,423 INFO L242 Difference]: Finished difference. Result has 135 places, 128 transitions, 745 flow [2022-07-22 21:44:33,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=745, PETRI_PLACES=135, PETRI_TRANSITIONS=128} [2022-07-22 21:44:33,426 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 41 predicate places. [2022-07-22 21:44:33,426 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 128 transitions, 745 flow [2022-07-22 21:44:33,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 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,426 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:33,426 INFO L200 CegarLoopForPetriNet]: trace histogram [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] [2022-07-22 21:44:33,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 21:44:33,427 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:33,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:33,427 INFO L85 PathProgramCache]: Analyzing trace with hash -195568119, now seen corresponding path program 1 times [2022-07-22 21:44:33,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:33,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150182055] [2022-07-22 21:44:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:33,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 21:44:33,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:33,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150182055] [2022-07-22 21:44:33,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150182055] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:33,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217839460] [2022-07-22 21:44:33,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:33,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:33,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:33,584 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:33,614 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:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:33,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 21:44:33,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 21:44:33,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 21:44:33,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217839460] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:33,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 21:44:33,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2022-07-22 21:44:33,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104626395] [2022-07-22 21:44:33,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:33,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:33,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:33,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:33,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:44:33,774 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-07-22 21:44:33,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 128 transitions, 745 flow. Second operand has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:33,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:33,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-07-22 21:44:33,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:34,104 INFO L129 PetriNetUnfolder]: 848/2199 cut-off events. [2022-07-22 21:44:34,104 INFO L130 PetriNetUnfolder]: For 9626/9648 co-relation queries the response was YES. [2022-07-22 21:44:34,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8616 conditions, 2199 events. 848/2199 cut-off events. For 9626/9648 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16553 event pairs, 62 based on Foata normal form. 37/2220 useless extension candidates. Maximal degree in co-relation 8590. Up to 599 conditions per place. [2022-07-22 21:44:34,146 INFO L132 encePairwiseOnDemand]: 96/105 looper letters, 70 selfloop transitions, 58 changer transitions 3/203 dead transitions. [2022-07-22 21:44:34,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 203 transitions, 1743 flow [2022-07-22 21:44:34,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 21:44:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-22 21:44:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 632 transitions. [2022-07-22 21:44:34,153 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8598639455782313 [2022-07-22 21:44:34,153 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 632 transitions. [2022-07-22 21:44:34,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 632 transitions. [2022-07-22 21:44:34,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:34,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 632 transitions. [2022-07-22 21:44:34,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 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,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 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,156 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 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,156 INFO L186 Difference]: Start difference. First operand has 135 places, 128 transitions, 745 flow. Second operand 7 states and 632 transitions. [2022-07-22 21:44:34,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 203 transitions, 1743 flow [2022-07-22 21:44:34,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 203 transitions, 1739 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-22 21:44:34,170 INFO L242 Difference]: Finished difference. Result has 145 places, 167 transitions, 1489 flow [2022-07-22 21:44:34,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1489, PETRI_PLACES=145, PETRI_TRANSITIONS=167} [2022-07-22 21:44:34,171 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 51 predicate places. [2022-07-22 21:44:34,172 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 167 transitions, 1489 flow [2022-07-22 21:44:34,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:34,172 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:34,172 INFO L200 CegarLoopForPetriNet]: trace histogram [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] [2022-07-22 21:44:34,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 21:44:34,389 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,SelfDestructingSolverStorable8 [2022-07-22 21:44:34,390 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,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:34,390 INFO L85 PathProgramCache]: Analyzing trace with hash 766735449, now seen corresponding path program 2 times [2022-07-22 21:44:34,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:34,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979161329] [2022-07-22 21:44:34,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:34,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:34,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:34,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979161329] [2022-07-22 21:44:34,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979161329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:34,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:34,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:44:34,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273658293] [2022-07-22 21:44:34,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:34,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:44:34,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:34,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:44:34,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:44:34,488 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-07-22 21:44:34,488 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 167 transitions, 1489 flow. Second operand has 8 states, 8 states have (on average 77.75) internal successors, (622), 8 states have internal predecessors, (622), 0 states have call successors, (0), 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,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:34,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-07-22 21:44:34,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:35,215 INFO L129 PetriNetUnfolder]: 1821/4654 cut-off events. [2022-07-22 21:44:35,215 INFO L130 PetriNetUnfolder]: For 31171/31254 co-relation queries the response was YES. [2022-07-22 21:44:35,238 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20869 conditions, 4654 events. 1821/4654 cut-off events. For 31171/31254 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 41454 event pairs, 153 based on Foata normal form. 60/4636 useless extension candidates. Maximal degree in co-relation 20837. Up to 983 conditions per place. [2022-07-22 21:44:35,259 INFO L132 encePairwiseOnDemand]: 92/105 looper letters, 152 selfloop transitions, 20 changer transitions 180/427 dead transitions. [2022-07-22 21:44:35,259 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 427 transitions, 5552 flow [2022-07-22 21:44:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 21:44:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-22 21:44:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1012 transitions. [2022-07-22 21:44:35,261 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8031746031746032 [2022-07-22 21:44:35,262 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1012 transitions. [2022-07-22 21:44:35,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1012 transitions. [2022-07-22 21:44:35,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:35,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1012 transitions. [2022-07-22 21:44:35,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 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,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 105.0) internal successors, (1365), 13 states have internal predecessors, (1365), 0 states have call successors, (0), 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,266 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 105.0) internal successors, (1365), 13 states have internal predecessors, (1365), 0 states have call successors, (0), 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,266 INFO L186 Difference]: Start difference. First operand has 145 places, 167 transitions, 1489 flow. Second operand 12 states and 1012 transitions. [2022-07-22 21:44:35,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 427 transitions, 5552 flow [2022-07-22 21:44:35,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 427 transitions, 5440 flow, removed 56 selfloop flow, removed 0 redundant places. [2022-07-22 21:44:35,308 INFO L242 Difference]: Finished difference. Result has 164 places, 181 transitions, 1766 flow [2022-07-22 21:44:35,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1766, PETRI_PLACES=164, PETRI_TRANSITIONS=181} [2022-07-22 21:44:35,310 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 70 predicate places. [2022-07-22 21:44:35,310 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 181 transitions, 1766 flow [2022-07-22 21:44:35,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.75) internal successors, (622), 8 states have internal predecessors, (622), 0 states have call successors, (0), 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,310 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:35,310 INFO L200 CegarLoopForPetriNet]: trace histogram [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] [2022-07-22 21:44:35,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 21:44:35,311 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,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:35,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1589203611, now seen corresponding path program 3 times [2022-07-22 21:44:35,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:35,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538092036] [2022-07-22 21:44:35,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:35,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:35,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:35,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538092036] [2022-07-22 21:44:35,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538092036] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:35,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119141212] [2022-07-22 21:44:35,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 21:44:35,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:35,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:35,466 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:35,467 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:35,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-22 21:44:35,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:44:35,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 21:44:35,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 21:44:35,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 21:44:35,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119141212] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:35,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 21:44:35,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2022-07-22 21:44:35,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947068802] [2022-07-22 21:44:35,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:35,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 21:44:35,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:35,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 21:44:35,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-22 21:44:35,621 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2022-07-22 21:44:35,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 181 transitions, 1766 flow. Second operand has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:35,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:35,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2022-07-22 21:44:35,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:36,183 INFO L129 PetriNetUnfolder]: 1535/4031 cut-off events. [2022-07-22 21:44:36,184 INFO L130 PetriNetUnfolder]: For 32999/33069 co-relation queries the response was YES. [2022-07-22 21:44:36,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19530 conditions, 4031 events. 1535/4031 cut-off events. For 32999/33069 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 35217 event pairs, 180 based on Foata normal form. 62/4059 useless extension candidates. Maximal degree in co-relation 19489. Up to 1754 conditions per place. [2022-07-22 21:44:36,230 INFO L132 encePairwiseOnDemand]: 94/105 looper letters, 115 selfloop transitions, 84 changer transitions 7/281 dead transitions. [2022-07-22 21:44:36,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 281 transitions, 3525 flow [2022-07-22 21:44:36,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 21:44:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-22 21:44:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2022-07-22 21:44:36,232 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8555555555555555 [2022-07-22 21:44:36,232 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 539 transitions. [2022-07-22 21:44:36,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 539 transitions. [2022-07-22 21:44:36,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:36,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 539 transitions. [2022-07-22 21:44:36,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 0 states have call successors, (0), 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,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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,236 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 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,236 INFO L186 Difference]: Start difference. First operand has 164 places, 181 transitions, 1766 flow. Second operand 6 states and 539 transitions. [2022-07-22 21:44:36,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 281 transitions, 3525 flow [2022-07-22 21:44:36,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 281 transitions, 3418 flow, removed 32 selfloop flow, removed 5 redundant places. [2022-07-22 21:44:36,289 INFO L242 Difference]: Finished difference. Result has 165 places, 238 transitions, 2965 flow [2022-07-22 21:44:36,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1691, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2965, PETRI_PLACES=165, PETRI_TRANSITIONS=238} [2022-07-22 21:44:36,289 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 71 predicate places. [2022-07-22 21:44:36,289 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 238 transitions, 2965 flow [2022-07-22 21:44:36,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:36,290 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:36,290 INFO L200 CegarLoopForPetriNet]: trace histogram [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] [2022-07-22 21:44:36,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-22 21:44:36,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:36,507 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:36,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:36,507 INFO L85 PathProgramCache]: Analyzing trace with hash 931617759, now seen corresponding path program 1 times [2022-07-22 21:44:36,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:36,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717408947] [2022-07-22 21:44:36,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:36,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:36,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:36,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717408947] [2022-07-22 21:44:36,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717408947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:36,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:36,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 21:44:36,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842505652] [2022-07-22 21:44:36,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:36,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 21:44:36,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:36,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 21:44:36,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-22 21:44:36,602 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-07-22 21:44:36,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 238 transitions, 2965 flow. Second operand has 8 states, 8 states have (on average 77.75) internal successors, (622), 8 states have internal predecessors, (622), 0 states have call successors, (0), 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,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:36,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-07-22 21:44:36,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:37,192 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][121], [Black: 1207#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), 111#true, Black: 1564#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), Black: 189#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 1223#true, Black: 1200#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), 24#L110-4true, Black: 1725#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1198#(<= 0 ~pos~0), Black: 1209#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1560#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 44#L54true, 137#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 50#L78true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 127#true, 185#true, 1199#(<= 1 ~pos~0), Black: 195#true, Black: 199#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 1184#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 197#(= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0), Black: 147#(<= 0 ~pos~0), 1733#true, Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1030#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1182#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 670#true, Black: 680#true, Black: 1026#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 664#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 173#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1228#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 170#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 674#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 164#true, Black: 175#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 123#(and (= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1205#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0))]) [2022-07-22 21:44:37,193 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-07-22 21:44:37,193 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-07-22 21:44:37,193 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-07-22 21:44:37,193 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2022-07-22 21:44:37,585 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([264] L71-->L78: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][121], [Black: 1207#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1564#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 111#true, Black: 189#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 1223#true, Black: 1200#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1725#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1198#(<= 0 ~pos~0), Black: 1560#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1209#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 44#L54true, 137#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 50#L78true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 127#true, 185#true, 1199#(<= 1 ~pos~0), Black: 195#true, Black: 199#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 1184#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 197#(= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0), Black: 147#(<= 0 ~pos~0), 1733#true, Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1030#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1182#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 670#true, Black: 680#true, 73#thread3ENTRYtrue, Black: 1026#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 664#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 173#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1228#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 4#L111-4true, Black: 170#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 674#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 164#true, Black: 175#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 123#(and (= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1205#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0))]) [2022-07-22 21:44:37,585 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-07-22 21:44:37,585 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-22 21:44:37,585 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-22 21:44:37,586 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-07-22 21:44:37,741 INFO L129 PetriNetUnfolder]: 2418/6438 cut-off events. [2022-07-22 21:44:37,742 INFO L130 PetriNetUnfolder]: For 58490/58612 co-relation queries the response was YES. [2022-07-22 21:44:37,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33926 conditions, 6438 events. 2418/6438 cut-off events. For 58490/58612 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 62504 event pairs, 241 based on Foata normal form. 138/6548 useless extension candidates. Maximal degree in co-relation 33883. Up to 1638 conditions per place. [2022-07-22 21:44:37,929 INFO L132 encePairwiseOnDemand]: 93/105 looper letters, 129 selfloop transitions, 35 changer transitions 117/417 dead transitions. [2022-07-22 21:44:37,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 417 transitions, 6261 flow [2022-07-22 21:44:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 21:44:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-22 21:44:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 995 transitions. [2022-07-22 21:44:37,932 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7896825396825397 [2022-07-22 21:44:37,932 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 995 transitions. [2022-07-22 21:44:37,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 995 transitions. [2022-07-22 21:44:37,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:37,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 995 transitions. [2022-07-22 21:44:37,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 82.91666666666667) internal successors, (995), 12 states have internal predecessors, (995), 0 states have call successors, (0), 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,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 105.0) internal successors, (1365), 13 states have internal predecessors, (1365), 0 states have call successors, (0), 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,936 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 105.0) internal successors, (1365), 13 states have internal predecessors, (1365), 0 states have call successors, (0), 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,936 INFO L186 Difference]: Start difference. First operand has 165 places, 238 transitions, 2965 flow. Second operand 12 states and 995 transitions. [2022-07-22 21:44:37,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 417 transitions, 6261 flow [2022-07-22 21:44:38,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 417 transitions, 6168 flow, removed 45 selfloop flow, removed 1 redundant places. [2022-07-22 21:44:38,096 INFO L242 Difference]: Finished difference. Result has 183 places, 258 transitions, 3540 flow [2022-07-22 21:44:38,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2896, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3540, PETRI_PLACES=183, PETRI_TRANSITIONS=258} [2022-07-22 21:44:38,098 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 89 predicate places. [2022-07-22 21:44:38,098 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 258 transitions, 3540 flow [2022-07-22 21:44:38,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.75) internal successors, (622), 8 states have internal predecessors, (622), 0 states have call successors, (0), 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,098 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:38,099 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 21:44:38,099 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:38,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:38,099 INFO L85 PathProgramCache]: Analyzing trace with hash 738420396, now seen corresponding path program 4 times [2022-07-22 21:44:38,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:38,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473633932] [2022-07-22 21:44:38,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:38,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:44:38,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:38,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473633932] [2022-07-22 21:44:38,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473633932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:38,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:38,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 21:44:38,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287684184] [2022-07-22 21:44:38,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:38,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 21:44:38,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:38,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 21:44:38,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 21:44:38,143 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 105 [2022-07-22 21:44:38,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 258 transitions, 3540 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:38,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:38,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 105 [2022-07-22 21:44:38,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:38,657 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [189#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, Black: 195#true, Black: 664#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 197#(= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1030#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1182#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 680#true, 1194#true, Black: 670#true, 1762#true, Black: 1184#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1026#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 1228#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 27#L92true, 4#L111-4true, Black: 170#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 164#true, 674#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 175#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))), 199#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 685#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 173#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1205#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1207#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), 111#true, Black: 1564#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), Black: 1223#true, Black: 185#true, Black: 1725#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1198#(<= 0 ~pos~0), Black: 1209#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1560#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 44#L54true, Black: 1199#(<= 1 ~pos~0), 50#L78true, Black: 1738#(<= 2 ~pos~0), 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1750#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1752#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1739#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1746#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1744#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1737#(<= 0 ~pos~0), 1748#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 123#(and (= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-07-22 21:44:38,657 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-22 21:44:38,657 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-22 21:44:38,658 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-07-22 21:44:38,658 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-22 21:44:38,658 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [189#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, Black: 195#true, Black: 664#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 197#(= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1030#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1182#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), 1194#true, Black: 680#true, Black: 670#true, 1762#true, Black: 1184#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1026#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 1228#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 27#L92true, 4#L111-4true, Black: 170#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 164#true, 674#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 175#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))), 199#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 685#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 173#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1205#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1207#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1564#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 111#true, Black: 1223#true, Black: 185#true, Black: 1725#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1198#(<= 0 ~pos~0), Black: 1209#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1560#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1199#(<= 1 ~pos~0), 44#L54true, 50#L78true, 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1738#(<= 2 ~pos~0), Black: 1750#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1752#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1739#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1748#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1746#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1744#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 1733#true, Black: 1737#(<= 0 ~pos~0), Black: 123#(and (= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-07-22 21:44:38,659 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-07-22 21:44:38,659 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-22 21:44:38,659 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-22 21:44:38,659 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-22 21:44:38,729 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [189#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 164#true, 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, 680#true, Black: 195#true, Black: 199#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 664#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1030#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1182#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 674#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 1762#true, 1194#true, Black: 1184#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1026#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 57#L83true, 27#L92true, 4#L111-4true, Black: 170#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 175#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 173#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1205#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1207#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1228#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 111#true, Black: 1223#true, Black: 185#true, Black: 1198#(<= 0 ~pos~0), Black: 1725#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1560#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1209#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 44#L54true, Black: 1199#(<= 1 ~pos~0), Black: 1738#(<= 2 ~pos~0), Black: 1750#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1752#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1739#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1746#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1744#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1737#(<= 0 ~pos~0), 1564#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 197#(= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0), 670#true, 1748#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 123#(and (= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-07-22 21:44:38,729 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-07-22 21:44:38,729 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-07-22 21:44:38,729 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-07-22 21:44:38,729 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-07-22 21:44:38,730 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [189#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 164#true, 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, 680#true, Black: 195#true, Black: 199#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 664#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1030#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1182#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 674#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 1194#true, 1762#true, Black: 1184#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1026#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 57#L83true, 27#L92true, 4#L111-4true, Black: 170#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 175#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))), Black: 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 173#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1205#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1207#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1228#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 111#true, Black: 1223#true, Black: 185#true, Black: 1198#(<= 0 ~pos~0), Black: 1725#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1560#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1209#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 44#L54true, Black: 1199#(<= 1 ~pos~0), Black: 1738#(<= 2 ~pos~0), Black: 1750#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1752#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1739#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1748#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1746#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1744#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 1733#true, Black: 1737#(<= 0 ~pos~0), 1564#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 197#(= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0), 670#true, Black: 123#(and (= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-07-22 21:44:38,730 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-07-22 21:44:38,730 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-07-22 21:44:38,730 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-07-22 21:44:38,731 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-07-22 21:44:38,789 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][151], [133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, 185#true, Black: 195#true, Black: 664#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 197#(= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1030#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1182#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 674#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 680#true, 1194#true, Black: 1184#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1026#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 1228#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 4#L111-4true, 27#L92true, Black: 170#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 164#true, Black: 175#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))), 685#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 199#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 173#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1205#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1207#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 189#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 111#true, Black: 1564#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), Black: 1223#true, Black: 1725#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1198#(<= 0 ~pos~0), Black: 1560#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1209#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 44#L54true, Black: 1199#(<= 1 ~pos~0), 50#L78true, 1764#(= (+ ~d1~0 (* (- 256) (div ~d1~0 256))) 0), 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1738#(<= 2 ~pos~0), Black: 1750#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1752#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1739#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1748#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1746#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1744#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 1733#true, Black: 1737#(<= 0 ~pos~0), 670#true, Black: 123#(and (= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-07-22 21:44:38,789 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-07-22 21:44:38,789 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-22 21:44:38,789 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-22 21:44:38,790 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-22 21:44:38,798 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [189#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, Black: 195#true, Black: 199#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 197#(= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1030#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1182#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 680#true, 1194#true, 1762#true, Black: 670#true, Black: 1184#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1026#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 664#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1228#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 27#L92true, 4#L111-4true, Black: 170#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 164#true, 674#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 175#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))), 685#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 173#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1205#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1207#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1564#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 111#true, Black: 1223#true, Black: 185#true, Black: 1725#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1198#(<= 0 ~pos~0), Black: 1209#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1560#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 44#L54true, Black: 1199#(<= 1 ~pos~0), 50#L78true, Black: 1738#(<= 2 ~pos~0), 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1750#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1752#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1739#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1746#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1744#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1737#(<= 0 ~pos~0), 1748#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 123#(and (= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-07-22 21:44:38,798 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-07-22 21:44:38,798 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-22 21:44:38,798 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-22 21:44:38,798 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-22 21:44:38,799 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([252] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][69], [189#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, Black: 195#true, Black: 199#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 197#(= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1030#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1182#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), 1194#true, Black: 680#true, Black: 670#true, 1762#true, Black: 1184#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1026#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 664#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1228#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 27#L92true, 4#L111-4true, Black: 170#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 164#true, 674#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 175#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))), 685#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 173#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1205#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1207#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1564#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), 111#true, Black: 1223#true, Black: 185#true, Black: 1725#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1198#(<= 0 ~pos~0), Black: 1209#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 1560#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1199#(<= 1 ~pos~0), 44#L54true, 50#L78true, Black: 1738#(<= 2 ~pos~0), 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1750#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1752#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1739#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1748#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1746#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1744#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1737#(<= 0 ~pos~0), 1733#true, Black: 123#(and (= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-07-22 21:44:38,799 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-07-22 21:44:38,799 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-22 21:44:38,799 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-22 21:44:38,799 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-22 21:44:38,856 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][151], [133#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 137#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#true, 185#true, Black: 195#true, Black: 199#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 197#(= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0), Black: 147#(<= 0 ~pos~0), Black: 153#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 155#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1030#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1182#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 674#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), Black: 680#true, 1194#true, Black: 1184#(and (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1026#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 664#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1228#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 4#L111-4true, 27#L92true, Black: 170#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 164#true, Black: 175#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))), 685#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 173#(and (= 0 (+ ~v_assert~0 (* (- 1) thread1Thread1of1ForFork1_~lv_assert~0))) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1205#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1207#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= (div thread2Thread1of1ForFork2_~lv_assert~1 256) 0) (<= 0 ~pos~0)), Black: 1564#(or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)), Black: 189#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 111#true, Black: 1223#true, Black: 1725#(and (or (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= (mod ~v_assert~0 256) 0)) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 1198#(<= 0 ~pos~0), Black: 1560#(or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1209#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), 44#L54true, Black: 1199#(<= 1 ~pos~0), 50#L78true, 1764#(= (+ ~d1~0 (* (- 256) (div ~d1~0 256))) 0), 168#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 1738#(<= 2 ~pos~0), Black: 1750#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1752#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0)), Black: 1739#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1)), Black: 1748#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1746#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 1744#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 1737#(<= 0 ~pos~0), 1733#true, 670#true, Black: 123#(and (= (+ ~v_assert~0 (* (- 1) thread2Thread1of1ForFork2_~lv_assert~1)) 0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2022-07-22 21:44:38,856 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-07-22 21:44:38,856 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-07-22 21:44:38,857 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-07-22 21:44:38,857 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-07-22 21:44:38,888 INFO L129 PetriNetUnfolder]: 1566/4972 cut-off events. [2022-07-22 21:44:38,889 INFO L130 PetriNetUnfolder]: For 49124/49470 co-relation queries the response was YES. [2022-07-22 21:44:38,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26391 conditions, 4972 events. 1566/4972 cut-off events. For 49124/49470 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 49576 event pairs, 305 based on Foata normal form. 293/5157 useless extension candidates. Maximal degree in co-relation 26340. Up to 865 conditions per place. [2022-07-22 21:44:39,012 INFO L132 encePairwiseOnDemand]: 100/105 looper letters, 34 selfloop transitions, 5 changer transitions 1/241 dead transitions. [2022-07-22 21:44:39,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 241 transitions, 3087 flow [2022-07-22 21:44:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 21:44:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-22 21:44:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2022-07-22 21:44:39,013 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9023809523809524 [2022-07-22 21:44:39,014 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2022-07-22 21:44:39,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2022-07-22 21:44:39,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:39,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2022-07-22 21:44:39,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 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:39,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:39,016 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:39,016 INFO L186 Difference]: Start difference. First operand has 183 places, 258 transitions, 3540 flow. Second operand 4 states and 379 transitions. [2022-07-22 21:44:39,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 241 transitions, 3087 flow [2022-07-22 21:44:39,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 241 transitions, 2884 flow, removed 80 selfloop flow, removed 11 redundant places. [2022-07-22 21:44:39,118 INFO L242 Difference]: Finished difference. Result has 171 places, 227 transitions, 2776 flow [2022-07-22 21:44:39,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2744, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2776, PETRI_PLACES=171, PETRI_TRANSITIONS=227} [2022-07-22 21:44:39,119 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 77 predicate places. [2022-07-22 21:44:39,120 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 227 transitions, 2776 flow [2022-07-22 21:44:39,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:39,120 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:39,120 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 21:44:39,120 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:39,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:39,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1506839358, now seen corresponding path program 2 times [2022-07-22 21:44:39,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:39,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673474574] [2022-07-22 21:44:39,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 21:44:39,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:39,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673474574] [2022-07-22 21:44:39,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673474574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 21:44:39,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 21:44:39,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 21:44:39,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907393620] [2022-07-22 21:44:39,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 21:44:39,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 21:44:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:39,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 21:44:39,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 21:44:39,164 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 105 [2022-07-22 21:44:39,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 227 transitions, 2776 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 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:39,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:39,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 105 [2022-07-22 21:44:39,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:39,838 INFO L129 PetriNetUnfolder]: 1608/5090 cut-off events. [2022-07-22 21:44:39,839 INFO L130 PetriNetUnfolder]: For 49044/49384 co-relation queries the response was YES. [2022-07-22 21:44:39,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27666 conditions, 5090 events. 1608/5090 cut-off events. For 49044/49384 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 47614 event pairs, 322 based on Foata normal form. 149/5036 useless extension candidates. Maximal degree in co-relation 27618. Up to 1003 conditions per place. [2022-07-22 21:44:39,893 INFO L132 encePairwiseOnDemand]: 100/105 looper letters, 37 selfloop transitions, 5 changer transitions 2/225 dead transitions. [2022-07-22 21:44:39,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 225 transitions, 2619 flow [2022-07-22 21:44:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 21:44:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-22 21:44:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 377 transitions. [2022-07-22 21:44:39,895 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8976190476190476 [2022-07-22 21:44:39,895 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 377 transitions. [2022-07-22 21:44:39,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 377 transitions. [2022-07-22 21:44:39,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:39,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 377 transitions. [2022-07-22 21:44:39,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 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:39,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:39,897 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 21:44:39,898 INFO L186 Difference]: Start difference. First operand has 171 places, 227 transitions, 2776 flow. Second operand 4 states and 377 transitions. [2022-07-22 21:44:39,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 225 transitions, 2619 flow [2022-07-22 21:44:39,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 225 transitions, 2597 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-07-22 21:44:39,964 INFO L242 Difference]: Finished difference. Result has 175 places, 207 transitions, 2377 flow [2022-07-22 21:44:39,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2384, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2377, PETRI_PLACES=175, PETRI_TRANSITIONS=207} [2022-07-22 21:44:39,965 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 81 predicate places. [2022-07-22 21:44:39,965 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 207 transitions, 2377 flow [2022-07-22 21:44:39,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 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:39,965 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:39,965 INFO L200 CegarLoopForPetriNet]: trace histogram [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:44:39,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 21:44:39,966 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:39,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:39,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1562186295, now seen corresponding path program 1 times [2022-07-22 21:44:39,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:39,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119656060] [2022-07-22 21:44:39,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:39,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:40,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119656060] [2022-07-22 21:44:40,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119656060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:40,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112939776] [2022-07-22 21:44:40,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:40,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:40,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:40,035 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:40,079 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:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:40,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 21:44:40,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:40,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:40,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112939776] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:44:40,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:44:40,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2022-07-22 21:44:40,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902441779] [2022-07-22 21:44:40,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:44:40,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 21:44:40,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:40,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 21:44:40,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-22 21:44:40,317 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-07-22 21:44:40,317 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 207 transitions, 2377 flow. Second operand has 15 states, 15 states have (on average 77.93333333333334) internal successors, (1169), 15 states have internal predecessors, (1169), 0 states have call successors, (0), 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,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:40,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-07-22 21:44:40,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:42,149 INFO L129 PetriNetUnfolder]: 3274/9065 cut-off events. [2022-07-22 21:44:42,150 INFO L130 PetriNetUnfolder]: For 103076/103348 co-relation queries the response was YES. [2022-07-22 21:44:42,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53750 conditions, 9065 events. 3274/9065 cut-off events. For 103076/103348 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 93326 event pairs, 123 based on Foata normal form. 234/9261 useless extension candidates. Maximal degree in co-relation 53700. Up to 1843 conditions per place. [2022-07-22 21:44:42,281 INFO L132 encePairwiseOnDemand]: 92/105 looper letters, 87 selfloop transitions, 127 changer transitions 163/484 dead transitions. [2022-07-22 21:44:42,282 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 484 transitions, 7747 flow [2022-07-22 21:44:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-22 21:44:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-07-22 21:44:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2110 transitions. [2022-07-22 21:44:42,287 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7728937728937729 [2022-07-22 21:44:42,287 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2110 transitions. [2022-07-22 21:44:42,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2110 transitions. [2022-07-22 21:44:42,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:42,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2110 transitions. [2022-07-22 21:44:42,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 81.15384615384616) internal successors, (2110), 26 states have internal predecessors, (2110), 0 states have call successors, (0), 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:42,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 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:42,297 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 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:42,297 INFO L186 Difference]: Start difference. First operand has 175 places, 207 transitions, 2377 flow. Second operand 26 states and 2110 transitions. [2022-07-22 21:44:42,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 484 transitions, 7747 flow [2022-07-22 21:44:42,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 484 transitions, 7741 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-07-22 21:44:42,510 INFO L242 Difference]: Finished difference. Result has 214 places, 272 transitions, 3700 flow [2022-07-22 21:44:42,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2357, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3700, PETRI_PLACES=214, PETRI_TRANSITIONS=272} [2022-07-22 21:44:42,510 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 120 predicate places. [2022-07-22 21:44:42,511 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 272 transitions, 3700 flow [2022-07-22 21:44:42,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 77.93333333333334) internal successors, (1169), 15 states have internal predecessors, (1169), 0 states have call successors, (0), 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:42,511 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:42,511 INFO L200 CegarLoopForPetriNet]: trace histogram [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:44:42,528 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:42,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 21:44:42,713 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:42,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash -548643663, now seen corresponding path program 2 times [2022-07-22 21:44:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:42,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340075231] [2022-07-22 21:44:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:42,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:42,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340075231] [2022-07-22 21:44:42,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340075231] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:42,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940900001] [2022-07-22 21:44:42,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 21:44:42,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:42,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:42,836 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:44:42,837 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:44:42,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 21:44:42,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:44:42,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 21:44:42,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:43,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:43,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940900001] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:44:43,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:44:43,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2022-07-22 21:44:43,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990305347] [2022-07-22 21:44:43,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:44:43,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 21:44:43,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:43,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 21:44:43,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-22 21:44:43,096 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-07-22 21:44:43,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 272 transitions, 3700 flow. Second operand has 15 states, 15 states have (on average 78.0) internal successors, (1170), 15 states have internal predecessors, (1170), 0 states have call successors, (0), 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:43,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:43,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-07-22 21:44:43,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:45,659 INFO L129 PetriNetUnfolder]: 4820/12609 cut-off events. [2022-07-22 21:44:45,660 INFO L130 PetriNetUnfolder]: For 205064/205474 co-relation queries the response was YES. [2022-07-22 21:44:45,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86611 conditions, 12609 events. 4820/12609 cut-off events. For 205064/205474 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 137969 event pairs, 214 based on Foata normal form. 170/12740 useless extension candidates. Maximal degree in co-relation 86546. Up to 2870 conditions per place. [2022-07-22 21:44:45,805 INFO L132 encePairwiseOnDemand]: 92/105 looper letters, 133 selfloop transitions, 233 changer transitions 123/596 dead transitions. [2022-07-22 21:44:45,805 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 596 transitions, 10891 flow [2022-07-22 21:44:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-22 21:44:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-07-22 21:44:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2106 transitions. [2022-07-22 21:44:45,808 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7714285714285715 [2022-07-22 21:44:45,808 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2106 transitions. [2022-07-22 21:44:45,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2106 transitions. [2022-07-22 21:44:45,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:45,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2106 transitions. [2022-07-22 21:44:45,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 81.0) internal successors, (2106), 26 states have internal predecessors, (2106), 0 states have call successors, (0), 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,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 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,816 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 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,816 INFO L186 Difference]: Start difference. First operand has 214 places, 272 transitions, 3700 flow. Second operand 26 states and 2106 transitions. [2022-07-22 21:44:45,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 596 transitions, 10891 flow [2022-07-22 21:44:46,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 596 transitions, 9961 flow, removed 448 selfloop flow, removed 10 redundant places. [2022-07-22 21:44:46,639 INFO L242 Difference]: Finished difference. Result has 236 places, 422 transitions, 6680 flow [2022-07-22 21:44:46,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=3416, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=6680, PETRI_PLACES=236, PETRI_TRANSITIONS=422} [2022-07-22 21:44:46,640 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 142 predicate places. [2022-07-22 21:44:46,640 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 422 transitions, 6680 flow [2022-07-22 21:44:46,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 78.0) internal successors, (1170), 15 states have internal predecessors, (1170), 0 states have call successors, (0), 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,640 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-22 21:44:46,641 INFO L200 CegarLoopForPetriNet]: trace histogram [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:44:46,659 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:44:46,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-22 21:44:46,848 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,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 21:44:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash -43369385, now seen corresponding path program 3 times [2022-07-22 21:44:46,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 21:44:46,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934663721] [2022-07-22 21:44:46,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 21:44:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 21:44:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 21:44:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:46,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 21:44:46,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934663721] [2022-07-22 21:44:46,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934663721] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 21:44:46,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191661840] [2022-07-22 21:44:46,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 21:44:46,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 21:44:46,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 21:44:46,968 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:44:47,007 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:44:47,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 21:44:47,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 21:44:47,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 21:44:47,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 21:44:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:47,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 21:44:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 21:44:47,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191661840] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 21:44:47,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 21:44:47,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 16 [2022-07-22 21:44:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489619402] [2022-07-22 21:44:47,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 21:44:47,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 21:44:47,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 21:44:47,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 21:44:47,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-22 21:44:47,247 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2022-07-22 21:44:47,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 422 transitions, 6680 flow. Second operand has 16 states, 16 states have (on average 77.8125) internal successors, (1245), 16 states have internal predecessors, (1245), 0 states have call successors, (0), 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:47,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-22 21:44:47,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2022-07-22 21:44:47,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-22 21:44:49,991 INFO L129 PetriNetUnfolder]: 4795/12121 cut-off events. [2022-07-22 21:44:49,992 INFO L130 PetriNetUnfolder]: For 204892/205522 co-relation queries the response was YES. [2022-07-22 21:44:50,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83922 conditions, 12121 events. 4795/12121 cut-off events. For 204892/205522 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 131527 event pairs, 313 based on Foata normal form. 375/12456 useless extension candidates. Maximal degree in co-relation 83849. Up to 2885 conditions per place. [2022-07-22 21:44:50,135 INFO L132 encePairwiseOnDemand]: 92/105 looper letters, 0 selfloop transitions, 0 changer transitions 700/700 dead transitions. [2022-07-22 21:44:50,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 700 transitions, 13837 flow [2022-07-22 21:44:50,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-22 21:44:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-07-22 21:44:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2169 transitions. [2022-07-22 21:44:50,138 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.765079365079365 [2022-07-22 21:44:50,139 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2169 transitions. [2022-07-22 21:44:50,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2169 transitions. [2022-07-22 21:44:50,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 21:44:50,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2169 transitions. [2022-07-22 21:44:50,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 80.33333333333333) internal successors, (2169), 27 states have internal predecessors, (2169), 0 states have call successors, (0), 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:50,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 105.0) internal successors, (2940), 28 states have internal predecessors, (2940), 0 states have call successors, (0), 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:50,146 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 105.0) internal successors, (2940), 28 states have internal predecessors, (2940), 0 states have call successors, (0), 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:50,146 INFO L186 Difference]: Start difference. First operand has 236 places, 422 transitions, 6680 flow. Second operand 27 states and 2169 transitions. [2022-07-22 21:44:50,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 700 transitions, 13837 flow [2022-07-22 21:44:51,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 700 transitions, 13051 flow, removed 336 selfloop flow, removed 15 redundant places. [2022-07-22 21:44:51,220 INFO L242 Difference]: Finished difference. Result has 227 places, 0 transitions, 0 flow [2022-07-22 21:44:51,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=6183, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=0, PETRI_PLACES=227, PETRI_TRANSITIONS=0} [2022-07-22 21:44:51,221 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 133 predicate places. [2022-07-22 21:44:51,221 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 0 transitions, 0 flow [2022-07-22 21:44:51,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 77.8125) internal successors, (1245), 16 states have internal predecessors, (1245), 0 states have call successors, (0), 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,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-07-22 21:44:51,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-07-22 21:44:51,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-07-22 21:44:51,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-07-22 21:44:51,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-22 21:44:51,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 21:44:51,448 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 2, 1] [2022-07-22 21:44:51,450 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-22 21:44:51,451 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 21:44:51,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 09:44:51 BasicIcfg [2022-07-22 21:44:51,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 21:44:51,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 21:44:51,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 21:44:51,455 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 21:44:51,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:44:30" (3/4) ... [2022-07-22 21:44:51,457 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 21:44:51,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-07-22 21:44:51,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-07-22 21:44:51,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-07-22 21:44:51,464 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-07-22 21:44:51,465 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-22 21:44:51,465 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 21:44:51,465 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 21:44:51,486 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 21:44:51,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 21:44:51,486 INFO L158 Benchmark]: Toolchain (without parser) took 21636.27ms. Allocated memory was 86.0MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 49.5MB in the beginning and 5.3GB in the end (delta: -5.2GB). Peak memory consumption was 999.3MB. Max. memory is 16.1GB. [2022-07-22 21:44:51,487 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 86.0MB. Free memory was 65.8MB in the beginning and 65.7MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 21:44:51,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.15ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 49.3MB in the beginning and 79.8MB in the end (delta: -30.5MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-07-22 21:44:51,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.61ms. Allocated memory is still 104.9MB. Free memory was 79.6MB in the beginning and 77.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:44:51,487 INFO L158 Benchmark]: Boogie Preprocessor took 19.08ms. Allocated memory is still 104.9MB. Free memory was 77.9MB in the beginning and 76.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 21:44:51,487 INFO L158 Benchmark]: RCFGBuilder took 430.94ms. Allocated memory is still 104.9MB. Free memory was 76.6MB in the beginning and 63.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 21:44:51,488 INFO L158 Benchmark]: TraceAbstraction took 20841.72ms. Allocated memory was 104.9MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 63.0MB in the beginning and 5.3GB in the end (delta: -5.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-07-22 21:44:51,488 INFO L158 Benchmark]: Witness Printer took 31.72ms. Allocated memory is still 6.3GB. Free memory was 5.3GB in the beginning and 5.3GB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 21:44:51,489 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 86.0MB. Free memory was 65.8MB in the beginning and 65.7MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.15ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 49.3MB in the beginning and 79.8MB in the end (delta: -30.5MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.61ms. Allocated memory is still 104.9MB. Free memory was 79.6MB in the beginning and 77.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.08ms. Allocated memory is still 104.9MB. Free memory was 77.9MB in the beginning and 76.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 430.94ms. Allocated memory is still 104.9MB. Free memory was 76.6MB in the beginning and 63.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20841.72ms. Allocated memory was 104.9MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 63.0MB in the beginning and 5.3GB in the end (delta: -5.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 31.72ms. Allocated memory is still 6.3GB. Free memory was 5.3GB in the beginning and 5.3GB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 116]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 126 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.7s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 822 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 822 mSDsluCounter, 736 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1071 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2674 IncrementalHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 211 mSDtfsCounter, 2674 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1241 GetRequests, 1050 SyntacticMatches, 12 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6680occurred in iteration=16, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1914 NumberOfCodeBlocks, 1909 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2408 ConstructedInterpolants, 0 QuantifiedInterpolants, 6121 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1295 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 119/194 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-22 21:44:51,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE