./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 f4b24e32 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-?-f4b24e3 [2022-07-13 22:10:03,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:10:03,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:10:03,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:10:03,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:10:03,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:10:03,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:10:03,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:10:03,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:10:03,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:10:03,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:10:03,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:10:03,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:10:03,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:10:03,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:10:03,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:10:03,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:10:03,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:10:03,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:10:03,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:10:03,826 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:10:03,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:10:03,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:10:03,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:10:03,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:10:03,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:10:03,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:10:03,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:10:03,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:10:03,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:10:03,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:10:03,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:10:03,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:10:03,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:10:03,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:10:03,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:10:03,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:10:03,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:10:03,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:10:03,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:10:03,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:10:03,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:10:03,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 22:10:03,881 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:10:03,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:10:03,885 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:10:03,885 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:10:03,886 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:10:03,886 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:10:03,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:10:03,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:10:03,887 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:10:03,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:10:03,889 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 22:10:03,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:10:03,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 22:10:03,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:10:03,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:10:03,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:10:03,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:10:03,890 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 22:10:03,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:10:03,892 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:10:03,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:10:03,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:10:03,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:10:03,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:10:03,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:10:03,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:10:03,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:10:03,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:10:03,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:10:03,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:10:03,894 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:10:03,894 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:10:03,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:10:03,895 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-13 22:10:04,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:10:04,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:10:04,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:10:04,159 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:10:04,159 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:10:04,161 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-13 22:10:04,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3162920a/8344adafa40e46559ac1898f1edf09b0/FLAG9c1df8b31 [2022-07-13 22:10:04,581 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:10:04,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c [2022-07-13 22:10:04,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3162920a/8344adafa40e46559ac1898f1edf09b0/FLAG9c1df8b31 [2022-07-13 22:10:04,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3162920a/8344adafa40e46559ac1898f1edf09b0 [2022-07-13 22:10:04,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:10:04,603 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:10:04,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:10:04,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:10:04,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:10:04,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:10:04" (1/1) ... [2022-07-13 22:10:04,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@244b26b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:10:04, skipping insertion in model container [2022-07-13 22:10:04,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:10:04" (1/1) ... [2022-07-13 22:10:04,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:10:04,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:10:04,890 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-13 22:10:04,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:10:04,916 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:10:04,951 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-13 22:10:04,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:10:04,972 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:10:04,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:10:04 WrapperNode [2022-07-13 22:10:04,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:10:04,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:10:04,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:10:04,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:10:04,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:10:04" (1/1) ... [2022-07-13 22:10:05,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:10:04" (1/1) ... [2022-07-13 22:10:05,031 INFO L137 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 315 [2022-07-13 22:10:05,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:10:05,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:10:05,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:10:05,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:10:05,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:10:04" (1/1) ... [2022-07-13 22:10:05,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:10:04" (1/1) ... [2022-07-13 22:10:05,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:10:04" (1/1) ... [2022-07-13 22:10:05,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:10:04" (1/1) ... [2022-07-13 22:10:05,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:10:04" (1/1) ... [2022-07-13 22:10:05,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:10:04" (1/1) ... [2022-07-13 22:10:05,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:10:04" (1/1) ... [2022-07-13 22:10:05,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:10:05,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:10:05,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:10:05,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:10:05,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:10:04" (1/1) ... [2022-07-13 22:10:05,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:10:05,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:10:05,094 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-13 22:10:05,097 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-13 22:10:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:10:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:10:05,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:10:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:10:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-13 22:10:05,125 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-13 22:10:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-13 22:10:05,125 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-13 22:10:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-13 22:10:05,125 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-13 22:10:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:10:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 22:10:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 22:10:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:10:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:10:05,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:10:05,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:10:05,127 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 22:10:05,206 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:10:05,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:10:05,647 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:10:05,816 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:10:05,819 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-13 22:10:05,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:10:05 BoogieIcfgContainer [2022-07-13 22:10:05,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:10:05,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:10:05,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:10:05,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:10:05,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:10:04" (1/3) ... [2022-07-13 22:10:05,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2183fe1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:10:05, skipping insertion in model container [2022-07-13 22:10:05,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:10:04" (2/3) ... [2022-07-13 22:10:05,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2183fe1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:10:05, skipping insertion in model container [2022-07-13 22:10:05,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:10:05" (3/3) ... [2022-07-13 22:10:05,834 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2022-07-13 22:10:05,837 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 22:10:05,846 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:10:05,846 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:10:05,846 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 22:10:05,917 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-13 22:10:05,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 255 places, 267 transitions, 558 flow [2022-07-13 22:10:06,102 INFO L129 PetriNetUnfolder]: 22/264 cut-off events. [2022-07-13 22:10:06,106 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-13 22:10:06,124 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-13 22:10:06,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 267 transitions, 558 flow [2022-07-13 22:10:06,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 253 transitions, 524 flow [2022-07-13 22:10:06,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:10:06,176 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@61546241, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@54e8c0fc [2022-07-13 22:10:06,176 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-13 22:10:06,237 INFO L129 PetriNetUnfolder]: 22/252 cut-off events. [2022-07-13 22:10:06,238 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-13 22:10:06,238 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:06,239 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-13 22:10:06,240 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-13 22:10:06,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1135636700, now seen corresponding path program 1 times [2022-07-13 22:10:06,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:06,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069056952] [2022-07-13 22:10:06,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:06,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:06,553 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-13 22:10:06,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:06,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069056952] [2022-07-13 22:10:06,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069056952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:10:06,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:10:06,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:10:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702392495] [2022-07-13 22:10:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:10:06,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:10:06,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:06,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:10:06,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:10:06,604 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 267 [2022-07-13 22:10:06,610 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-13 22:10:06,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:06,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 267 [2022-07-13 22:10:06,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:06,779 INFO L129 PetriNetUnfolder]: 137/624 cut-off events. [2022-07-13 22:10:06,779 INFO L130 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-07-13 22:10:06,784 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-13 22:10:06,788 INFO L132 encePairwiseOnDemand]: 251/267 looper letters, 13 selfloop transitions, 0 changer transitions 8/237 dead transitions. [2022-07-13 22:10:06,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 237 transitions, 518 flow [2022-07-13 22:10:06,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:10:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-13 22:10:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 503 transitions. [2022-07-13 22:10:06,808 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9419475655430711 [2022-07-13 22:10:06,809 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 503 transitions. [2022-07-13 22:10:06,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 503 transitions. [2022-07-13 22:10:06,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:06,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 503 transitions. [2022-07-13 22:10:06,819 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-13 22:10:06,825 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-13 22:10:06,826 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-13 22:10:06,828 INFO L186 Difference]: Start difference. First operand has 241 places, 253 transitions, 524 flow. Second operand 2 states and 503 transitions. [2022-07-13 22:10:06,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 237 transitions, 518 flow [2022-07-13 22:10:06,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 237 transitions, 506 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-13 22:10:06,839 INFO L242 Difference]: Finished difference. Result has 236 places, 229 transitions, 464 flow [2022-07-13 22:10:06,841 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-13 22:10:06,845 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, -5 predicate places. [2022-07-13 22:10:06,845 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 229 transitions, 464 flow [2022-07-13 22:10:06,846 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-13 22:10:06,846 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:06,846 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-13 22:10:06,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:10:06,847 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-13 22:10:06,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1907627099, now seen corresponding path program 1 times [2022-07-13 22:10:06,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:06,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157638941] [2022-07-13 22:10:06,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:06,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:07,095 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-13 22:10:07,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:07,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157638941] [2022-07-13 22:10:07,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157638941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:10:07,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:10:07,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 22:10:07,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532857183] [2022-07-13 22:10:07,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:10:07,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:10:07,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:07,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:10:07,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:10:07,106 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 267 [2022-07-13 22:10:07,110 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-13 22:10:07,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:07,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 267 [2022-07-13 22:10:07,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:07,252 INFO L129 PetriNetUnfolder]: 125/535 cut-off events. [2022-07-13 22:10:07,253 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-07-13 22:10:07,254 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-13 22:10:07,257 INFO L132 encePairwiseOnDemand]: 262/267 looper letters, 23 selfloop transitions, 4 changer transitions 0/236 dead transitions. [2022-07-13 22:10:07,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 236 transitions, 534 flow [2022-07-13 22:10:07,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:10:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 22:10:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2022-07-13 22:10:07,259 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8963795255930087 [2022-07-13 22:10:07,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 718 transitions. [2022-07-13 22:10:07,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 718 transitions. [2022-07-13 22:10:07,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:07,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 718 transitions. [2022-07-13 22:10:07,262 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-13 22:10:07,265 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-13 22:10:07,265 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-13 22:10:07,266 INFO L186 Difference]: Start difference. First operand has 236 places, 229 transitions, 464 flow. Second operand 3 states and 718 transitions. [2022-07-13 22:10:07,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 236 transitions, 534 flow [2022-07-13 22:10:07,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 236 transitions, 534 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 22:10:07,271 INFO L242 Difference]: Finished difference. Result has 231 places, 230 transitions, 482 flow [2022-07-13 22:10:07,272 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-13 22:10:07,273 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, -10 predicate places. [2022-07-13 22:10:07,273 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 230 transitions, 482 flow [2022-07-13 22:10:07,274 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-13 22:10:07,274 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:07,274 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-13 22:10:07,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:10:07,275 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-13 22:10:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash 942137239, now seen corresponding path program 2 times [2022-07-13 22:10:07,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:07,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635424788] [2022-07-13 22:10:07,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:07,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:07,483 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-13 22:10:07,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:07,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635424788] [2022-07-13 22:10:07,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635424788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:10:07,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:10:07,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:10:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632655966] [2022-07-13 22:10:07,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:10:07,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:10:07,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:07,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:10:07,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:10:07,489 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 267 [2022-07-13 22:10:07,491 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-13 22:10:07,491 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:07,491 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 267 [2022-07-13 22:10:07,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:07,752 INFO L129 PetriNetUnfolder]: 175/737 cut-off events. [2022-07-13 22:10:07,752 INFO L130 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-07-13 22:10:07,754 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-13 22:10:07,758 INFO L132 encePairwiseOnDemand]: 258/267 looper letters, 50 selfloop transitions, 6 changer transitions 12/246 dead transitions. [2022-07-13 22:10:07,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 246 transitions, 662 flow [2022-07-13 22:10:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:10:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 22:10:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1461 transitions. [2022-07-13 22:10:07,763 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7817014446227929 [2022-07-13 22:10:07,763 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1461 transitions. [2022-07-13 22:10:07,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1461 transitions. [2022-07-13 22:10:07,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:07,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1461 transitions. [2022-07-13 22:10:07,768 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-13 22:10:07,771 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-13 22:10:07,772 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-13 22:10:07,772 INFO L186 Difference]: Start difference. First operand has 231 places, 230 transitions, 482 flow. Second operand 7 states and 1461 transitions. [2022-07-13 22:10:07,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 246 transitions, 662 flow [2022-07-13 22:10:07,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 246 transitions, 657 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 22:10:07,779 INFO L242 Difference]: Finished difference. Result has 238 places, 231 transitions, 502 flow [2022-07-13 22:10:07,780 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-13 22:10:07,782 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, -3 predicate places. [2022-07-13 22:10:07,782 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 231 transitions, 502 flow [2022-07-13 22:10:07,783 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-13 22:10:07,783 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:07,783 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-13 22:10:07,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 22:10:07,784 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-13 22:10:07,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:07,785 INFO L85 PathProgramCache]: Analyzing trace with hash 664355121, now seen corresponding path program 1 times [2022-07-13 22:10:07,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:07,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600098137] [2022-07-13 22:10:07,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:07,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:07,986 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-13 22:10:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:07,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600098137] [2022-07-13 22:10:07,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600098137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:10:07,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:10:07,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:10:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837438304] [2022-07-13 22:10:07,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:10:07,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:10:07,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:07,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:10:07,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:10:07,991 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 267 [2022-07-13 22:10:07,993 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-13 22:10:07,993 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:07,993 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 267 [2022-07-13 22:10:07,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:08,201 INFO L129 PetriNetUnfolder]: 152/717 cut-off events. [2022-07-13 22:10:08,201 INFO L130 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-07-13 22:10:08,203 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-13 22:10:08,206 INFO L132 encePairwiseOnDemand]: 257/267 looper letters, 49 selfloop transitions, 8 changer transitions 22/257 dead transitions. [2022-07-13 22:10:08,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 257 transitions, 732 flow [2022-07-13 22:10:08,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:10:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 22:10:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1868 transitions. [2022-07-13 22:10:08,210 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7773616312942155 [2022-07-13 22:10:08,211 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1868 transitions. [2022-07-13 22:10:08,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1868 transitions. [2022-07-13 22:10:08,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:08,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1868 transitions. [2022-07-13 22:10:08,240 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-13 22:10:08,244 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-13 22:10:08,245 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-13 22:10:08,245 INFO L186 Difference]: Start difference. First operand has 238 places, 231 transitions, 502 flow. Second operand 9 states and 1868 transitions. [2022-07-13 22:10:08,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 257 transitions, 732 flow [2022-07-13 22:10:08,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 257 transitions, 716 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-13 22:10:08,252 INFO L242 Difference]: Finished difference. Result has 243 places, 232 transitions, 520 flow [2022-07-13 22:10:08,254 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-13 22:10:08,255 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 2 predicate places. [2022-07-13 22:10:08,255 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 232 transitions, 520 flow [2022-07-13 22:10:08,257 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-13 22:10:08,257 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:08,257 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-13 22:10:08,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:10:08,258 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-13 22:10:08,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:08,258 INFO L85 PathProgramCache]: Analyzing trace with hash -587875451, now seen corresponding path program 1 times [2022-07-13 22:10:08,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:08,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734812687] [2022-07-13 22:10:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:08,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:08,382 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-13 22:10:08,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:08,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734812687] [2022-07-13 22:10:08,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734812687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:10:08,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:10:08,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:10:08,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870006347] [2022-07-13 22:10:08,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:10:08,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:10:08,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:08,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:10:08,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:10:08,386 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 267 [2022-07-13 22:10:08,387 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-13 22:10:08,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:08,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 267 [2022-07-13 22:10:08,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:08,594 INFO L129 PetriNetUnfolder]: 245/870 cut-off events. [2022-07-13 22:10:08,595 INFO L130 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-07-13 22:10:08,597 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-13 22:10:08,600 INFO L132 encePairwiseOnDemand]: 262/267 looper letters, 57 selfloop transitions, 2 changer transitions 7/249 dead transitions. [2022-07-13 22:10:08,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 249 transitions, 703 flow [2022-07-13 22:10:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:10:08,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-13 22:10:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1035 transitions. [2022-07-13 22:10:08,604 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7752808988764045 [2022-07-13 22:10:08,604 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1035 transitions. [2022-07-13 22:10:08,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1035 transitions. [2022-07-13 22:10:08,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:08,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1035 transitions. [2022-07-13 22:10:08,607 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-13 22:10:08,609 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-13 22:10:08,610 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-13 22:10:08,610 INFO L186 Difference]: Start difference. First operand has 243 places, 232 transitions, 520 flow. Second operand 5 states and 1035 transitions. [2022-07-13 22:10:08,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 249 transitions, 703 flow [2022-07-13 22:10:08,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 249 transitions, 683 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-07-13 22:10:08,616 INFO L242 Difference]: Finished difference. Result has 242 places, 233 transitions, 518 flow [2022-07-13 22:10:08,617 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-13 22:10:08,617 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 1 predicate places. [2022-07-13 22:10:08,618 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 233 transitions, 518 flow [2022-07-13 22:10:08,618 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-13 22:10:08,618 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:08,619 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-13 22:10:08,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:10:08,619 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-13 22:10:08,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1791728807, now seen corresponding path program 1 times [2022-07-13 22:10:08,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:08,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873377787] [2022-07-13 22:10:08,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:08,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:08,759 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-13 22:10:08,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:08,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873377787] [2022-07-13 22:10:08,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873377787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:10:08,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:10:08,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 22:10:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925591340] [2022-07-13 22:10:08,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:10:08,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:10:08,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:08,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:10:08,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:10:08,764 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 267 [2022-07-13 22:10:08,764 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-13 22:10:08,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:08,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 267 [2022-07-13 22:10:08,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:08,910 INFO L129 PetriNetUnfolder]: 138/580 cut-off events. [2022-07-13 22:10:08,910 INFO L130 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-07-13 22:10:08,911 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-13 22:10:08,913 INFO L132 encePairwiseOnDemand]: 264/267 looper letters, 21 selfloop transitions, 2 changer transitions 3/241 dead transitions. [2022-07-13 22:10:08,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 241 transitions, 594 flow [2022-07-13 22:10:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:10:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 22:10:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2022-07-13 22:10:08,916 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9051186017478152 [2022-07-13 22:10:08,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 725 transitions. [2022-07-13 22:10:08,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 725 transitions. [2022-07-13 22:10:08,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:08,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 725 transitions. [2022-07-13 22:10:08,919 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-13 22:10:08,921 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-13 22:10:08,921 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-13 22:10:08,921 INFO L186 Difference]: Start difference. First operand has 242 places, 233 transitions, 518 flow. Second operand 3 states and 725 transitions. [2022-07-13 22:10:08,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 241 transitions, 594 flow [2022-07-13 22:10:08,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 241 transitions, 588 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-13 22:10:08,928 INFO L242 Difference]: Finished difference. Result has 240 places, 234 transitions, 526 flow [2022-07-13 22:10:08,929 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-13 22:10:08,931 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, -1 predicate places. [2022-07-13 22:10:08,932 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 234 transitions, 526 flow [2022-07-13 22:10:08,932 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-13 22:10:08,932 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:08,932 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-13 22:10:08,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 22:10:08,933 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-13 22:10:08,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:08,934 INFO L85 PathProgramCache]: Analyzing trace with hash 554337119, now seen corresponding path program 2 times [2022-07-13 22:10:08,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:08,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731699335] [2022-07-13 22:10:08,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:08,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:09,100 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-13 22:10:09,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:09,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731699335] [2022-07-13 22:10:09,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731699335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:10:09,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:10:09,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:10:09,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836692274] [2022-07-13 22:10:09,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:10:09,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:10:09,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:09,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:10:09,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:10:09,108 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 267 [2022-07-13 22:10:09,110 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-13 22:10:09,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:09,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 267 [2022-07-13 22:10:09,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:09,316 INFO L129 PetriNetUnfolder]: 140/720 cut-off events. [2022-07-13 22:10:09,316 INFO L130 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-07-13 22:10:09,318 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-13 22:10:09,321 INFO L132 encePairwiseOnDemand]: 255/267 looper letters, 51 selfloop transitions, 8 changer transitions 30/268 dead transitions. [2022-07-13 22:10:09,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 268 transitions, 791 flow [2022-07-13 22:10:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:10:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 22:10:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1877 transitions. [2022-07-13 22:10:09,326 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7811069496462755 [2022-07-13 22:10:09,326 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1877 transitions. [2022-07-13 22:10:09,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1877 transitions. [2022-07-13 22:10:09,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:09,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1877 transitions. [2022-07-13 22:10:09,331 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-13 22:10:09,335 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-13 22:10:09,336 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-13 22:10:09,336 INFO L186 Difference]: Start difference. First operand has 240 places, 234 transitions, 526 flow. Second operand 9 states and 1877 transitions. [2022-07-13 22:10:09,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 268 transitions, 791 flow [2022-07-13 22:10:09,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 268 transitions, 783 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-07-13 22:10:09,364 INFO L242 Difference]: Finished difference. Result has 248 places, 235 transitions, 550 flow [2022-07-13 22:10:09,364 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-13 22:10:09,365 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 7 predicate places. [2022-07-13 22:10:09,365 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 235 transitions, 550 flow [2022-07-13 22:10:09,366 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-13 22:10:09,366 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:09,366 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-13 22:10:09,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:10:09,366 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-13 22:10:09,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash 224907029, now seen corresponding path program 1 times [2022-07-13 22:10:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:09,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145826327] [2022-07-13 22:10:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:09,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:09,587 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-13 22:10:09,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:09,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145826327] [2022-07-13 22:10:09,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145826327] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:10:09,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665742235] [2022-07-13 22:10:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:09,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:10:09,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:10:09,592 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-13 22:10:09,596 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-13 22:10:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:09,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 22:10:09,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:10:10,219 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-13 22:10:10,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:10:10,255 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-13 22:10:10,750 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-13 22:10:10,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665742235] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:10:10,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:10:10,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 23 [2022-07-13 22:10:10,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676052820] [2022-07-13 22:10:10,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:10:10,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 22:10:10,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:10,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 22:10:10,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2022-07-13 22:10:10,758 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2022-07-13 22:10:10,763 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-13 22:10:10,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:10,763 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2022-07-13 22:10:10,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:11,351 INFO L129 PetriNetUnfolder]: 189/977 cut-off events. [2022-07-13 22:10:11,351 INFO L130 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2022-07-13 22:10:11,354 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-13 22:10:11,357 INFO L132 encePairwiseOnDemand]: 246/267 looper letters, 52 selfloop transitions, 22 changer transitions 61/307 dead transitions. [2022-07-13 22:10:11,357 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 307 transitions, 1041 flow [2022-07-13 22:10:11,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 22:10:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-13 22:10:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4161 transitions. [2022-07-13 22:10:11,366 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7421080791867308 [2022-07-13 22:10:11,366 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4161 transitions. [2022-07-13 22:10:11,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4161 transitions. [2022-07-13 22:10:11,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:11,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4161 transitions. [2022-07-13 22:10:11,377 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-13 22:10:11,387 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-13 22:10:11,389 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-13 22:10:11,389 INFO L186 Difference]: Start difference. First operand has 248 places, 235 transitions, 550 flow. Second operand 21 states and 4161 transitions. [2022-07-13 22:10:11,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 307 transitions, 1041 flow [2022-07-13 22:10:11,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 307 transitions, 1023 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-13 22:10:11,396 INFO L242 Difference]: Finished difference. Result has 270 places, 240 transitions, 640 flow [2022-07-13 22:10:11,397 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-13 22:10:11,398 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 29 predicate places. [2022-07-13 22:10:11,398 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 240 transitions, 640 flow [2022-07-13 22:10:11,400 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-13 22:10:11,400 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:11,401 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-13 22:10:11,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 22:10:11,624 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-13 22:10:11,625 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-13 22:10:11,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:11,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1808705183, now seen corresponding path program 2 times [2022-07-13 22:10:11,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:11,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796000881] [2022-07-13 22:10:11,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:11,777 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-13 22:10:11,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:11,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796000881] [2022-07-13 22:10:11,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796000881] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:10:11,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84265398] [2022-07-13 22:10:11,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:10:11,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:10:11,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:10:11,779 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-13 22:10:11,781 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-13 22:10:11,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:10:11,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:10:11,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 22:10:11,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:10:12,587 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-13 22:10:12,589 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-13 22:10:12,610 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-13 22:10:12,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:10:12,823 INFO L356 Elim1Store]: treesize reduction 42, result has 14.3 percent of original size [2022-07-13 22:10:12,823 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-13 22:10:13,121 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-13 22:10:13,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84265398] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:10:13,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:10:13,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 6] total 21 [2022-07-13 22:10:13,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634824128] [2022-07-13 22:10:13,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:10:13,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 22:10:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:13,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 22:10:13,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:10:13,131 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 267 [2022-07-13 22:10:13,141 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-13 22:10:13,141 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:13,141 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 267 [2022-07-13 22:10:13,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:13,998 INFO L129 PetriNetUnfolder]: 812/2158 cut-off events. [2022-07-13 22:10:13,999 INFO L130 PetriNetUnfolder]: For 3360/3469 co-relation queries the response was YES. [2022-07-13 22:10:14,007 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-13 22:10:14,019 INFO L132 encePairwiseOnDemand]: 240/267 looper letters, 164 selfloop transitions, 69 changer transitions 0/391 dead transitions. [2022-07-13 22:10:14,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 391 transitions, 1699 flow [2022-07-13 22:10:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-13 22:10:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-07-13 22:10:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5385 transitions. [2022-07-13 22:10:14,033 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6954668733049205 [2022-07-13 22:10:14,033 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5385 transitions. [2022-07-13 22:10:14,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5385 transitions. [2022-07-13 22:10:14,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:14,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5385 transitions. [2022-07-13 22:10:14,047 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-13 22:10:14,060 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-13 22:10:14,061 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-13 22:10:14,061 INFO L186 Difference]: Start difference. First operand has 270 places, 240 transitions, 640 flow. Second operand 29 states and 5385 transitions. [2022-07-13 22:10:14,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 391 transitions, 1699 flow [2022-07-13 22:10:14,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 391 transitions, 1544 flow, removed 56 selfloop flow, removed 10 redundant places. [2022-07-13 22:10:14,077 INFO L242 Difference]: Finished difference. Result has 292 places, 304 transitions, 1137 flow [2022-07-13 22:10:14,077 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-13 22:10:14,078 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 51 predicate places. [2022-07-13 22:10:14,078 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 304 transitions, 1137 flow [2022-07-13 22:10:14,080 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-13 22:10:14,080 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:14,080 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-13 22:10:14,104 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-13 22:10:14,299 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-13 22:10:14,300 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-13 22:10:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash -202299379, now seen corresponding path program 3 times [2022-07-13 22:10:14,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:14,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560700218] [2022-07-13 22:10:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:14,829 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-13 22:10:14,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:14,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560700218] [2022-07-13 22:10:14,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560700218] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:10:14,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549748988] [2022-07-13 22:10:14,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 22:10:14,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:10:14,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:10:14,831 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-13 22:10:14,832 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-13 22:10:15,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-13 22:10:15,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:10:15,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:10:15,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:10:15,332 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-13 22:10:15,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:10:15,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549748988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:10:15,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:10:15,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 23 [2022-07-13 22:10:15,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526943610] [2022-07-13 22:10:15,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:10:15,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:10:15,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:15,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:10:15,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2022-07-13 22:10:15,337 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 267 [2022-07-13 22:10:15,338 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-13 22:10:15,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:15,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 267 [2022-07-13 22:10:15,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:15,802 INFO L129 PetriNetUnfolder]: 812/2205 cut-off events. [2022-07-13 22:10:15,803 INFO L130 PetriNetUnfolder]: For 4581/4636 co-relation queries the response was YES. [2022-07-13 22:10:15,813 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-13 22:10:15,826 INFO L132 encePairwiseOnDemand]: 258/267 looper letters, 107 selfloop transitions, 17 changer transitions 0/330 dead transitions. [2022-07-13 22:10:15,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 330 transitions, 1531 flow [2022-07-13 22:10:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:10:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-13 22:10:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1124 transitions. [2022-07-13 22:10:15,830 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8419475655430712 [2022-07-13 22:10:15,830 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1124 transitions. [2022-07-13 22:10:15,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1124 transitions. [2022-07-13 22:10:15,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:15,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1124 transitions. [2022-07-13 22:10:15,833 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-13 22:10:15,835 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-13 22:10:15,836 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-13 22:10:15,836 INFO L186 Difference]: Start difference. First operand has 292 places, 304 transitions, 1137 flow. Second operand 5 states and 1124 transitions. [2022-07-13 22:10:15,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 330 transitions, 1531 flow [2022-07-13 22:10:15,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 330 transitions, 1461 flow, removed 25 selfloop flow, removed 8 redundant places. [2022-07-13 22:10:15,851 INFO L242 Difference]: Finished difference. Result has 289 places, 310 transitions, 1160 flow [2022-07-13 22:10:15,853 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-13 22:10:15,853 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 48 predicate places. [2022-07-13 22:10:15,853 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 310 transitions, 1160 flow [2022-07-13 22:10:15,854 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-13 22:10:15,854 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:15,854 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-13 22:10:15,885 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-13 22:10:16,063 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-13 22:10:16,064 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-13 22:10:16,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:16,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1688555133, now seen corresponding path program 4 times [2022-07-13 22:10:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:16,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190127242] [2022-07-13 22:10:16,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:16,524 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-13 22:10:16,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:16,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190127242] [2022-07-13 22:10:16,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190127242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:10:16,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455909395] [2022-07-13 22:10:16,525 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 22:10:16,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:10:16,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:10:16,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-13 22:10:16,556 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-13 22:10:16,696 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 22:10:16,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:10:16,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-13 22:10:16,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:10:17,259 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-13 22:10:17,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:10:17,532 INFO L356 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2022-07-13 22:10:17,533 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-13 22:10:17,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-13 22:10:17,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455909395] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:10:17,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:10:17,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 6] total 33 [2022-07-13 22:10:17,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539499885] [2022-07-13 22:10:17,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:10:17,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 22:10:17,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:17,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 22:10:17,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 22:10:17,776 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 267 [2022-07-13 22:10:17,780 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-13 22:10:17,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:17,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 267 [2022-07-13 22:10:17,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:21,975 INFO L129 PetriNetUnfolder]: 3864/9631 cut-off events. [2022-07-13 22:10:21,975 INFO L130 PetriNetUnfolder]: For 28815/29300 co-relation queries the response was YES. [2022-07-13 22:10:22,033 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-13 22:10:22,099 INFO L132 encePairwiseOnDemand]: 238/267 looper letters, 437 selfloop transitions, 118 changer transitions 69/765 dead transitions. [2022-07-13 22:10:22,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 765 transitions, 5327 flow [2022-07-13 22:10:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-13 22:10:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-07-13 22:10:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 8482 transitions. [2022-07-13 22:10:22,118 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6353558052434457 [2022-07-13 22:10:22,118 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 8482 transitions. [2022-07-13 22:10:22,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 8482 transitions. [2022-07-13 22:10:22,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:22,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 8482 transitions. [2022-07-13 22:10:22,138 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-13 22:10:22,157 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-13 22:10:22,160 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-13 22:10:22,160 INFO L186 Difference]: Start difference. First operand has 289 places, 310 transitions, 1160 flow. Second operand 50 states and 8482 transitions. [2022-07-13 22:10:22,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 765 transitions, 5327 flow [2022-07-13 22:10:22,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 765 transitions, 5285 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-07-13 22:10:22,189 INFO L242 Difference]: Finished difference. Result has 357 places, 397 transitions, 2300 flow [2022-07-13 22:10:22,190 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-13 22:10:22,190 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 116 predicate places. [2022-07-13 22:10:22,190 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 397 transitions, 2300 flow [2022-07-13 22:10:22,192 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-13 22:10:22,192 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:22,192 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-13 22:10:22,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 22:10:22,416 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-13 22:10:22,417 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-13 22:10:22,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2099699287, now seen corresponding path program 5 times [2022-07-13 22:10:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:22,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494598712] [2022-07-13 22:10:22,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:22,933 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-13 22:10:22,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:22,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494598712] [2022-07-13 22:10:22,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494598712] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:10:22,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708069898] [2022-07-13 22:10:22,933 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 22:10:22,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:10:22,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:10:22,936 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-13 22:10:22,937 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-13 22:10:23,117 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-07-13 22:10:23,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:10:23,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-13 22:10:23,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:10:23,824 INFO L356 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2022-07-13 22:10:23,825 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-13 22:10:23,846 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-13 22:10:23,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:10:24,129 INFO L356 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2022-07-13 22:10:24,130 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-13 22:10:24,525 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-13 22:10:24,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708069898] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:10:24,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:10:24,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 13] total 38 [2022-07-13 22:10:24,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736213140] [2022-07-13 22:10:24,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:10:24,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-13 22:10:24,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:24,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-13 22:10:24,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 22:10:24,533 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 267 [2022-07-13 22:10:24,538 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-13 22:10:24,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:24,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 267 [2022-07-13 22:10:24,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:27,590 INFO L129 PetriNetUnfolder]: 3545/9069 cut-off events. [2022-07-13 22:10:27,591 INFO L130 PetriNetUnfolder]: For 44770/45182 co-relation queries the response was YES. [2022-07-13 22:10:27,669 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-13 22:10:27,727 INFO L132 encePairwiseOnDemand]: 226/267 looper letters, 317 selfloop transitions, 88 changer transitions 0/546 dead transitions. [2022-07-13 22:10:27,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 546 transitions, 4017 flow [2022-07-13 22:10:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-13 22:10:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-07-13 22:10:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 6015 transitions. [2022-07-13 22:10:27,736 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6257802746566792 [2022-07-13 22:10:27,736 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 6015 transitions. [2022-07-13 22:10:27,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 6015 transitions. [2022-07-13 22:10:27,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:27,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 6015 transitions. [2022-07-13 22:10:27,746 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-13 22:10:27,757 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-13 22:10:27,759 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-13 22:10:27,759 INFO L186 Difference]: Start difference. First operand has 357 places, 397 transitions, 2300 flow. Second operand 36 states and 6015 transitions. [2022-07-13 22:10:27,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 546 transitions, 4017 flow [2022-07-13 22:10:27,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 546 transitions, 3756 flow, removed 107 selfloop flow, removed 23 redundant places. [2022-07-13 22:10:27,896 INFO L242 Difference]: Finished difference. Result has 371 places, 446 transitions, 2758 flow [2022-07-13 22:10:27,897 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-13 22:10:27,899 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 130 predicate places. [2022-07-13 22:10:27,899 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 446 transitions, 2758 flow [2022-07-13 22:10:27,901 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-13 22:10:27,901 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:27,902 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-13 22:10:27,928 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-13 22:10:28,111 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-13 22:10:28,112 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-13 22:10:28,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:28,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2027241945, now seen corresponding path program 6 times [2022-07-13 22:10:28,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:28,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100649243] [2022-07-13 22:10:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:28,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:28,213 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-13 22:10:28,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:28,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100649243] [2022-07-13 22:10:28,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100649243] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:10:28,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766684538] [2022-07-13 22:10:28,214 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 22:10:28,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:10:28,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:10:28,217 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-13 22:10:28,218 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-13 22:10:28,408 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-13 22:10:28,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:10:28,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-13 22:10:28,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:10:28,990 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-13 22:10:28,991 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-13 22:10:29,005 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-13 22:10:29,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:10:29,253 INFO L356 Elim1Store]: treesize reduction 29, result has 43.1 percent of original size [2022-07-13 22:10:29,253 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-13 22:10:29,424 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-13 22:10:29,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766684538] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:10:29,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:10:29,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 6] total 21 [2022-07-13 22:10:29,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167777732] [2022-07-13 22:10:29,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:10:29,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 22:10:29,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:29,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 22:10:29,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:10:29,430 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 267 [2022-07-13 22:10:29,433 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-13 22:10:29,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:29,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 267 [2022-07-13 22:10:29,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:32,302 INFO L129 PetriNetUnfolder]: 4348/10802 cut-off events. [2022-07-13 22:10:32,303 INFO L130 PetriNetUnfolder]: For 52829/53282 co-relation queries the response was YES. [2022-07-13 22:10:32,360 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-13 22:10:32,427 INFO L132 encePairwiseOnDemand]: 248/267 looper letters, 421 selfloop transitions, 130 changer transitions 0/713 dead transitions. [2022-07-13 22:10:32,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 713 transitions, 5959 flow [2022-07-13 22:10:32,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-13 22:10:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-07-13 22:10:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 6180 transitions. [2022-07-13 22:10:32,436 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7013959822948587 [2022-07-13 22:10:32,436 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 6180 transitions. [2022-07-13 22:10:32,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 6180 transitions. [2022-07-13 22:10:32,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:32,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 6180 transitions. [2022-07-13 22:10:32,448 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-13 22:10:32,459 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-13 22:10:32,460 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-13 22:10:32,460 INFO L186 Difference]: Start difference. First operand has 371 places, 446 transitions, 2758 flow. Second operand 33 states and 6180 transitions. [2022-07-13 22:10:32,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 713 transitions, 5959 flow [2022-07-13 22:10:32,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 713 transitions, 5800 flow, removed 53 selfloop flow, removed 23 redundant places. [2022-07-13 22:10:32,646 INFO L242 Difference]: Finished difference. Result has 387 places, 478 transitions, 3388 flow [2022-07-13 22:10:32,646 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-13 22:10:32,647 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 146 predicate places. [2022-07-13 22:10:32,647 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 478 transitions, 3388 flow [2022-07-13 22:10:32,648 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-13 22:10:32,648 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:32,648 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-13 22:10:32,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 22:10:32,857 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-13 22:10:32,858 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-13 22:10:32,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:32,858 INFO L85 PathProgramCache]: Analyzing trace with hash 433707337, now seen corresponding path program 7 times [2022-07-13 22:10:32,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:32,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719370393] [2022-07-13 22:10:32,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:32,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:33,091 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-13 22:10:33,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:33,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719370393] [2022-07-13 22:10:33,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719370393] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:10:33,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:10:33,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 22:10:33,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547118867] [2022-07-13 22:10:33,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:10:33,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 22:10:33,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:33,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 22:10:33,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:10:33,096 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 267 [2022-07-13 22:10:33,098 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-13 22:10:33,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:33,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 267 [2022-07-13 22:10:33,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:36,052 INFO L129 PetriNetUnfolder]: 5284/12798 cut-off events. [2022-07-13 22:10:36,052 INFO L130 PetriNetUnfolder]: For 89138/90061 co-relation queries the response was YES. [2022-07-13 22:10:36,147 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-13 22:10:36,378 INFO L132 encePairwiseOnDemand]: 242/267 looper letters, 296 selfloop transitions, 79 changer transitions 0/561 dead transitions. [2022-07-13 22:10:36,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 561 transitions, 5008 flow [2022-07-13 22:10:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 22:10:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-13 22:10:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3202 transitions. [2022-07-13 22:10:36,382 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7054417272526988 [2022-07-13 22:10:36,382 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3202 transitions. [2022-07-13 22:10:36,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3202 transitions. [2022-07-13 22:10:36,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:36,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3202 transitions. [2022-07-13 22:10:36,387 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-13 22:10:36,393 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-13 22:10:36,394 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-13 22:10:36,394 INFO L186 Difference]: Start difference. First operand has 387 places, 478 transitions, 3388 flow. Second operand 17 states and 3202 transitions. [2022-07-13 22:10:36,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 561 transitions, 5008 flow [2022-07-13 22:10:36,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 561 transitions, 4815 flow, removed 56 selfloop flow, removed 20 redundant places. [2022-07-13 22:10:36,736 INFO L242 Difference]: Finished difference. Result has 385 places, 504 transitions, 3777 flow [2022-07-13 22:10:36,736 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-13 22:10:36,737 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 144 predicate places. [2022-07-13 22:10:36,737 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 504 transitions, 3777 flow [2022-07-13 22:10:36,737 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-13 22:10:36,738 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:36,738 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-13 22:10:36,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 22:10:36,738 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-13 22:10:36,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:36,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1027077285, now seen corresponding path program 8 times [2022-07-13 22:10:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:36,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207319516] [2022-07-13 22:10:36,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:36,960 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-13 22:10:36,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:36,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207319516] [2022-07-13 22:10:36,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207319516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:10:36,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:10:36,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 22:10:36,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918380732] [2022-07-13 22:10:36,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:10:36,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 22:10:36,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:36,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 22:10:36,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:10:36,963 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 267 [2022-07-13 22:10:36,965 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-13 22:10:36,965 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:36,965 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 267 [2022-07-13 22:10:36,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:40,322 INFO L129 PetriNetUnfolder]: 6385/15082 cut-off events. [2022-07-13 22:10:40,322 INFO L130 PetriNetUnfolder]: For 108609/109822 co-relation queries the response was YES. [2022-07-13 22:10:40,419 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-13 22:10:40,500 INFO L132 encePairwiseOnDemand]: 242/267 looper letters, 303 selfloop transitions, 102 changer transitions 0/590 dead transitions. [2022-07-13 22:10:40,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 590 transitions, 5525 flow [2022-07-13 22:10:40,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:10:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-07-13 22:10:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3348 transitions. [2022-07-13 22:10:40,506 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6966292134831461 [2022-07-13 22:10:40,506 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3348 transitions. [2022-07-13 22:10:40,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3348 transitions. [2022-07-13 22:10:40,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:40,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3348 transitions. [2022-07-13 22:10:40,512 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-13 22:10:40,516 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-13 22:10:40,517 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-13 22:10:40,517 INFO L186 Difference]: Start difference. First operand has 385 places, 504 transitions, 3777 flow. Second operand 18 states and 3348 transitions. [2022-07-13 22:10:40,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 590 transitions, 5525 flow [2022-07-13 22:10:40,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 590 transitions, 5375 flow, removed 8 selfloop flow, removed 18 redundant places. [2022-07-13 22:10:40,770 INFO L242 Difference]: Finished difference. Result has 385 places, 526 transitions, 4245 flow [2022-07-13 22:10:40,771 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-13 22:10:40,771 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 144 predicate places. [2022-07-13 22:10:40,771 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 526 transitions, 4245 flow [2022-07-13 22:10:40,771 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-13 22:10:40,772 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:40,772 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-13 22:10:40,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 22:10:40,772 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-13 22:10:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:40,773 INFO L85 PathProgramCache]: Analyzing trace with hash -994685543, now seen corresponding path program 1 times [2022-07-13 22:10:40,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:40,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076773027] [2022-07-13 22:10:40,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:40,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:41,060 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-13 22:10:41,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:41,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076773027] [2022-07-13 22:10:41,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076773027] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:10:41,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301346887] [2022-07-13 22:10:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:41,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:10:41,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:10:41,063 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-13 22:10:41,089 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-13 22:10:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:41,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 22:10:41,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:10:41,585 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-13 22:10:41,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:10:41,982 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-13 22:10:41,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301346887] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:10:41,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:10:41,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 23 [2022-07-13 22:10:41,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92075287] [2022-07-13 22:10:41,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:10:41,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 22:10:41,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:41,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 22:10:41,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2022-07-13 22:10:41,988 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 267 [2022-07-13 22:10:41,991 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-13 22:10:41,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:41,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 267 [2022-07-13 22:10:41,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:10:43,128 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-13 22:10:43,129 INFO L384 tUnfolder$Statistics]: this new event has 215 ancestors and is cut-off event [2022-07-13 22:10:43,129 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-13 22:10:43,129 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-13 22:10:43,129 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-13 22:10:43,135 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-13 22:10:43,136 INFO L384 tUnfolder$Statistics]: this new event has 215 ancestors and is cut-off event [2022-07-13 22:10:43,136 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-13 22:10:43,136 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-13 22:10:43,136 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-13 22:10:43,743 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-13 22:10:43,743 INFO L384 tUnfolder$Statistics]: this new event has 217 ancestors and is cut-off event [2022-07-13 22:10:43,743 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-07-13 22:10:43,743 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-07-13 22:10:43,743 INFO L387 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-07-13 22:10:43,971 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-13 22:10:43,972 INFO L384 tUnfolder$Statistics]: this new event has 217 ancestors and is not cut-off event [2022-07-13 22:10:43,972 INFO L387 tUnfolder$Statistics]: existing Event has 222 ancestors and is not cut-off event [2022-07-13 22:10:43,972 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is not cut-off event [2022-07-13 22:10:43,972 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is not cut-off event [2022-07-13 22:10:46,591 INFO L129 PetriNetUnfolder]: 7817/20848 cut-off events. [2022-07-13 22:10:46,591 INFO L130 PetriNetUnfolder]: For 138084/140125 co-relation queries the response was YES. [2022-07-13 22:10:46,758 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-13 22:10:46,817 INFO L132 encePairwiseOnDemand]: 247/267 looper letters, 249 selfloop transitions, 44 changer transitions 208/748 dead transitions. [2022-07-13 22:10:46,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 748 transitions, 7770 flow [2022-07-13 22:10:46,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 22:10:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-07-13 22:10:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3945 transitions. [2022-07-13 22:10:46,827 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7387640449438202 [2022-07-13 22:10:46,827 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3945 transitions. [2022-07-13 22:10:46,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3945 transitions. [2022-07-13 22:10:46,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:10:46,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3945 transitions. [2022-07-13 22:10:46,840 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-13 22:10:46,845 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-13 22:10:46,846 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-13 22:10:46,847 INFO L186 Difference]: Start difference. First operand has 385 places, 526 transitions, 4245 flow. Second operand 20 states and 3945 transitions. [2022-07-13 22:10:46,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 748 transitions, 7770 flow [2022-07-13 22:10:47,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 748 transitions, 7552 flow, removed 4 selfloop flow, removed 15 redundant places. [2022-07-13 22:10:47,240 INFO L242 Difference]: Finished difference. Result has 395 places, 532 transitions, 4282 flow [2022-07-13 22:10:47,241 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-13 22:10:47,241 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 154 predicate places. [2022-07-13 22:10:47,241 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 532 transitions, 4282 flow [2022-07-13 22:10:47,242 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-13 22:10:47,242 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:10:47,243 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-13 22:10:47,263 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-13 22:10:47,451 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-13 22:10:47,452 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-13 22:10:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:10:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash 901136769, now seen corresponding path program 2 times [2022-07-13 22:10:47,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:10:47,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708868915] [2022-07-13 22:10:47,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:10:47,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:10:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:10:48,148 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-13 22:10:48,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:10:48,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708868915] [2022-07-13 22:10:48,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708868915] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:10:48,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304628680] [2022-07-13 22:10:48,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:10:48,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:10:48,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:10:48,156 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-13 22:10:48,158 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-13 22:10:48,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:10:48,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:10:48,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-13 22:10:48,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:10:50,246 INFO L356 Elim1Store]: treesize reduction 70, result has 37.5 percent of original size [2022-07-13 22:10:50,247 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-13 22:10:50,299 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-13 22:10:50,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:10:51,042 INFO L356 Elim1Store]: treesize reduction 44, result has 75.4 percent of original size [2022-07-13 22:10:51,042 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-13 22:10:52,398 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-13 22:10:52,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304628680] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:10:52,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:10:52,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 26] total 70 [2022-07-13 22:10:52,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908109874] [2022-07-13 22:10:52,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:10:52,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-13 22:10:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:10:52,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-13 22:10:52,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=4296, Unknown=0, NotChecked=0, Total=4830 [2022-07-13 22:10:52,410 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 267 [2022-07-13 22:10:52,416 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-13 22:10:52,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:10:52,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 267 [2022-07-13 22:10:52,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:11:06,467 INFO L129 PetriNetUnfolder]: 22455/46179 cut-off events. [2022-07-13 22:11:06,467 INFO L130 PetriNetUnfolder]: For 357419/360785 co-relation queries the response was YES. [2022-07-13 22:11:07,093 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-13 22:11:07,339 INFO L132 encePairwiseOnDemand]: 213/267 looper letters, 843 selfloop transitions, 578 changer transitions 0/1551 dead transitions. [2022-07-13 22:11:07,339 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 1551 transitions, 17407 flow [2022-07-13 22:11:07,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-07-13 22:11:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2022-07-13 22:11:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 16646 transitions. [2022-07-13 22:11:07,362 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.577264530448051 [2022-07-13 22:11:07,362 INFO L72 ComplementDD]: Start complementDD. Operand 108 states and 16646 transitions. [2022-07-13 22:11:07,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 16646 transitions. [2022-07-13 22:11:07,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:11:07,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 108 states and 16646 transitions. [2022-07-13 22:11:07,399 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-13 22:11:07,433 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-13 22:11:07,438 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-13 22:11:07,438 INFO L186 Difference]: Start difference. First operand has 395 places, 532 transitions, 4282 flow. Second operand 108 states and 16646 transitions. [2022-07-13 22:11:07,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 1551 transitions, 17407 flow [2022-07-13 22:11:08,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 1551 transitions, 17189 flow, removed 47 selfloop flow, removed 8 redundant places. [2022-07-13 22:11:08,647 INFO L242 Difference]: Finished difference. Result has 531 places, 1073 transitions, 12633 flow [2022-07-13 22:11:08,648 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-13 22:11:08,648 INFO L279 CegarLoopForPetriNet]: 241 programPoint places, 290 predicate places. [2022-07-13 22:11:08,649 INFO L495 AbstractCegarLoop]: Abstraction has has 531 places, 1073 transitions, 12633 flow [2022-07-13 22:11:08,650 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-13 22:11:08,650 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:11:08,650 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-13 22:11:08,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 22:11:08,867 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-13 22:11:08,868 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-13 22:11:08,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:11:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash 961897749, now seen corresponding path program 3 times [2022-07-13 22:11:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:11:08,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864174776] [2022-07-13 22:11:08,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:11:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:11:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:11:11,606 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-13 22:11:11,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:11:11,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864174776] [2022-07-13 22:11:11,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864174776] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:11:11,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657124680] [2022-07-13 22:11:11,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 22:11:11,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:11:11,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:11:11,608 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-13 22:11:11,609 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-13 22:11:11,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 22:11:11,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:11:11,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-13 22:11:11,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:11:13,172 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:11:13,172 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-13 22:11:13,322 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-13 22:11:13,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:11:13,755 INFO L356 Elim1Store]: treesize reduction 12, result has 89.0 percent of original size [2022-07-13 22:11:13,755 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-13 22:11:14,084 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-13 22:11:14,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657124680] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:11:14,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:11:14,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 22, 9] total 79 [2022-07-13 22:11:14,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881205840] [2022-07-13 22:11:14,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:11:14,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-07-13 22:11:14,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:11:14,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-07-13 22:11:14,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=5834, Unknown=0, NotChecked=0, Total=6162 [2022-07-13 22:11:14,092 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 267 [2022-07-13 22:11:14,097 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-13 22:11:14,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:11:14,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 267 [2022-07-13 22:11:14,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand