./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-ring.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 e1611f006d8b4d3ca09ba5acfb7e64e93bdf2d1c3a87f0ab00b1667331afb989 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:29:44,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:29:44,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:29:44,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:29:44,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:29:44,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:29:44,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:29:44,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:29:44,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:29:44,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:29:44,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:29:44,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:29:44,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:29:44,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:29:44,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:29:44,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:29:44,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:29:44,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:29:44,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:29:44,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:29:44,770 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:29:44,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:29:44,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:29:44,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:29:44,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:29:44,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:29:44,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:29:44,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:29:44,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:29:44,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:29:44,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:29:44,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:29:44,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:29:44,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:29:44,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:29:44,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:29:44,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:29:44,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:29:44,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:29:44,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:29:44,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:29:44,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:29:44,786 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:29:44,805 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:29:44,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:29:44,806 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:29:44,806 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:29:44,807 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:29:44,807 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:29:44,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:29:44,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:29:44,808 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:29:44,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:29:44,809 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:29:44,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:29:44,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:29:44,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:29:44,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:29:44,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:29:44,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:29:44,810 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:29:44,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:29:44,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:29:44,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:29:44,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:29:44,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:29:44,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:29:44,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:29:44,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:29:44,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:29:44,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:29:44,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:29:44,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:29:44,814 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:29:44,814 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:29:44,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:29:44,814 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 -> e1611f006d8b4d3ca09ba5acfb7e64e93bdf2d1c3a87f0ab00b1667331afb989 [2022-07-12 10:29:45,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:29:45,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:29:45,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:29:45,089 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:29:45,090 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:29:45,091 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c [2022-07-12 10:29:45,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0530d48ef/d9c4e75a3a284f429a827670c5422ff8/FLAG276e6a06b [2022-07-12 10:29:45,638 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:29:45,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c [2022-07-12 10:29:45,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0530d48ef/d9c4e75a3a284f429a827670c5422ff8/FLAG276e6a06b [2022-07-12 10:29:46,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0530d48ef/d9c4e75a3a284f429a827670c5422ff8 [2022-07-12 10:29:46,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:29:46,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:29:46,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:29:46,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:29:46,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:29:46,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:29:46" (1/1) ... [2022-07-12 10:29:46,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62cfbe71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:46, skipping insertion in model container [2022-07-12 10:29:46,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:29:46" (1/1) ... [2022-07-12 10:29:46,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:29:46,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:29:46,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c[3947,3960] [2022-07-12 10:29:46,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:29:46,403 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:29:46,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c[3947,3960] [2022-07-12 10:29:46,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:29:46,442 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:29:46,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:46 WrapperNode [2022-07-12 10:29:46,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:29:46,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:29:46,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:29:46,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:29:46,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:46" (1/1) ... [2022-07-12 10:29:46,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:46" (1/1) ... [2022-07-12 10:29:46,499 INFO L137 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 315 [2022-07-12 10:29:46,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:29:46,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:29:46,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:29:46,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:29:46,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:46" (1/1) ... [2022-07-12 10:29:46,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:46" (1/1) ... [2022-07-12 10:29:46,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:46" (1/1) ... [2022-07-12 10:29:46,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:46" (1/1) ... [2022-07-12 10:29:46,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:46" (1/1) ... [2022-07-12 10:29:46,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:46" (1/1) ... [2022-07-12 10:29:46,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:46" (1/1) ... [2022-07-12 10:29:46,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:29:46,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:29:46,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:29:46,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:29:46,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:46" (1/1) ... [2022-07-12 10:29:46,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:29:46,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:46,577 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-12 10:29:46,605 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-12 10:29:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:29:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:29:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:29:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:29:46,627 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-12 10:29:46,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-12 10:29:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-12 10:29:46,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-12 10:29:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-12 10:29:46,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-12 10:29:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:29:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:29:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:29:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:29:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:29:46,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:29:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:29:46,631 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:29:46,779 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:29:46,781 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:29:47,301 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:29:47,439 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:29:47,440 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 10:29:47,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:29:47 BoogieIcfgContainer [2022-07-12 10:29:47,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:29:47,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:29:47,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:29:47,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:29:47,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:29:46" (1/3) ... [2022-07-12 10:29:47,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c66e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:29:47, skipping insertion in model container [2022-07-12 10:29:47,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:46" (2/3) ... [2022-07-12 10:29:47,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c66e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:29:47, skipping insertion in model container [2022-07-12 10:29:47,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:29:47" (3/3) ... [2022-07-12 10:29:47,450 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2022-07-12 10:29:47,455 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:29:47,463 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:29:47,463 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:29:47,463 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:29:47,558 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-12 10:29:47,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 255 places, 267 transitions, 558 flow [2022-07-12 10:29:47,731 INFO L129 PetriNetUnfolder]: 22/264 cut-off events. [2022-07-12 10:29:47,732 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:29:47,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 264 events. 22/264 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 157 event pairs, 0 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 224. Up to 3 conditions per place. [2022-07-12 10:29:47,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 267 transitions, 558 flow [2022-07-12 10:29:47,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 253 transitions, 524 flow [2022-07-12 10:29:47,766 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:29:47,776 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@1d853539, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@cb1e29 [2022-07-12 10:29:47,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-12 10:29:47,828 INFO L129 PetriNetUnfolder]: 22/252 cut-off events. [2022-07-12 10:29:47,829 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:29:47,830 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:47,831 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:29:47,831 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-12 10:29:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:47,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1135636700, now seen corresponding path program 1 times [2022-07-12 10:29:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:47,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863356206] [2022-07-12 10:29:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:47,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:48,181 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-12 10:29:48,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:48,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863356206] [2022-07-12 10:29:48,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863356206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:29:48,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:29:48,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:29:48,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342558702] [2022-07-12 10:29:48,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:48,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 10:29:48,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:48,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 10:29:48,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 10:29:48,238 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 267 [2022-07-12 10:29:48,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 253 transitions, 524 flow. Second operand has 2 states, 2 states have (on average 242.0) internal successors, (484), 2 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:48,249 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:48,249 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 267 [2022-07-12 10:29:48,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:48,435 INFO L129 PetriNetUnfolder]: 137/624 cut-off events. [2022-07-12 10:29:48,436 INFO L130 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-07-12 10:29:48,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 624 events. 137/624 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2460 event pairs, 74 based on Foata normal form. 97/654 useless extension candidates. Maximal degree in co-relation 622. Up to 197 conditions per place. [2022-07-12 10:29:48,445 INFO L132 encePairwiseOnDemand]: 251/267 looper letters, 13 selfloop transitions, 0 changer transitions 8/237 dead transitions. [2022-07-12 10:29:48,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 237 transitions, 518 flow [2022-07-12 10:29:48,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 10:29:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-12 10:29:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 503 transitions. [2022-07-12 10:29:48,466 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9419475655430711 [2022-07-12 10:29:48,467 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 503 transitions. [2022-07-12 10:29:48,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 503 transitions. [2022-07-12 10:29:48,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:48,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 503 transitions. [2022-07-12 10:29:48,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 251.5) internal successors, (503), 2 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:48,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 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-12 10:29:48,497 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 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-12 10:29:48,498 INFO L186 Difference]: Start difference. First operand has 241 places, 253 transitions, 524 flow. Second operand 2 states and 503 transitions. [2022-07-12 10:29:48,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 237 transitions, 518 flow [2022-07-12 10:29:48,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 237 transitions, 506 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-12 10:29:48,510 INFO L242 Difference]: Finished difference. Result has 236 places, 229 transitions, 464 flow [2022-07-12 10:29:48,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=464, PETRI_PLACES=236, PETRI_TRANSITIONS=229} [2022-07-12 10:29:48,517 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, -5 predicate places. [2022-07-12 10:29:48,517 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 229 transitions, 464 flow [2022-07-12 10:29:48,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 242.0) internal successors, (484), 2 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:48,518 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:48,518 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:29:48,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:29:48,520 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-12 10:29:48,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:48,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1907627099, now seen corresponding path program 1 times [2022-07-12 10:29:48,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:48,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598799472] [2022-07-12 10:29:48,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:48,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:48,828 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-12 10:29:48,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:48,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598799472] [2022-07-12 10:29:48,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598799472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:29:48,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:29:48,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:29:48,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986836982] [2022-07-12 10:29:48,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:48,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:29:48,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:48,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:29:48,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:29:48,840 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 267 [2022-07-12 10:29:48,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 229 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:48,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:48,842 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 267 [2022-07-12 10:29:48,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:49,010 INFO L129 PetriNetUnfolder]: 125/535 cut-off events. [2022-07-12 10:29:49,010 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-07-12 10:29:49,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 535 events. 125/535 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1785 event pairs, 29 based on Foata normal form. 10/511 useless extension candidates. Maximal degree in co-relation 748. Up to 143 conditions per place. [2022-07-12 10:29:49,017 INFO L132 encePairwiseOnDemand]: 262/267 looper letters, 23 selfloop transitions, 4 changer transitions 0/236 dead transitions. [2022-07-12 10:29:49,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 236 transitions, 534 flow [2022-07-12 10:29:49,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:29:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:29:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2022-07-12 10:29:49,020 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8963795255930087 [2022-07-12 10:29:49,021 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 718 transitions. [2022-07-12 10:29:49,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 718 transitions. [2022-07-12 10:29:49,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:49,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 718 transitions. [2022-07-12 10:29:49,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 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-12 10:29:49,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 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-12 10:29:49,028 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 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-12 10:29:49,028 INFO L186 Difference]: Start difference. First operand has 236 places, 229 transitions, 464 flow. Second operand 3 states and 718 transitions. [2022-07-12 10:29:49,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 236 transitions, 534 flow [2022-07-12 10:29:49,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 236 transitions, 534 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:29:49,038 INFO L242 Difference]: Finished difference. Result has 231 places, 230 transitions, 482 flow [2022-07-12 10:29:49,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=231, PETRI_TRANSITIONS=230} [2022-07-12 10:29:49,040 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, -10 predicate places. [2022-07-12 10:29:49,040 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 230 transitions, 482 flow [2022-07-12 10:29:49,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:29:49,041 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:49,041 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:29:49,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:29:49,041 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-12 10:29:49,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:49,042 INFO L85 PathProgramCache]: Analyzing trace with hash 942137239, now seen corresponding path program 2 times [2022-07-12 10:29:49,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:49,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711958424] [2022-07-12 10:29:49,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:49,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:49,293 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-12 10:29:49,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:49,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711958424] [2022-07-12 10:29:49,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711958424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:29:49,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:29:49,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:29:49,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605691643] [2022-07-12 10:29:49,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:49,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:29:49,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:49,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:29:49,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:29:49,299 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 267 [2022-07-12 10:29:49,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 230 transitions, 482 flow. Second operand has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 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-12 10:29:49,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:49,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 267 [2022-07-12 10:29:49,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:49,596 INFO L129 PetriNetUnfolder]: 175/737 cut-off events. [2022-07-12 10:29:49,597 INFO L130 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-07-12 10:29:49,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 737 events. 175/737 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3063 event pairs, 106 based on Foata normal form. 20/705 useless extension candidates. Maximal degree in co-relation 1191. Up to 195 conditions per place. [2022-07-12 10:29:49,602 INFO L132 encePairwiseOnDemand]: 258/267 looper letters, 50 selfloop transitions, 6 changer transitions 12/246 dead transitions. [2022-07-12 10:29:49,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 246 transitions, 662 flow [2022-07-12 10:29:49,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:29:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:29:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1461 transitions. [2022-07-12 10:29:49,607 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7817014446227929 [2022-07-12 10:29:49,607 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1461 transitions. [2022-07-12 10:29:49,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1461 transitions. [2022-07-12 10:29:49,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:49,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1461 transitions. [2022-07-12 10:29:49,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 208.71428571428572) internal successors, (1461), 7 states have internal predecessors, (1461), 0 states have call successors, (0), 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-12 10:29:49,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 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-12 10:29:49,615 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 267.0) internal successors, (2136), 8 states have internal predecessors, (2136), 0 states have call successors, (0), 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-12 10:29:49,615 INFO L186 Difference]: Start difference. First operand has 231 places, 230 transitions, 482 flow. Second operand 7 states and 1461 transitions. [2022-07-12 10:29:49,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 246 transitions, 662 flow [2022-07-12 10:29:49,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 246 transitions, 657 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:29:49,623 INFO L242 Difference]: Finished difference. Result has 238 places, 231 transitions, 502 flow [2022-07-12 10:29:49,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=502, PETRI_PLACES=238, PETRI_TRANSITIONS=231} [2022-07-12 10:29:49,625 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, -3 predicate places. [2022-07-12 10:29:49,625 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 231 transitions, 502 flow [2022-07-12 10:29:49,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 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-12 10:29:49,626 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:49,627 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:29:49,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:29:49,627 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-12 10:29:49,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:49,628 INFO L85 PathProgramCache]: Analyzing trace with hash 664355121, now seen corresponding path program 1 times [2022-07-12 10:29:49,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:49,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157815225] [2022-07-12 10:29:49,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:49,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:29:49,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:49,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157815225] [2022-07-12 10:29:49,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157815225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:29:49,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:29:49,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:29:49,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543834626] [2022-07-12 10:29:49,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:49,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:29:49,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:49,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:29:49,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:29:49,844 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 267 [2022-07-12 10:29:49,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 231 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 205.83333333333334) internal successors, (1235), 6 states have internal predecessors, (1235), 0 states have call successors, (0), 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-12 10:29:49,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:49,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 267 [2022-07-12 10:29:49,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:50,092 INFO L129 PetriNetUnfolder]: 152/717 cut-off events. [2022-07-12 10:29:50,092 INFO L130 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-07-12 10:29:50,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 717 events. 152/717 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2659 event pairs, 84 based on Foata normal form. 9/677 useless extension candidates. Maximal degree in co-relation 1145. Up to 214 conditions per place. [2022-07-12 10:29:50,096 INFO L132 encePairwiseOnDemand]: 257/267 looper letters, 49 selfloop transitions, 8 changer transitions 22/257 dead transitions. [2022-07-12 10:29:50,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 257 transitions, 732 flow [2022-07-12 10:29:50,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:29:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:29:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1868 transitions. [2022-07-12 10:29:50,101 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7773616312942155 [2022-07-12 10:29:50,101 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1868 transitions. [2022-07-12 10:29:50,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1868 transitions. [2022-07-12 10:29:50,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:50,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1868 transitions. [2022-07-12 10:29:50,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 207.55555555555554) internal successors, (1868), 9 states have internal predecessors, (1868), 0 states have call successors, (0), 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-12 10:29:50,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 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-12 10:29:50,115 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 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-12 10:29:50,115 INFO L186 Difference]: Start difference. First operand has 238 places, 231 transitions, 502 flow. Second operand 9 states and 1868 transitions. [2022-07-12 10:29:50,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 257 transitions, 732 flow [2022-07-12 10:29:50,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 257 transitions, 716 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:29:50,121 INFO L242 Difference]: Finished difference. Result has 243 places, 232 transitions, 520 flow [2022-07-12 10:29:50,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=520, PETRI_PLACES=243, PETRI_TRANSITIONS=232} [2022-07-12 10:29:50,127 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 2 predicate places. [2022-07-12 10:29:50,127 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 232 transitions, 520 flow [2022-07-12 10:29:50,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.83333333333334) internal successors, (1235), 6 states have internal predecessors, (1235), 0 states have call successors, (0), 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-12 10:29:50,128 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:50,129 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:29:50,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:29:50,129 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-12 10:29:50,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash -587875451, now seen corresponding path program 1 times [2022-07-12 10:29:50,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:50,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116725643] [2022-07-12 10:29:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:50,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:29:50,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:50,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116725643] [2022-07-12 10:29:50,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116725643] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:29:50,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:29:50,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:29:50,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076862491] [2022-07-12 10:29:50,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:50,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:29:50,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:50,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:29:50,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:29:50,272 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 267 [2022-07-12 10:29:50,273 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 232 transitions, 520 flow. Second operand has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 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-12 10:29:50,273 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:50,273 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 267 [2022-07-12 10:29:50,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:50,497 INFO L129 PetriNetUnfolder]: 245/870 cut-off events. [2022-07-12 10:29:50,498 INFO L130 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-07-12 10:29:50,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 870 events. 245/870 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4114 event pairs, 84 based on Foata normal form. 1/822 useless extension candidates. Maximal degree in co-relation 1534. Up to 226 conditions per place. [2022-07-12 10:29:50,504 INFO L132 encePairwiseOnDemand]: 262/267 looper letters, 57 selfloop transitions, 2 changer transitions 7/249 dead transitions. [2022-07-12 10:29:50,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 249 transitions, 703 flow [2022-07-12 10:29:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:29:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-12 10:29:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1035 transitions. [2022-07-12 10:29:50,507 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7752808988764045 [2022-07-12 10:29:50,507 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1035 transitions. [2022-07-12 10:29:50,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1035 transitions. [2022-07-12 10:29:50,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:50,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1035 transitions. [2022-07-12 10:29:50,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 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-12 10:29:50,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 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-12 10:29:50,513 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 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-12 10:29:50,513 INFO L186 Difference]: Start difference. First operand has 243 places, 232 transitions, 520 flow. Second operand 5 states and 1035 transitions. [2022-07-12 10:29:50,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 249 transitions, 703 flow [2022-07-12 10:29:50,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 249 transitions, 683 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-07-12 10:29:50,520 INFO L242 Difference]: Finished difference. Result has 242 places, 233 transitions, 518 flow [2022-07-12 10:29:50,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=518, PETRI_PLACES=242, PETRI_TRANSITIONS=233} [2022-07-12 10:29:50,523 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 1 predicate places. [2022-07-12 10:29:50,524 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 233 transitions, 518 flow [2022-07-12 10:29:50,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 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-12 10:29:50,524 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:50,525 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:29:50,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:29:50,526 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-12 10:29:50,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:50,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1791728807, now seen corresponding path program 1 times [2022-07-12 10:29:50,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:50,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589420345] [2022-07-12 10:29:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:50,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:29:50,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:50,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589420345] [2022-07-12 10:29:50,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589420345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:29:50,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:29:50,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:29:50,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775595048] [2022-07-12 10:29:50,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:50,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:29:50,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:50,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:29:50,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:29:50,661 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 267 [2022-07-12 10:29:50,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 233 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 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-12 10:29:50,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:50,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 267 [2022-07-12 10:29:50,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:50,803 INFO L129 PetriNetUnfolder]: 138/580 cut-off events. [2022-07-12 10:29:50,803 INFO L130 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-07-12 10:29:50,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 580 events. 138/580 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1997 event pairs, 50 based on Foata normal form. 11/563 useless extension candidates. Maximal degree in co-relation 943. Up to 127 conditions per place. [2022-07-12 10:29:50,807 INFO L132 encePairwiseOnDemand]: 264/267 looper letters, 21 selfloop transitions, 2 changer transitions 3/241 dead transitions. [2022-07-12 10:29:50,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 241 transitions, 594 flow [2022-07-12 10:29:50,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:29:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:29:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2022-07-12 10:29:50,810 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9051186017478152 [2022-07-12 10:29:50,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 725 transitions. [2022-07-12 10:29:50,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 725 transitions. [2022-07-12 10:29:50,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:50,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 725 transitions. [2022-07-12 10:29:50,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.66666666666666) internal successors, (725), 3 states have internal predecessors, (725), 0 states have call successors, (0), 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-12 10:29:50,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 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-12 10:29:50,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 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-12 10:29:50,814 INFO L186 Difference]: Start difference. First operand has 242 places, 233 transitions, 518 flow. Second operand 3 states and 725 transitions. [2022-07-12 10:29:50,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 241 transitions, 594 flow [2022-07-12 10:29:50,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 241 transitions, 588 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-12 10:29:50,820 INFO L242 Difference]: Finished difference. Result has 240 places, 234 transitions, 526 flow [2022-07-12 10:29:50,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=240, PETRI_TRANSITIONS=234} [2022-07-12 10:29:50,821 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, -1 predicate places. [2022-07-12 10:29:50,821 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 234 transitions, 526 flow [2022-07-12 10:29:50,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 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-12 10:29:50,822 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:50,822 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:29:50,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:29:50,823 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-12 10:29:50,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:50,823 INFO L85 PathProgramCache]: Analyzing trace with hash 554337119, now seen corresponding path program 2 times [2022-07-12 10:29:50,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:50,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901909620] [2022-07-12 10:29:50,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:50,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:29:50,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:50,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901909620] [2022-07-12 10:29:50,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901909620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:29:50,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:29:50,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:29:50,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072955306] [2022-07-12 10:29:50,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:50,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:29:50,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:50,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:29:50,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:29:50,945 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 267 [2022-07-12 10:29:50,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 234 transitions, 526 flow. Second operand has 6 states, 6 states have (on average 206.83333333333334) internal successors, (1241), 6 states have internal predecessors, (1241), 0 states have call successors, (0), 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-12 10:29:50,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:50,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 267 [2022-07-12 10:29:50,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:51,194 INFO L129 PetriNetUnfolder]: 140/720 cut-off events. [2022-07-12 10:29:51,194 INFO L130 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-07-12 10:29:51,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 720 events. 140/720 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2345 event pairs, 82 based on Foata normal form. 8/697 useless extension candidates. Maximal degree in co-relation 1219. Up to 247 conditions per place. [2022-07-12 10:29:51,199 INFO L132 encePairwiseOnDemand]: 255/267 looper letters, 51 selfloop transitions, 8 changer transitions 30/268 dead transitions. [2022-07-12 10:29:51,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 268 transitions, 791 flow [2022-07-12 10:29:51,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:29:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:29:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1877 transitions. [2022-07-12 10:29:51,204 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7811069496462755 [2022-07-12 10:29:51,204 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1877 transitions. [2022-07-12 10:29:51,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1877 transitions. [2022-07-12 10:29:51,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:51,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1877 transitions. [2022-07-12 10:29:51,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 208.55555555555554) internal successors, (1877), 9 states have internal predecessors, (1877), 0 states have call successors, (0), 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-12 10:29:51,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 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-12 10:29:51,214 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 267.0) internal successors, (2670), 10 states have internal predecessors, (2670), 0 states have call successors, (0), 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-12 10:29:51,214 INFO L186 Difference]: Start difference. First operand has 240 places, 234 transitions, 526 flow. Second operand 9 states and 1877 transitions. [2022-07-12 10:29:51,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 268 transitions, 791 flow [2022-07-12 10:29:51,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 268 transitions, 783 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-07-12 10:29:51,226 INFO L242 Difference]: Finished difference. Result has 248 places, 235 transitions, 550 flow [2022-07-12 10:29:51,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=550, PETRI_PLACES=248, PETRI_TRANSITIONS=235} [2022-07-12 10:29:51,227 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 7 predicate places. [2022-07-12 10:29:51,227 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 235 transitions, 550 flow [2022-07-12 10:29:51,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.83333333333334) internal successors, (1241), 6 states have internal predecessors, (1241), 0 states have call successors, (0), 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-12 10:29:51,228 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:51,229 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:29:51,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:29:51,229 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-12 10:29:51,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:51,230 INFO L85 PathProgramCache]: Analyzing trace with hash 224907029, now seen corresponding path program 1 times [2022-07-12 10:29:51,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:51,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701039041] [2022-07-12 10:29:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:51,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:29:51,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:51,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701039041] [2022-07-12 10:29:51,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701039041] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:51,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993103564] [2022-07-12 10:29:51,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:51,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:51,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:51,436 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-12 10:29:51,438 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-12 10:29:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:51,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 10:29:51,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:29:52,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:52,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2022-07-12 10:29:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:29:52,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993103564] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:52,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:52,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 23 [2022-07-12 10:29:52,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586883507] [2022-07-12 10:29:52,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:52,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 10:29:52,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:52,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 10:29:52,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2022-07-12 10:29:52,769 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2022-07-12 10:29:52,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 235 transitions, 550 flow. Second operand has 23 states, 23 states have (on average 196.34782608695653) internal successors, (4516), 23 states have internal predecessors, (4516), 0 states have call successors, (0), 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-12 10:29:52,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:52,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2022-07-12 10:29:52,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:53,357 INFO L129 PetriNetUnfolder]: 189/977 cut-off events. [2022-07-12 10:29:53,357 INFO L130 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2022-07-12 10:29:53,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1756 conditions, 977 events. 189/977 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4395 event pairs, 64 based on Foata normal form. 56/983 useless extension candidates. Maximal degree in co-relation 1745. Up to 187 conditions per place. [2022-07-12 10:29:53,363 INFO L132 encePairwiseOnDemand]: 246/267 looper letters, 52 selfloop transitions, 22 changer transitions 61/307 dead transitions. [2022-07-12 10:29:53,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 307 transitions, 1041 flow [2022-07-12 10:29:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 10:29:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-12 10:29:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4161 transitions. [2022-07-12 10:29:53,373 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7421080791867308 [2022-07-12 10:29:53,373 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4161 transitions. [2022-07-12 10:29:53,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4161 transitions. [2022-07-12 10:29:53,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:53,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4161 transitions. [2022-07-12 10:29:53,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 198.14285714285714) internal successors, (4161), 21 states have internal predecessors, (4161), 0 states have call successors, (0), 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-12 10:29:53,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 267.0) internal successors, (5874), 22 states have internal predecessors, (5874), 0 states have call successors, (0), 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-12 10:29:53,398 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 267.0) internal successors, (5874), 22 states have internal predecessors, (5874), 0 states have call successors, (0), 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-12 10:29:53,398 INFO L186 Difference]: Start difference. First operand has 248 places, 235 transitions, 550 flow. Second operand 21 states and 4161 transitions. [2022-07-12 10:29:53,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 307 transitions, 1041 flow [2022-07-12 10:29:53,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 307 transitions, 1023 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-12 10:29:53,405 INFO L242 Difference]: Finished difference. Result has 270 places, 240 transitions, 640 flow [2022-07-12 10:29:53,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=640, PETRI_PLACES=270, PETRI_TRANSITIONS=240} [2022-07-12 10:29:53,408 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 29 predicate places. [2022-07-12 10:29:53,408 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 240 transitions, 640 flow [2022-07-12 10:29:53,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 196.34782608695653) internal successors, (4516), 23 states have internal predecessors, (4516), 0 states have call successors, (0), 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-12 10:29:53,416 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:53,417 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:29:53,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 10:29:53,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:53,642 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-12 10:29:53,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1808705183, now seen corresponding path program 2 times [2022-07-12 10:29:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:53,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070985846] [2022-07-12 10:29:53,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:53,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 10:29:53,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:53,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070985846] [2022-07-12 10:29:53,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070985846] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:53,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340313256] [2022-07-12 10:29:53,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:29:53,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:53,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:53,771 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-12 10:29:53,799 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-12 10:29:53,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:29:53,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:53,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 10:29:53,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:54,612 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 10:29:54,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-07-12 10:29:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:29:54,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:54,840 INFO L356 Elim1Store]: treesize reduction 42, result has 14.3 percent of original size [2022-07-12 10:29:54,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 19 [2022-07-12 10:29:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 10:29:55,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340313256] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:55,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:55,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 6] total 21 [2022-07-12 10:29:55,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870186781] [2022-07-12 10:29:55,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:55,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 10:29:55,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:55,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 10:29:55,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-07-12 10:29:55,143 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 267 [2022-07-12 10:29:55,146 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 240 transitions, 640 flow. Second operand has 21 states, 21 states have (on average 185.47619047619048) internal successors, (3895), 21 states have internal predecessors, (3895), 0 states have call successors, (0), 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-12 10:29:55,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:55,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 267 [2022-07-12 10:29:55,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:56,025 INFO L129 PetriNetUnfolder]: 812/2158 cut-off events. [2022-07-12 10:29:56,025 INFO L130 PetriNetUnfolder]: For 3360/3469 co-relation queries the response was YES. [2022-07-12 10:29:56,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5300 conditions, 2158 events. 812/2158 cut-off events. For 3360/3469 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12348 event pairs, 127 based on Foata normal form. 1/2029 useless extension candidates. Maximal degree in co-relation 5280. Up to 640 conditions per place. [2022-07-12 10:29:56,044 INFO L132 encePairwiseOnDemand]: 240/267 looper letters, 164 selfloop transitions, 69 changer transitions 0/391 dead transitions. [2022-07-12 10:29:56,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 391 transitions, 1699 flow [2022-07-12 10:29:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 10:29:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-07-12 10:29:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5385 transitions. [2022-07-12 10:29:56,057 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6954668733049205 [2022-07-12 10:29:56,058 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5385 transitions. [2022-07-12 10:29:56,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5385 transitions. [2022-07-12 10:29:56,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:56,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5385 transitions. [2022-07-12 10:29:56,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 185.68965517241378) internal successors, (5385), 29 states have internal predecessors, (5385), 0 states have call successors, (0), 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-12 10:29:56,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 267.0) internal successors, (8010), 30 states have internal predecessors, (8010), 0 states have call successors, (0), 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-12 10:29:56,085 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 267.0) internal successors, (8010), 30 states have internal predecessors, (8010), 0 states have call successors, (0), 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-12 10:29:56,085 INFO L186 Difference]: Start difference. First operand has 270 places, 240 transitions, 640 flow. Second operand 29 states and 5385 transitions. [2022-07-12 10:29:56,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 391 transitions, 1699 flow [2022-07-12 10:29:56,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 391 transitions, 1544 flow, removed 56 selfloop flow, removed 10 redundant places. [2022-07-12 10:29:56,101 INFO L242 Difference]: Finished difference. Result has 292 places, 304 transitions, 1137 flow [2022-07-12 10:29:56,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1137, PETRI_PLACES=292, PETRI_TRANSITIONS=304} [2022-07-12 10:29:56,102 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 51 predicate places. [2022-07-12 10:29:56,103 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 304 transitions, 1137 flow [2022-07-12 10:29:56,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 185.47619047619048) internal successors, (3895), 21 states have internal predecessors, (3895), 0 states have call successors, (0), 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-12 10:29:56,104 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:56,105 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:29:56,133 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-12 10:29:56,318 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-12 10:29:56,319 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-12 10:29:56,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash -202299379, now seen corresponding path program 3 times [2022-07-12 10:29:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:56,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623361168] [2022-07-12 10:29:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:29:56,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:56,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623361168] [2022-07-12 10:29:56,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623361168] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:56,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535980126] [2022-07-12 10:29:56,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:29:56,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:56,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:56,836 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-12 10:29:56,837 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-12 10:29:57,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 10:29:57,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:57,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 10:29:57,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 10:29:57,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:29:57,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535980126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:29:57,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:29:57,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 23 [2022-07-12 10:29:57,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513388447] [2022-07-12 10:29:57,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:57,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:29:57,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:57,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:29:57,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2022-07-12 10:29:57,304 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 267 [2022-07-12 10:29:57,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 304 transitions, 1137 flow. Second operand has 5 states, 5 states have (on average 220.2) internal successors, (1101), 5 states have internal predecessors, (1101), 0 states have call successors, (0), 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-12 10:29:57,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:57,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 267 [2022-07-12 10:29:57,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:57,748 INFO L129 PetriNetUnfolder]: 812/2205 cut-off events. [2022-07-12 10:29:57,748 INFO L130 PetriNetUnfolder]: For 4581/4636 co-relation queries the response was YES. [2022-07-12 10:29:57,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6662 conditions, 2205 events. 812/2205 cut-off events. For 4581/4636 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 12955 event pairs, 190 based on Foata normal form. 7/2105 useless extension candidates. Maximal degree in co-relation 6635. Up to 1116 conditions per place. [2022-07-12 10:29:57,771 INFO L132 encePairwiseOnDemand]: 258/267 looper letters, 107 selfloop transitions, 17 changer transitions 0/330 dead transitions. [2022-07-12 10:29:57,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 330 transitions, 1531 flow [2022-07-12 10:29:57,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:29:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-12 10:29:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1124 transitions. [2022-07-12 10:29:57,774 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8419475655430712 [2022-07-12 10:29:57,775 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1124 transitions. [2022-07-12 10:29:57,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1124 transitions. [2022-07-12 10:29:57,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:57,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1124 transitions. [2022-07-12 10:29:57,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 224.8) internal successors, (1124), 5 states have internal predecessors, (1124), 0 states have call successors, (0), 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-12 10:29:57,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 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-12 10:29:57,781 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 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-12 10:29:57,781 INFO L186 Difference]: Start difference. First operand has 292 places, 304 transitions, 1137 flow. Second operand 5 states and 1124 transitions. [2022-07-12 10:29:57,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 330 transitions, 1531 flow [2022-07-12 10:29:57,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 330 transitions, 1461 flow, removed 25 selfloop flow, removed 8 redundant places. [2022-07-12 10:29:57,796 INFO L242 Difference]: Finished difference. Result has 289 places, 310 transitions, 1160 flow [2022-07-12 10:29:57,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1160, PETRI_PLACES=289, PETRI_TRANSITIONS=310} [2022-07-12 10:29:57,797 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 48 predicate places. [2022-07-12 10:29:57,798 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 310 transitions, 1160 flow [2022-07-12 10:29:57,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 220.2) internal successors, (1101), 5 states have internal predecessors, (1101), 0 states have call successors, (0), 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-12 10:29:57,798 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:57,799 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:29:57,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 10:29:58,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:58,016 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-12 10:29:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1688555133, now seen corresponding path program 4 times [2022-07-12 10:29:58,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:58,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874327670] [2022-07-12 10:29:58,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:58,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:29:58,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:58,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874327670] [2022-07-12 10:29:58,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874327670] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:58,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942040401] [2022-07-12 10:29:58,526 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 10:29:58,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:58,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:58,528 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-12 10:29:58,530 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-12 10:29:58,689 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 10:29:58,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:58,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 10:29:58,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:29:59,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:59,607 INFO L356 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2022-07-12 10:29:59,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 19 [2022-07-12 10:29:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 10:29:59,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942040401] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:59,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:59,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 6] total 33 [2022-07-12 10:29:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817776193] [2022-07-12 10:29:59,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:59,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 10:29:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:59,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 10:29:59,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 10:29:59,854 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 267 [2022-07-12 10:29:59,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 310 transitions, 1160 flow. Second operand has 33 states, 33 states have (on average 168.33333333333334) internal successors, (5555), 33 states have internal predecessors, (5555), 0 states have call successors, (0), 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-12 10:29:59,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:59,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 267 [2022-07-12 10:29:59,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:04,407 INFO L129 PetriNetUnfolder]: 3864/9631 cut-off events. [2022-07-12 10:30:04,407 INFO L130 PetriNetUnfolder]: For 28815/29300 co-relation queries the response was YES. [2022-07-12 10:30:04,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31725 conditions, 9631 events. 3864/9631 cut-off events. For 28815/29300 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 87120 event pairs, 422 based on Foata normal form. 405/9395 useless extension candidates. Maximal degree in co-relation 31696. Up to 1671 conditions per place. [2022-07-12 10:30:04,557 INFO L132 encePairwiseOnDemand]: 238/267 looper letters, 437 selfloop transitions, 118 changer transitions 69/765 dead transitions. [2022-07-12 10:30:04,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 765 transitions, 5327 flow [2022-07-12 10:30:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-12 10:30:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-07-12 10:30:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 8482 transitions. [2022-07-12 10:30:04,571 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6353558052434457 [2022-07-12 10:30:04,571 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 8482 transitions. [2022-07-12 10:30:04,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 8482 transitions. [2022-07-12 10:30:04,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:04,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 8482 transitions. [2022-07-12 10:30:04,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 169.64) internal successors, (8482), 50 states have internal predecessors, (8482), 0 states have call successors, (0), 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-12 10:30:04,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 267.0) internal successors, (13617), 51 states have internal predecessors, (13617), 0 states have call successors, (0), 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-12 10:30:04,611 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 267.0) internal successors, (13617), 51 states have internal predecessors, (13617), 0 states have call successors, (0), 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-12 10:30:04,611 INFO L186 Difference]: Start difference. First operand has 289 places, 310 transitions, 1160 flow. Second operand 50 states and 8482 transitions. [2022-07-12 10:30:04,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 765 transitions, 5327 flow [2022-07-12 10:30:04,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 765 transitions, 5285 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-07-12 10:30:04,640 INFO L242 Difference]: Finished difference. Result has 357 places, 397 transitions, 2300 flow [2022-07-12 10:30:04,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=2300, PETRI_PLACES=357, PETRI_TRANSITIONS=397} [2022-07-12 10:30:04,642 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 116 predicate places. [2022-07-12 10:30:04,642 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 397 transitions, 2300 flow [2022-07-12 10:30:04,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 168.33333333333334) internal successors, (5555), 33 states have internal predecessors, (5555), 0 states have call successors, (0), 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-12 10:30:04,644 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:04,644 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:30:04,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-12 10:30:04,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:04,868 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-12 10:30:04,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:04,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2099699287, now seen corresponding path program 5 times [2022-07-12 10:30:04,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:04,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249030658] [2022-07-12 10:30:04,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:04,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:30:05,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:05,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249030658] [2022-07-12 10:30:05,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249030658] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:05,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894162760] [2022-07-12 10:30:05,406 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 10:30:05,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:05,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:05,408 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-12 10:30:05,418 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-12 10:30:05,575 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-07-12 10:30:05,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:30:05,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 10:30:05,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:06,283 INFO L356 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-07-12 10:30:06,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2022-07-12 10:30:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:30:06,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:06,630 INFO L356 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2022-07-12 10:30:06,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 19 [2022-07-12 10:30:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:30:06,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894162760] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:06,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:06,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 38 [2022-07-12 10:30:06,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516563935] [2022-07-12 10:30:06,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:06,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-12 10:30:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:06,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-12 10:30:06,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2022-07-12 10:30:06,998 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 267 [2022-07-12 10:30:07,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 397 transitions, 2300 flow. Second operand has 38 states, 38 states have (on average 166.3421052631579) internal successors, (6321), 38 states have internal predecessors, (6321), 0 states have call successors, (0), 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-12 10:30:07,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:07,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 267 [2022-07-12 10:30:07,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:09,847 INFO L129 PetriNetUnfolder]: 3545/9069 cut-off events. [2022-07-12 10:30:09,847 INFO L130 PetriNetUnfolder]: For 44770/45182 co-relation queries the response was YES. [2022-07-12 10:30:09,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33138 conditions, 9069 events. 3545/9069 cut-off events. For 44770/45182 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 82087 event pairs, 1038 based on Foata normal form. 38/8509 useless extension candidates. Maximal degree in co-relation 33088. Up to 4667 conditions per place. [2022-07-12 10:30:09,976 INFO L132 encePairwiseOnDemand]: 226/267 looper letters, 317 selfloop transitions, 88 changer transitions 0/546 dead transitions. [2022-07-12 10:30:09,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 546 transitions, 4017 flow [2022-07-12 10:30:09,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-12 10:30:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-07-12 10:30:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 6015 transitions. [2022-07-12 10:30:09,985 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6257802746566792 [2022-07-12 10:30:09,986 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 6015 transitions. [2022-07-12 10:30:09,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 6015 transitions. [2022-07-12 10:30:09,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:09,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 6015 transitions. [2022-07-12 10:30:09,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 167.08333333333334) internal successors, (6015), 36 states have internal predecessors, (6015), 0 states have call successors, (0), 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-12 10:30:10,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 267.0) internal successors, (9879), 37 states have internal predecessors, (9879), 0 states have call successors, (0), 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-12 10:30:10,014 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 267.0) internal successors, (9879), 37 states have internal predecessors, (9879), 0 states have call successors, (0), 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-12 10:30:10,014 INFO L186 Difference]: Start difference. First operand has 357 places, 397 transitions, 2300 flow. Second operand 36 states and 6015 transitions. [2022-07-12 10:30:10,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 546 transitions, 4017 flow [2022-07-12 10:30:10,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 546 transitions, 3756 flow, removed 107 selfloop flow, removed 23 redundant places. [2022-07-12 10:30:10,162 INFO L242 Difference]: Finished difference. Result has 371 places, 446 transitions, 2758 flow [2022-07-12 10:30:10,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=2067, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2758, PETRI_PLACES=371, PETRI_TRANSITIONS=446} [2022-07-12 10:30:10,164 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 130 predicate places. [2022-07-12 10:30:10,164 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 446 transitions, 2758 flow [2022-07-12 10:30:10,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 166.3421052631579) internal successors, (6321), 38 states have internal predecessors, (6321), 0 states have call successors, (0), 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-12 10:30:10,166 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:10,166 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:30:10,193 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-12 10:30:10,379 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,SelfDestructingSolverStorable11 [2022-07-12 10:30:10,380 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-12 10:30:10,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:10,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2027241945, now seen corresponding path program 6 times [2022-07-12 10:30:10,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:10,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448930511] [2022-07-12 10:30:10,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:10,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 10:30:10,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:10,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448930511] [2022-07-12 10:30:10,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448930511] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:10,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465351215] [2022-07-12 10:30:10,522 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 10:30:10,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:10,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:10,524 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-12 10:30:10,555 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-12 10:30:10,722 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-12 10:30:10,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:30:10,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 10:30:10,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:11,384 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-12 10:30:11,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 10 [2022-07-12 10:30:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:30:11,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:11,617 INFO L356 Elim1Store]: treesize reduction 29, result has 43.1 percent of original size [2022-07-12 10:30:11,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 33 [2022-07-12 10:30:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 10:30:11,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465351215] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:11,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:11,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 6] total 21 [2022-07-12 10:30:11,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410741132] [2022-07-12 10:30:11,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:11,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 10:30:11,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:11,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 10:30:11,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-07-12 10:30:11,762 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 267 [2022-07-12 10:30:11,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 446 transitions, 2758 flow. Second operand has 21 states, 21 states have (on average 185.47619047619048) internal successors, (3895), 21 states have internal predecessors, (3895), 0 states have call successors, (0), 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-12 10:30:11,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:11,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 267 [2022-07-12 10:30:11,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:14,776 INFO L129 PetriNetUnfolder]: 4348/10802 cut-off events. [2022-07-12 10:30:14,776 INFO L130 PetriNetUnfolder]: For 52829/53282 co-relation queries the response was YES. [2022-07-12 10:30:14,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40734 conditions, 10802 events. 4348/10802 cut-off events. For 52829/53282 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 99477 event pairs, 866 based on Foata normal form. 213/10324 useless extension candidates. Maximal degree in co-relation 40681. Up to 2019 conditions per place. [2022-07-12 10:30:14,943 INFO L132 encePairwiseOnDemand]: 248/267 looper letters, 421 selfloop transitions, 130 changer transitions 0/713 dead transitions. [2022-07-12 10:30:14,943 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 713 transitions, 5959 flow [2022-07-12 10:30:14,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 10:30:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-07-12 10:30:14,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 6180 transitions. [2022-07-12 10:30:14,952 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7013959822948587 [2022-07-12 10:30:14,953 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 6180 transitions. [2022-07-12 10:30:14,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 6180 transitions. [2022-07-12 10:30:14,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:14,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 6180 transitions. [2022-07-12 10:30:14,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 187.27272727272728) internal successors, (6180), 33 states have internal predecessors, (6180), 0 states have call successors, (0), 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-12 10:30:14,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 267.0) internal successors, (9078), 34 states have internal predecessors, (9078), 0 states have call successors, (0), 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-12 10:30:14,979 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 267.0) internal successors, (9078), 34 states have internal predecessors, (9078), 0 states have call successors, (0), 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-12 10:30:14,979 INFO L186 Difference]: Start difference. First operand has 371 places, 446 transitions, 2758 flow. Second operand 33 states and 6180 transitions. [2022-07-12 10:30:14,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 713 transitions, 5959 flow [2022-07-12 10:30:15,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 713 transitions, 5800 flow, removed 53 selfloop flow, removed 23 redundant places. [2022-07-12 10:30:15,178 INFO L242 Difference]: Finished difference. Result has 387 places, 478 transitions, 3388 flow [2022-07-12 10:30:15,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=2592, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3388, PETRI_PLACES=387, PETRI_TRANSITIONS=478} [2022-07-12 10:30:15,179 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 146 predicate places. [2022-07-12 10:30:15,179 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 478 transitions, 3388 flow [2022-07-12 10:30:15,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 185.47619047619048) internal successors, (3895), 21 states have internal predecessors, (3895), 0 states have call successors, (0), 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-12 10:30:15,180 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:15,180 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:30:15,205 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-12 10:30:15,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:15,381 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-12 10:30:15,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:15,382 INFO L85 PathProgramCache]: Analyzing trace with hash 433707337, now seen corresponding path program 7 times [2022-07-12 10:30:15,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:15,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943642039] [2022-07-12 10:30:15,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:15,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 10:30:15,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:15,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943642039] [2022-07-12 10:30:15,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943642039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:30:15,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:30:15,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 10:30:15,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24388361] [2022-07-12 10:30:15,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:30:15,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:30:15,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:15,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:30:15,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:30:15,739 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 267 [2022-07-12 10:30:15,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 478 transitions, 3388 flow. Second operand has 12 states, 12 states have (on average 188.16666666666666) internal successors, (2258), 12 states have internal predecessors, (2258), 0 states have call successors, (0), 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-12 10:30:15,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:15,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 267 [2022-07-12 10:30:15,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:18,621 INFO L129 PetriNetUnfolder]: 5284/12798 cut-off events. [2022-07-12 10:30:18,621 INFO L130 PetriNetUnfolder]: For 89138/90061 co-relation queries the response was YES. [2022-07-12 10:30:18,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51458 conditions, 12798 events. 5284/12798 cut-off events. For 89138/90061 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 120106 event pairs, 1255 based on Foata normal form. 147/12166 useless extension candidates. Maximal degree in co-relation 51396. Up to 4472 conditions per place. [2022-07-12 10:30:18,779 INFO L132 encePairwiseOnDemand]: 242/267 looper letters, 296 selfloop transitions, 79 changer transitions 0/561 dead transitions. [2022-07-12 10:30:18,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 561 transitions, 5008 flow [2022-07-12 10:30:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:30:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-12 10:30:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3202 transitions. [2022-07-12 10:30:18,784 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7054417272526988 [2022-07-12 10:30:18,784 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3202 transitions. [2022-07-12 10:30:18,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3202 transitions. [2022-07-12 10:30:18,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:18,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3202 transitions. [2022-07-12 10:30:18,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 188.35294117647058) internal successors, (3202), 17 states have internal predecessors, (3202), 0 states have call successors, (0), 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-12 10:30:18,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 267.0) internal successors, (4806), 18 states have internal predecessors, (4806), 0 states have call successors, (0), 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-12 10:30:18,796 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 267.0) internal successors, (4806), 18 states have internal predecessors, (4806), 0 states have call successors, (0), 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-12 10:30:18,797 INFO L186 Difference]: Start difference. First operand has 387 places, 478 transitions, 3388 flow. Second operand 17 states and 3202 transitions. [2022-07-12 10:30:18,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 561 transitions, 5008 flow [2022-07-12 10:30:19,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 561 transitions, 4815 flow, removed 56 selfloop flow, removed 20 redundant places. [2022-07-12 10:30:19,265 INFO L242 Difference]: Finished difference. Result has 385 places, 504 transitions, 3777 flow [2022-07-12 10:30:19,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=3219, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3777, PETRI_PLACES=385, PETRI_TRANSITIONS=504} [2022-07-12 10:30:19,266 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 144 predicate places. [2022-07-12 10:30:19,266 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 504 transitions, 3777 flow [2022-07-12 10:30:19,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 188.16666666666666) internal successors, (2258), 12 states have internal predecessors, (2258), 0 states have call successors, (0), 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-12 10:30:19,267 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:19,267 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:30:19,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 10:30:19,268 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-12 10:30:19,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:19,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1027077285, now seen corresponding path program 8 times [2022-07-12 10:30:19,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:19,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636248312] [2022-07-12 10:30:19,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:19,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 10:30:19,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:19,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636248312] [2022-07-12 10:30:19,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636248312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:30:19,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:30:19,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 10:30:19,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545960944] [2022-07-12 10:30:19,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:30:19,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 10:30:19,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:19,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 10:30:19,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:30:19,544 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 267 [2022-07-12 10:30:19,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 504 transitions, 3777 flow. Second operand has 13 states, 13 states have (on average 185.84615384615384) internal successors, (2416), 13 states have internal predecessors, (2416), 0 states have call successors, (0), 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-12 10:30:19,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:19,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 267 [2022-07-12 10:30:19,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:23,163 INFO L129 PetriNetUnfolder]: 6385/15082 cut-off events. [2022-07-12 10:30:23,163 INFO L130 PetriNetUnfolder]: For 108609/109822 co-relation queries the response was YES. [2022-07-12 10:30:23,294 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62495 conditions, 15082 events. 6385/15082 cut-off events. For 108609/109822 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 144441 event pairs, 1169 based on Foata normal form. 254/14418 useless extension candidates. Maximal degree in co-relation 62430. Up to 4764 conditions per place. [2022-07-12 10:30:23,381 INFO L132 encePairwiseOnDemand]: 242/267 looper letters, 303 selfloop transitions, 102 changer transitions 0/590 dead transitions. [2022-07-12 10:30:23,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 590 transitions, 5525 flow [2022-07-12 10:30:23,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 10:30:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-07-12 10:30:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3348 transitions. [2022-07-12 10:30:23,386 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6966292134831461 [2022-07-12 10:30:23,386 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3348 transitions. [2022-07-12 10:30:23,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3348 transitions. [2022-07-12 10:30:23,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:23,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3348 transitions. [2022-07-12 10:30:23,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 186.0) internal successors, (3348), 18 states have internal predecessors, (3348), 0 states have call successors, (0), 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-12 10:30:23,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 267.0) internal successors, (5073), 19 states have internal predecessors, (5073), 0 states have call successors, (0), 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-12 10:30:23,396 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 267.0) internal successors, (5073), 19 states have internal predecessors, (5073), 0 states have call successors, (0), 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-12 10:30:23,396 INFO L186 Difference]: Start difference. First operand has 385 places, 504 transitions, 3777 flow. Second operand 18 states and 3348 transitions. [2022-07-12 10:30:23,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 590 transitions, 5525 flow [2022-07-12 10:30:23,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 590 transitions, 5375 flow, removed 8 selfloop flow, removed 18 redundant places. [2022-07-12 10:30:23,690 INFO L242 Difference]: Finished difference. Result has 385 places, 526 transitions, 4245 flow [2022-07-12 10:30:23,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=3629, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4245, PETRI_PLACES=385, PETRI_TRANSITIONS=526} [2022-07-12 10:30:23,691 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 144 predicate places. [2022-07-12 10:30:23,691 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 526 transitions, 4245 flow [2022-07-12 10:30:23,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 185.84615384615384) internal successors, (2416), 13 states have internal predecessors, (2416), 0 states have call successors, (0), 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-12 10:30:23,691 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:23,692 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:30:23,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 10:30:23,692 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-12 10:30:23,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:23,693 INFO L85 PathProgramCache]: Analyzing trace with hash -994685543, now seen corresponding path program 1 times [2022-07-12 10:30:23,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:23,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244561626] [2022-07-12 10:30:23,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:23,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 10:30:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:23,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244561626] [2022-07-12 10:30:23,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244561626] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:23,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043742409] [2022-07-12 10:30:23,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:23,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:23,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:23,860 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:30:23,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 10:30:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:24,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 10:30:24,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 10:30:24,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 10:30:24,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043742409] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:24,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:24,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 23 [2022-07-12 10:30:24,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164370106] [2022-07-12 10:30:24,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:24,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 10:30:24,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:24,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 10:30:24,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2022-07-12 10:30:24,963 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2022-07-12 10:30:24,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 526 transitions, 4245 flow. Second operand has 23 states, 23 states have (on average 196.69565217391303) internal successors, (4524), 23 states have internal predecessors, (4524), 0 states have call successors, (0), 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-12 10:30:24,967 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:24,967 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2022-07-12 10:30:24,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:26,084 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([889] L52-3-->L68: Formula: (let ((.cse0 (not |v_thread1_#t~short8#1_44|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (or (and (= |v_thread1_#t~mem7#1_30| |v_thread1Thread1of1ForFork2_#t~mem7#1_1|) .cse0 (= |v_thread1_#t~short8#1_43| |v_thread1_#t~short8#1_44|)) (and (let ((.cse1 (= |v_thread1_#t~mem7#1_30| 0))) (or (and .cse1 |v_thread1_#t~short8#1_43|) (and (not |v_thread1_#t~short8#1_43|) (not .cse1)))) (= |v_thread1_#t~mem7#1_30| (select (select |v_#memory_int_77| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_back~0_67)))) |v_thread1_#t~short8#1_44|)) (let ((.cse2 (< v_~q1_back~0_67 v_~n1~0_15)) (.cse3 (<= 0 v_~q1_back~0_67))) (or (and (or (not .cse2) (not .cse3)) .cse0) (and .cse2 |v_thread1_#t~short8#1_44| .cse3))) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite |v_thread1_#t~short8#1_43| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_15, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_77|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_1|} OutVars{~q1~0.offset=v_~q1~0.offset_24, ~q1_back~0=v_~q1_back~0_66, ~n1~0=v_~n1~0_15, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_77|, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_1|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[|v_thread1_#t~mem7#1_30|, |v_thread1_#t~short8#1_43|, |v_thread1_#t~short8#1_44|] AssignedVars[~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][445], [1750#(= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0), Black: 2538#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), Black: 3193#(and (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (<= ~n1~0 2)), 8420#(and (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 3182#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2345#(and (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= ~n1~0 2)), Black: 3176#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1746#true, Black: 2507#(not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 263#(or (<= ~n2~0 ~q2_front~0) (not (<= 0 ~q2_front~0)) (<= ~q2_back~0 ~q2_front~0)), Black: 1749#(= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 3188#(and (exists ((v_~q1_front~0_38 Int)) (and (<= 0 v_~q1_front~0_38) (<= (select (select |#memory_int| ~q1~0.base) (+ (* 4 v_~q1_front~0_38) ~q1~0.offset)) |thread2Thread1of1ForFork0_~j~0#1|) (= 2 (select (select |#memory_int| ~q1~0.base) (+ (* 4 v_~q1_front~0_38) ~q1~0.offset))) (<= (+ v_~q1_front~0_38 1) ~q1_back~0) (< v_~q1_front~0_38 ~n1~0))) (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (<= ~n1~0 2)), 10004#(and (<= ~n2~0 1) (<= ~q2_front~0 ~q2_back~0) (< 0 ~n2~0) (<= 1 ~q2_back~0)), 5490#(= |thread2Thread1of1ForFork0_~j~0#1| 2), Black: 275#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8481#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 290#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6676#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 2)), Black: 6275#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), 8527#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 300#(= ~r~0 0), Black: 6917#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6951#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2) (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) 2)), Black: 5472#true, Black: 5727#(<= ~n1~0 2), Black: 313#(<= ~q3_back~0 ~q3_front~0), 210#L107true, Black: 1144#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0)), 5428#(and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= ~q1~0.offset 0) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))) (<= ~n1~0 2) (< 0 (+ ~q1_front~0 1))), Black: 5397#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 325#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1721#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_#t~post40#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5412#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 321#(<= ~n1~0 0), Black: 1723#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1715#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5448#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= 1 ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (< ~q1_back~0 (+ ~n1~0 1)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (<= ~n1~0 2) (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) 2) (< 0 (+ ~q1_front~0 1))), Black: 5424#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 1717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5416#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 5399#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 183#L87true, Black: 5403#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5393#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5430#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 5420#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 5444#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 5434#(and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (= ~q1~0.offset 0) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~n1~0 2) (< 0 (+ ~q1_front~0 1))), Black: 3935#true, Black: 5395#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5367#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0))), 68#L145-1true, Black: 5414#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= 1 ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2) (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) 2)), Black: 3809#(exists ((v_~q1_front~0_39 Int)) (and (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* 4 v_~q1_front~0_39)))) (<= (+ v_~q1_front~0_39 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* 4 v_~q1_front~0_39))) |thread2Thread1of1ForFork0_~j~0#1|) (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 ~n1~0))), Black: 4748#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), 258#true, 149#L68true, 8483#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 8422#(and (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 8424#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 6970#true, Black: 8430#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 8412#(and (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 8390#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 3180#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= |ULTIMATE.start_create_fresh_int_array_#t~post40#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|))]) [2022-07-12 10:30:26,085 INFO L384 tUnfolder$Statistics]: this new event has 215 ancestors and is cut-off event [2022-07-12 10:30:26,086 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-12 10:30:26,086 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-12 10:30:26,086 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-12 10:30:26,092 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([889] L52-3-->L68: Formula: (let ((.cse0 (not |v_thread1_#t~short8#1_44|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (or (and (= |v_thread1_#t~mem7#1_30| |v_thread1Thread1of1ForFork2_#t~mem7#1_1|) .cse0 (= |v_thread1_#t~short8#1_43| |v_thread1_#t~short8#1_44|)) (and (let ((.cse1 (= |v_thread1_#t~mem7#1_30| 0))) (or (and .cse1 |v_thread1_#t~short8#1_43|) (and (not |v_thread1_#t~short8#1_43|) (not .cse1)))) (= |v_thread1_#t~mem7#1_30| (select (select |v_#memory_int_77| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_back~0_67)))) |v_thread1_#t~short8#1_44|)) (let ((.cse2 (< v_~q1_back~0_67 v_~n1~0_15)) (.cse3 (<= 0 v_~q1_back~0_67))) (or (and (or (not .cse2) (not .cse3)) .cse0) (and .cse2 |v_thread1_#t~short8#1_44| .cse3))) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite |v_thread1_#t~short8#1_43| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_15, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_77|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_1|} OutVars{~q1~0.offset=v_~q1~0.offset_24, ~q1_back~0=v_~q1_back~0_66, ~n1~0=v_~n1~0_15, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_77|, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_1|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[|v_thread1_#t~mem7#1_30|, |v_thread1_#t~short8#1_43|, |v_thread1_#t~short8#1_44|] AssignedVars[~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][446], [Black: 2538#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), 1750#(= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0), 8420#(and (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 3193#(and (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (<= ~n1~0 2)), Black: 3182#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2345#(and (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= ~n1~0 2)), Black: 3176#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1746#true, Black: 2507#(not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 263#(or (<= ~n2~0 ~q2_front~0) (not (<= 0 ~q2_front~0)) (<= ~q2_back~0 ~q2_front~0)), Black: 1749#(= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 3188#(and (exists ((v_~q1_front~0_38 Int)) (and (<= 0 v_~q1_front~0_38) (<= (select (select |#memory_int| ~q1~0.base) (+ (* 4 v_~q1_front~0_38) ~q1~0.offset)) |thread2Thread1of1ForFork0_~j~0#1|) (= 2 (select (select |#memory_int| ~q1~0.base) (+ (* 4 v_~q1_front~0_38) ~q1~0.offset))) (<= (+ v_~q1_front~0_38 1) ~q1_back~0) (< v_~q1_front~0_38 ~n1~0))) (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (<= ~n1~0 2)), 10004#(and (<= ~n2~0 1) (<= ~q2_front~0 ~q2_back~0) (< 0 ~n2~0) (<= 1 ~q2_back~0)), 5490#(= |thread2Thread1of1ForFork0_~j~0#1| 2), Black: 275#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8481#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 290#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6676#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 2)), Black: 6275#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), 8527#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 300#(= ~r~0 0), Black: 6917#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6951#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2) (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) 2)), Black: 5472#true, Black: 5727#(<= ~n1~0 2), Black: 313#(<= ~q3_back~0 ~q3_front~0), Black: 1144#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0)), 210#L107true, 5428#(and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= ~q1~0.offset 0) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))) (<= ~n1~0 2) (< 0 (+ ~q1_front~0 1))), Black: 5397#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 325#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1721#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_#t~post40#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5412#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 321#(<= ~n1~0 0), Black: 1723#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1715#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5448#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= 1 ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (< ~q1_back~0 (+ ~n1~0 1)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (<= ~n1~0 2) (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) 2) (< 0 (+ ~q1_front~0 1))), Black: 5424#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 1717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5416#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 5399#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 183#L87true, Black: 5403#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5393#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5430#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 5420#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 5444#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 5434#(and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (= ~q1~0.offset 0) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~n1~0 2) (< 0 (+ ~q1_front~0 1))), Black: 3935#true, Black: 5395#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 68#L145-1true, Black: 5367#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0))), Black: 3809#(exists ((v_~q1_front~0_39 Int)) (and (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* 4 v_~q1_front~0_39)))) (<= (+ v_~q1_front~0_39 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* 4 v_~q1_front~0_39))) |thread2Thread1of1ForFork0_~j~0#1|) (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 ~n1~0))), Black: 5414#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= 1 ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2) (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) 2)), Black: 4748#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), 258#true, 149#L68true, 8483#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 8422#(and (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 8424#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 6970#true, Black: 8430#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 8412#(and (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 8390#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 3180#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= |ULTIMATE.start_create_fresh_int_array_#t~post40#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|))]) [2022-07-12 10:30:26,093 INFO L384 tUnfolder$Statistics]: this new event has 215 ancestors and is cut-off event [2022-07-12 10:30:26,093 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-12 10:30:26,093 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-12 10:30:26,093 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-12 10:30:26,721 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([889] L52-3-->L68: Formula: (let ((.cse0 (not |v_thread1_#t~short8#1_44|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (or (and (= |v_thread1_#t~mem7#1_30| |v_thread1Thread1of1ForFork2_#t~mem7#1_1|) .cse0 (= |v_thread1_#t~short8#1_43| |v_thread1_#t~short8#1_44|)) (and (let ((.cse1 (= |v_thread1_#t~mem7#1_30| 0))) (or (and .cse1 |v_thread1_#t~short8#1_43|) (and (not |v_thread1_#t~short8#1_43|) (not .cse1)))) (= |v_thread1_#t~mem7#1_30| (select (select |v_#memory_int_77| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_back~0_67)))) |v_thread1_#t~short8#1_44|)) (let ((.cse2 (< v_~q1_back~0_67 v_~n1~0_15)) (.cse3 (<= 0 v_~q1_back~0_67))) (or (and (or (not .cse2) (not .cse3)) .cse0) (and .cse2 |v_thread1_#t~short8#1_44| .cse3))) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite |v_thread1_#t~short8#1_43| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_15, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_77|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_1|} OutVars{~q1~0.offset=v_~q1~0.offset_24, ~q1_back~0=v_~q1_back~0_66, ~n1~0=v_~n1~0_15, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_77|, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_1|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[|v_thread1_#t~mem7#1_30|, |v_thread1_#t~short8#1_43|, |v_thread1_#t~short8#1_44|] AssignedVars[~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][549], [Black: 2538#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), 1750#(= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0), 8420#(and (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 3193#(and (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (<= ~n1~0 2)), Black: 3182#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2345#(and (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= ~n1~0 2)), Black: 3176#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1746#true, Black: 2507#(not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 1749#(= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 263#(or (<= ~n2~0 ~q2_front~0) (not (<= 0 ~q2_front~0)) (<= ~q2_back~0 ~q2_front~0)), Black: 3188#(and (exists ((v_~q1_front~0_38 Int)) (and (<= 0 v_~q1_front~0_38) (<= (select (select |#memory_int| ~q1~0.base) (+ (* 4 v_~q1_front~0_38) ~q1~0.offset)) |thread2Thread1of1ForFork0_~j~0#1|) (= 2 (select (select |#memory_int| ~q1~0.base) (+ (* 4 v_~q1_front~0_38) ~q1~0.offset))) (<= (+ v_~q1_front~0_38 1) ~q1_back~0) (< v_~q1_front~0_38 ~n1~0))) (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (<= ~n1~0 2)), 5490#(= |thread2Thread1of1ForFork0_~j~0#1| 2), 8530#true, Black: 275#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8481#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 290#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6676#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 2)), Black: 6275#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), 8527#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 300#(= ~r~0 0), Black: 6917#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6951#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2) (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) 2)), Black: 5472#true, Black: 5727#(<= ~n1~0 2), Black: 313#(<= ~q3_back~0 ~q3_front~0), 210#L107true, Black: 1144#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0)), 5428#(and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= ~q1~0.offset 0) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))) (<= ~n1~0 2) (< 0 (+ ~q1_front~0 1))), Black: 5397#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 325#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1721#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_#t~post40#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5412#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 321#(<= ~n1~0 0), Black: 1723#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1715#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5448#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= 1 ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (< ~q1_back~0 (+ ~n1~0 1)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (<= ~n1~0 2) (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) 2) (< 0 (+ ~q1_front~0 1))), Black: 5424#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 1717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5416#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 5399#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 183#L87true, Black: 5403#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5393#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5430#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 5420#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 5444#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 5434#(and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (= ~q1~0.offset 0) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~n1~0 2) (< 0 (+ ~q1_front~0 1))), Black: 3935#true, Black: 5395#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 68#L145-1true, Black: 5367#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0))), Black: 5414#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= 1 ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2) (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) 2)), Black: 3809#(exists ((v_~q1_front~0_39 Int)) (and (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* 4 v_~q1_front~0_39)))) (<= (+ v_~q1_front~0_39 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* 4 v_~q1_front~0_39))) |thread2Thread1of1ForFork0_~j~0#1|) (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 ~n1~0))), Black: 4748#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), 258#true, 149#L68true, 8483#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 8422#(and (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 8424#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 6970#true, Black: 8430#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 8412#(and (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 8390#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 3180#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= |ULTIMATE.start_create_fresh_int_array_#t~post40#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|))]) [2022-07-12 10:30:26,722 INFO L384 tUnfolder$Statistics]: this new event has 217 ancestors and is cut-off event [2022-07-12 10:30:26,722 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-07-12 10:30:26,722 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-07-12 10:30:26,722 INFO L387 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-07-12 10:30:27,007 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([889] L52-3-->L68: Formula: (let ((.cse0 (not |v_thread1_#t~short8#1_44|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ 1 v_~q1_back~0_67) v_~q1_back~0_66) (or (and (= |v_thread1_#t~mem7#1_30| |v_thread1Thread1of1ForFork2_#t~mem7#1_1|) .cse0 (= |v_thread1_#t~short8#1_43| |v_thread1_#t~short8#1_44|)) (and (let ((.cse1 (= |v_thread1_#t~mem7#1_30| 0))) (or (and .cse1 |v_thread1_#t~short8#1_43|) (and (not |v_thread1_#t~short8#1_43|) (not .cse1)))) (= |v_thread1_#t~mem7#1_30| (select (select |v_#memory_int_77| v_~q1~0.base_24) (+ v_~q1~0.offset_24 (* 4 v_~q1_back~0_67)))) |v_thread1_#t~short8#1_44|)) (let ((.cse2 (< v_~q1_back~0_67 v_~n1~0_15)) (.cse3 (<= 0 v_~q1_back~0_67))) (or (and (or (not .cse2) (not .cse3)) .cse0) (and .cse2 |v_thread1_#t~short8#1_44| .cse3))) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite |v_thread1_#t~short8#1_43| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_24, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_15, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_77|, thread1Thread1of1ForFork2_#t~mem7#1=|v_thread1Thread1of1ForFork2_#t~mem7#1_1|} OutVars{~q1~0.offset=v_~q1~0.offset_24, ~q1_back~0=v_~q1_back~0_66, ~n1~0=v_~n1~0_15, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.base=v_~q1~0.base_24, #memory_int=|v_#memory_int_77|, thread1Thread1of1ForFork2_#t~post9#1=|v_thread1Thread1of1ForFork2_#t~post9#1_1|, thread1Thread1of1ForFork2_#t~short8#1=|v_thread1Thread1of1ForFork2_#t~short8#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[|v_thread1_#t~mem7#1_30|, |v_thread1_#t~short8#1_43|, |v_thread1_#t~short8#1_44|] AssignedVars[~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~mem7#1, thread1Thread1of1ForFork2_#t~post9#1, thread1Thread1of1ForFork2_#t~short8#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][548], [Black: 2538#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), 1750#(= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0), 8420#(and (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 3193#(and (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (<= ~n1~0 2)), Black: 3182#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2345#(and (<= 0 ~q1_front~0) (< ~q1_front~0 ~n1~0) (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= ~n1~0 2)), Black: 3176#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1746#true, Black: 2507#(not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 1749#(= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))), Black: 263#(or (<= ~n2~0 ~q2_front~0) (not (<= 0 ~q2_front~0)) (<= ~q2_back~0 ~q2_front~0)), Black: 3188#(and (exists ((v_~q1_front~0_38 Int)) (and (<= 0 v_~q1_front~0_38) (<= (select (select |#memory_int| ~q1~0.base) (+ (* 4 v_~q1_front~0_38) ~q1~0.offset)) |thread2Thread1of1ForFork0_~j~0#1|) (= 2 (select (select |#memory_int| ~q1~0.base) (+ (* 4 v_~q1_front~0_38) ~q1~0.offset))) (<= (+ v_~q1_front~0_38 1) ~q1_back~0) (< v_~q1_front~0_38 ~n1~0))) (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (<= ~n1~0 2)), 5490#(= |thread2Thread1of1ForFork0_~j~0#1| 2), 8530#true, Black: 275#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 8481#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 290#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 6676#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 2)), 8527#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 6275#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), Black: 300#(= ~r~0 0), Black: 6917#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 6951#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (not (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (<= 1 ~q1_back~0) (= ~q1~0.offset 0) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1)) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2) (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) 2)), Black: 5472#true, Black: 5727#(<= ~n1~0 2), Black: 313#(<= ~q3_back~0 ~q3_front~0), 210#L107true, Black: 1144#(or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_back~0)), 5428#(and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= ~q1~0.offset 0) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))) (<= ~n1~0 2) (< 0 (+ ~q1_front~0 1))), Black: 5397#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 325#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1721#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_#t~post40#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5412#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 321#(<= ~n1~0 0), Black: 1723#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1715#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5448#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= 1 ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (< ~q1_back~0 (+ ~n1~0 1)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (<= ~n1~0 2) (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) 2) (< 0 (+ ~q1_front~0 1))), Black: 5424#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 1717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 5416#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 5399#(and (= |ULTIMATE.start_main_#t~ret24#1.offset| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 183#L87true, Black: 5403#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (= ~q1~0.offset 0) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 5393#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 5430#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (<= ~n1~0 2)), Black: 5420#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 5444#(and (or (not (<= (+ ~q1_front~0 1) 0)) (<= ~q1_back~0 ~q1_front~0)) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (or (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0) (and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))))) (= ~q1~0.offset 0) (or (<= ~q1_back~0 ~q1_front~0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0)) (<= ~n1~0 2)), Black: 5434#(and (not (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)) (= ~q1~0.offset 0) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2))) (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (and (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= ~n1~0 2) (< 0 (+ ~q1_front~0 1))), Black: 3935#true, Black: 5395#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n1~0 2) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 68#L145-1true, Black: 5367#(and (or (<= (+ ~q1_back~0 1) ~q1_front~0) (< ~q1_front~0 0) (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (or (<= ~q1_back~0 ~q1_front~0) (< ~q1_front~0 0) (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (<= ~n1~0 ~q1_back~0))), Black: 5414#(and (or (<= (* ~n1~0 4) (+ (* ~q1_back~0 4) 3 ~q1~0.offset)) (= |thread2Thread1of1ForFork0_~j~0#1| 2)) (<= 1 ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) |thread2Thread1of1ForFork0_~j~0#1|) (= ~q1~0.offset 0) (= ~q1_back~0 ~q1_front~0) (< ~q1_back~0 (+ ~n1~0 1)) (<= ~n1~0 2) (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset (- 4))) 2)), Black: 3809#(exists ((v_~q1_front~0_39 Int)) (and (= 2 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* 4 v_~q1_front~0_39)))) (<= (+ v_~q1_front~0_39 1) ~q1_back~0) (<= (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* 4 v_~q1_front~0_39))) |thread2Thread1of1ForFork0_~j~0#1|) (<= 0 v_~q1_front~0_39) (< v_~q1_front~0_39 ~n1~0))), Black: 4748#(or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))), 258#true, 149#L68true, 8483#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread2Thread1of1ForFork0_~j~0#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 8422#(and (= (+ (- 2) |thread2Thread1of1ForFork0_~j~0#1|) 0) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 8424#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 6970#true, Black: 8430#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 8412#(and (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 8390#(and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (not (<= |thread2Thread1of1ForFork0_~j~0#1| 0)) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) 0)) (< 0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (not (< ~q1_back~0 ~n1~0)) (not (<= 0 ~q1_back~0))) (or (<= ~n1~0 (+ ~q1_back~0 1)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (< ~q1_back~0 0)) (<= ~n1~0 2)), Black: 3180#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= |ULTIMATE.start_create_fresh_int_array_#t~post40#1| 1) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|))]) [2022-07-12 10:30:27,008 INFO L384 tUnfolder$Statistics]: this new event has 217 ancestors and is not cut-off event [2022-07-12 10:30:27,008 INFO L387 tUnfolder$Statistics]: existing Event has 222 ancestors and is not cut-off event [2022-07-12 10:30:27,008 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is not cut-off event [2022-07-12 10:30:27,008 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is not cut-off event [2022-07-12 10:30:29,546 INFO L129 PetriNetUnfolder]: 7817/20848 cut-off events. [2022-07-12 10:30:29,547 INFO L130 PetriNetUnfolder]: For 138084/140125 co-relation queries the response was YES. [2022-07-12 10:30:29,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83816 conditions, 20848 events. 7817/20848 cut-off events. For 138084/140125 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 225032 event pairs, 2113 based on Foata normal form. 274/19113 useless extension candidates. Maximal degree in co-relation 83754. Up to 5657 conditions per place. [2022-07-12 10:30:30,061 INFO L132 encePairwiseOnDemand]: 247/267 looper letters, 249 selfloop transitions, 44 changer transitions 208/748 dead transitions. [2022-07-12 10:30:30,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 748 transitions, 7770 flow [2022-07-12 10:30:30,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 10:30:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-07-12 10:30:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3945 transitions. [2022-07-12 10:30:30,067 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7387640449438202 [2022-07-12 10:30:30,067 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3945 transitions. [2022-07-12 10:30:30,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3945 transitions. [2022-07-12 10:30:30,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:30,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3945 transitions. [2022-07-12 10:30:30,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 197.25) internal successors, (3945), 20 states have internal predecessors, (3945), 0 states have call successors, (0), 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-12 10:30:30,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 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-12 10:30:30,082 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 267.0) internal successors, (5607), 21 states have internal predecessors, (5607), 0 states have call successors, (0), 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-12 10:30:30,082 INFO L186 Difference]: Start difference. First operand has 385 places, 526 transitions, 4245 flow. Second operand 20 states and 3945 transitions. [2022-07-12 10:30:30,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 748 transitions, 7770 flow [2022-07-12 10:30:30,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 748 transitions, 7552 flow, removed 4 selfloop flow, removed 15 redundant places. [2022-07-12 10:30:30,438 INFO L242 Difference]: Finished difference. Result has 395 places, 532 transitions, 4282 flow [2022-07-12 10:30:30,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=4117, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4282, PETRI_PLACES=395, PETRI_TRANSITIONS=532} [2022-07-12 10:30:30,439 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 154 predicate places. [2022-07-12 10:30:30,439 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 532 transitions, 4282 flow [2022-07-12 10:30:30,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 196.69565217391303) internal successors, (4524), 23 states have internal predecessors, (4524), 0 states have call successors, (0), 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-12 10:30:30,440 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:30,440 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:30:30,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 10:30:30,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:30,641 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-12 10:30:30,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:30,641 INFO L85 PathProgramCache]: Analyzing trace with hash 901136769, now seen corresponding path program 2 times [2022-07-12 10:30:30,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:30,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251522984] [2022-07-12 10:30:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:30,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 10:30:31,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:31,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251522984] [2022-07-12 10:30:31,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251522984] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:31,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498604716] [2022-07-12 10:30:31,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:30:31,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:31,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:31,378 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:30:31,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 10:30:31,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:30:31,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:30:31,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-12 10:30:31,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:33,603 INFO L356 Elim1Store]: treesize reduction 70, result has 37.5 percent of original size [2022-07-12 10:30:33,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 56 [2022-07-12 10:30:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:30:33,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:34,393 INFO L356 Elim1Store]: treesize reduction 44, result has 75.4 percent of original size [2022-07-12 10:30:34,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 152 [2022-07-12 10:30:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:30:36,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498604716] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:36,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:36,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 26] total 70 [2022-07-12 10:30:36,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681613253] [2022-07-12 10:30:36,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:36,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-12 10:30:36,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:36,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-12 10:30:36,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=4296, Unknown=0, NotChecked=0, Total=4830 [2022-07-12 10:30:36,298 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 267 [2022-07-12 10:30:36,305 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 532 transitions, 4282 flow. Second operand has 70 states, 70 states have (on average 153.22857142857143) internal successors, (10726), 70 states have internal predecessors, (10726), 0 states have call successors, (0), 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-12 10:30:36,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:36,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 267 [2022-07-12 10:30:36,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:50,675 INFO L129 PetriNetUnfolder]: 22455/46179 cut-off events. [2022-07-12 10:30:50,676 INFO L130 PetriNetUnfolder]: For 357419/360785 co-relation queries the response was YES. [2022-07-12 10:30:51,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 197140 conditions, 46179 events. 22455/46179 cut-off events. For 357419/360785 co-relation queries the response was YES. Maximal size of possible extension queue 1856. Compared 479826 event pairs, 5225 based on Foata normal form. 299/42896 useless extension candidates. Maximal degree in co-relation 197072. Up to 22668 conditions per place. [2022-07-12 10:30:51,784 INFO L132 encePairwiseOnDemand]: 213/267 looper letters, 843 selfloop transitions, 578 changer transitions 0/1551 dead transitions. [2022-07-12 10:30:51,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 1551 transitions, 17407 flow [2022-07-12 10:30:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-07-12 10:30:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2022-07-12 10:30:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 16646 transitions. [2022-07-12 10:30:51,803 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.577264530448051 [2022-07-12 10:30:51,803 INFO L72 ComplementDD]: Start complementDD. Operand 108 states and 16646 transitions. [2022-07-12 10:30:51,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 16646 transitions. [2022-07-12 10:30:51,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:51,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 108 states and 16646 transitions. [2022-07-12 10:30:51,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 109 states, 108 states have (on average 154.12962962962962) internal successors, (16646), 108 states have internal predecessors, (16646), 0 states have call successors, (0), 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-12 10:30:51,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 109 states, 109 states have (on average 267.0) internal successors, (29103), 109 states have internal predecessors, (29103), 0 states have call successors, (0), 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-12 10:30:52,001 INFO L81 ComplementDD]: Finished complementDD. Result has 109 states, 109 states have (on average 267.0) internal successors, (29103), 109 states have internal predecessors, (29103), 0 states have call successors, (0), 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-12 10:30:52,001 INFO L186 Difference]: Start difference. First operand has 395 places, 532 transitions, 4282 flow. Second operand 108 states and 16646 transitions. [2022-07-12 10:30:52,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 1551 transitions, 17407 flow [2022-07-12 10:30:53,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 1551 transitions, 17189 flow, removed 47 selfloop flow, removed 8 redundant places. [2022-07-12 10:30:53,147 INFO L242 Difference]: Finished difference. Result has 531 places, 1073 transitions, 12633 flow [2022-07-12 10:30:53,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=4189, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=108, PETRI_FLOW=12633, PETRI_PLACES=531, PETRI_TRANSITIONS=1073} [2022-07-12 10:30:53,148 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 290 predicate places. [2022-07-12 10:30:53,148 INFO L495 AbstractCegarLoop]: Abstraction has has 531 places, 1073 transitions, 12633 flow [2022-07-12 10:30:53,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 153.22857142857143) internal successors, (10726), 70 states have internal predecessors, (10726), 0 states have call successors, (0), 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-12 10:30:53,150 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:53,150 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 10:30:53,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 10:30:53,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 10:30:53,354 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:30:53,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:53,356 INFO L85 PathProgramCache]: Analyzing trace with hash 961897749, now seen corresponding path program 3 times [2022-07-12 10:30:53,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:53,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059739592] [2022-07-12 10:30:53,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:53,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:30:56,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:56,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059739592] [2022-07-12 10:30:56,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059739592] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:56,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035796085] [2022-07-12 10:30:56,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:30:56,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:56,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:56,336 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:30:56,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 10:30:56,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 10:30:56,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:30:56,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-12 10:30:56,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:57,813 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:30:57,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2022-07-12 10:30:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 10:30:57,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:58,375 INFO L356 Elim1Store]: treesize reduction 12, result has 89.0 percent of original size [2022-07-12 10:30:58,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 110 [2022-07-12 10:30:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-12 10:30:58,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035796085] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:58,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:58,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 22, 9] total 79 [2022-07-12 10:30:58,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946893208] [2022-07-12 10:30:58,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:58,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-07-12 10:30:58,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:58,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-07-12 10:30:58,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=5834, Unknown=0, NotChecked=0, Total=6162 [2022-07-12 10:30:58,817 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 267 [2022-07-12 10:30:58,822 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 1073 transitions, 12633 flow. Second operand has 79 states, 79 states have (on average 105.75949367088607) internal successors, (8355), 79 states have internal predecessors, (8355), 0 states have call successors, (0), 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-12 10:30:58,822 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:58,822 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 267 [2022-07-12 10:30:58,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand