./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.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 2b8fef41c3119c5f4fc9586ebd31a4ff7152be41d9f2f8da139e8cd34cf0da86 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 19:40:21,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 19:40:21,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 19:40:21,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 19:40:21,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 19:40:21,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 19:40:21,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 19:40:21,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 19:40:21,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 19:40:21,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 19:40:21,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 19:40:21,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 19:40:21,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 19:40:21,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 19:40:21,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 19:40:21,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 19:40:21,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 19:40:21,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 19:40:21,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 19:40:21,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 19:40:21,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 19:40:21,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 19:40:21,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 19:40:21,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 19:40:21,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 19:40:21,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 19:40:21,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 19:40:21,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 19:40:21,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 19:40:21,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 19:40:21,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 19:40:21,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 19:40:21,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 19:40:21,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 19:40:21,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 19:40:21,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 19:40:21,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 19:40:21,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 19:40:21,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 19:40:21,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 19:40:21,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 19:40:21,863 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 19:40:21,897 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 19:40:21,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 19:40:21,898 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 19:40:21,898 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 19:40:21,899 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 19:40:21,899 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 19:40:21,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 19:40:21,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 19:40:21,901 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 19:40:21,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 19:40:21,902 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 19:40:21,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 19:40:21,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 19:40:21,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 19:40:21,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 19:40:21,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 19:40:21,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 19:40:21,903 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 19:40:21,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 19:40:21,903 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 19:40:21,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 19:40:21,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 19:40:21,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 19:40:21,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 19:40:21,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 19:40:21,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 19:40:21,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 19:40:21,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 19:40:21,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 19:40:21,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 19:40:21,905 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 19:40:21,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 19:40:21,906 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 19:40:21,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 19:40:21,906 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 19:40:21,907 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 2b8fef41c3119c5f4fc9586ebd31a4ff7152be41d9f2f8da139e8cd34cf0da86 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 19:40:22,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 19:40:22,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 19:40:22,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 19:40:22,238 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 19:40:22,239 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 19:40:22,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-08-30 19:40:23,526 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 19:40:23,730 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 19:40:23,731 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-08-30 19:40:23,739 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9091922/8a341605688f4f7da44343f30ea0b8cd/FLAGe51937781 [2023-08-30 19:40:23,749 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9091922/8a341605688f4f7da44343f30ea0b8cd [2023-08-30 19:40:23,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 19:40:23,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 19:40:23,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 19:40:23,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 19:40:23,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 19:40:23,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 07:40:23" (1/1) ... [2023-08-30 19:40:23,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402668f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:23, skipping insertion in model container [2023-08-30 19:40:23,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 07:40:23" (1/1) ... [2023-08-30 19:40:23,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 19:40:23,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 19:40:23,967 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-08-30 19:40:23,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 19:40:24,005 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 19:40:24,044 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-08-30 19:40:24,059 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 19:40:24,070 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 19:40:24,071 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 19:40:24,077 INFO L208 MainTranslator]: Completed translation [2023-08-30 19:40:24,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:24 WrapperNode [2023-08-30 19:40:24,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 19:40:24,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 19:40:24,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 19:40:24,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 19:40:24,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:24" (1/1) ... [2023-08-30 19:40:24,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:24" (1/1) ... [2023-08-30 19:40:24,152 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 303 [2023-08-30 19:40:24,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 19:40:24,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 19:40:24,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 19:40:24,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 19:40:24,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:24" (1/1) ... [2023-08-30 19:40:24,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:24" (1/1) ... [2023-08-30 19:40:24,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:24" (1/1) ... [2023-08-30 19:40:24,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:24" (1/1) ... [2023-08-30 19:40:24,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:24" (1/1) ... [2023-08-30 19:40:24,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:24" (1/1) ... [2023-08-30 19:40:24,208 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:24" (1/1) ... [2023-08-30 19:40:24,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:24" (1/1) ... [2023-08-30 19:40:24,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 19:40:24,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 19:40:24,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 19:40:24,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 19:40:24,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:24" (1/1) ... [2023-08-30 19:40:24,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 19:40:24,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:40:24,254 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) [2023-08-30 19:40:24,276 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 [2023-08-30 19:40:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 19:40:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 19:40:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 19:40:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 19:40:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 19:40:24,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 19:40:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 19:40:24,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 19:40:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 19:40:24,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 19:40:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-30 19:40:24,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-30 19:40:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 19:40:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-30 19:40:24,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-30 19:40:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-30 19:40:24,296 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-30 19:40:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 19:40:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 19:40:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 19:40:24,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 19:40:24,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 19:40:24,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 19:40:24,298 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 19:40:24,429 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 19:40:24,431 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 19:40:24,939 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 19:40:25,137 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 19:40:25,137 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-30 19:40:25,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 07:40:25 BoogieIcfgContainer [2023-08-30 19:40:25,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 19:40:25,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 19:40:25,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 19:40:25,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 19:40:25,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 07:40:23" (1/3) ... [2023-08-30 19:40:25,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3444168a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 07:40:25, skipping insertion in model container [2023-08-30 19:40:25,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 07:40:24" (2/3) ... [2023-08-30 19:40:25,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3444168a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 07:40:25, skipping insertion in model container [2023-08-30 19:40:25,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 07:40:25" (3/3) ... [2023-08-30 19:40:25,149 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2023-08-30 19:40:25,156 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 19:40:25,164 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 19:40:25,165 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 19:40:25,165 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 19:40:25,313 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-08-30 19:40:25,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 262 transitions, 596 flow [2023-08-30 19:40:25,482 INFO L130 PetriNetUnfolder]: 18/234 cut-off events. [2023-08-30 19:40:25,482 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-30 19:40:25,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 234 events. 18/234 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 313 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 203. Up to 3 conditions per place. [2023-08-30 19:40:25,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 262 transitions, 596 flow [2023-08-30 19:40:25,499 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 226 transitions, 500 flow [2023-08-30 19:40:25,503 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 19:40:25,513 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 226 transitions, 500 flow [2023-08-30 19:40:25,517 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 226 transitions, 500 flow [2023-08-30 19:40:25,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 226 transitions, 500 flow [2023-08-30 19:40:25,568 INFO L130 PetriNetUnfolder]: 18/226 cut-off events. [2023-08-30 19:40:25,569 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-30 19:40:25,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 226 events. 18/226 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 312 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 203. Up to 3 conditions per place. [2023-08-30 19:40:25,575 INFO L119 LiptonReduction]: Number of co-enabled transitions 7920 [2023-08-30 19:40:31,501 INFO L134 LiptonReduction]: Checked pairs total: 33320 [2023-08-30 19:40:31,502 INFO L136 LiptonReduction]: Total number of compositions: 192 [2023-08-30 19:40:31,514 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 19:40:31,520 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4a61881a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 19:40:31,520 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-08-30 19:40:31,531 INFO L130 PetriNetUnfolder]: 9/64 cut-off events. [2023-08-30 19:40:31,531 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-30 19:40:31,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:40:31,532 INFO L208 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] [2023-08-30 19:40:31,533 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-30 19:40:31,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:40:31,537 INFO L85 PathProgramCache]: Analyzing trace with hash -266416520, now seen corresponding path program 1 times [2023-08-30 19:40:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:40:31,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285580990] [2023-08-30 19:40:31,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:40:31,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:40:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:40:32,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:40:32,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:40:32,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285580990] [2023-08-30 19:40:32,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285580990] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 19:40:32,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 19:40:32,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 19:40:32,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256654263] [2023-08-30 19:40:32,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 19:40:32,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 19:40:32,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:40:32,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 19:40:32,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 19:40:32,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 458 [2023-08-30 19:40:32,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:32,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:40:32,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 458 [2023-08-30 19:40:32,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:40:35,934 INFO L130 PetriNetUnfolder]: 24447/32779 cut-off events. [2023-08-30 19:40:35,934 INFO L131 PetriNetUnfolder]: For 5201/5216 co-relation queries the response was YES. [2023-08-30 19:40:36,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69555 conditions, 32779 events. 24447/32779 cut-off events. For 5201/5216 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 171485 event pairs, 10465 based on Foata normal form. 4/25142 useless extension candidates. Maximal degree in co-relation 68091. Up to 12303 conditions per place. [2023-08-30 19:40:36,233 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 109 selfloop transitions, 8 changer transitions 1/138 dead transitions. [2023-08-30 19:40:36,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 138 transitions, 641 flow [2023-08-30 19:40:36,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 19:40:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 19:40:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 975 transitions. [2023-08-30 19:40:36,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5322052401746725 [2023-08-30 19:40:36,256 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 975 transitions. [2023-08-30 19:40:36,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 975 transitions. [2023-08-30 19:40:36,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:40:36,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 975 transitions. [2023-08-30 19:40:36,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 243.75) internal successors, (975), 4 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:36,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:36,278 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:36,281 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 178 flow. Second operand 4 states and 975 transitions. [2023-08-30 19:40:36,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 138 transitions, 641 flow [2023-08-30 19:40:36,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 138 transitions, 555 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-30 19:40:36,416 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 199 flow [2023-08-30 19:40:36,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2023-08-30 19:40:36,422 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2023-08-30 19:40:36,423 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 72 transitions, 199 flow [2023-08-30 19:40:36,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:36,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:40:36,425 INFO L208 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] [2023-08-30 19:40:36,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 19:40:36,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-30 19:40:36,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:40:36,436 INFO L85 PathProgramCache]: Analyzing trace with hash -549139452, now seen corresponding path program 2 times [2023-08-30 19:40:36,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:40:36,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067688553] [2023-08-30 19:40:36,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:40:36,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:40:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:40:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:40:36,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:40:36,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067688553] [2023-08-30 19:40:36,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067688553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 19:40:36,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 19:40:36,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 19:40:36,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358827916] [2023-08-30 19:40:36,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 19:40:36,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 19:40:36,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:40:36,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 19:40:36,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 19:40:36,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 458 [2023-08-30 19:40:36,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:36,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:40:36,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 458 [2023-08-30 19:40:36,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:40:40,679 INFO L130 PetriNetUnfolder]: 40211/54287 cut-off events. [2023-08-30 19:40:40,679 INFO L131 PetriNetUnfolder]: For 11968/11968 co-relation queries the response was YES. [2023-08-30 19:40:40,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120541 conditions, 54287 events. 40211/54287 cut-off events. For 11968/11968 co-relation queries the response was YES. Maximal size of possible extension queue 1398. Compared 304734 event pairs, 15979 based on Foata normal form. 1/41699 useless extension candidates. Maximal degree in co-relation 43207. Up to 22845 conditions per place. [2023-08-30 19:40:41,012 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 115 selfloop transitions, 11 changer transitions 1/147 dead transitions. [2023-08-30 19:40:41,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 147 transitions, 654 flow [2023-08-30 19:40:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 19:40:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 19:40:41,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 977 transitions. [2023-08-30 19:40:41,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5332969432314411 [2023-08-30 19:40:41,016 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 977 transitions. [2023-08-30 19:40:41,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 977 transitions. [2023-08-30 19:40:41,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:40:41,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 977 transitions. [2023-08-30 19:40:41,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:41,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:41,024 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:41,024 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 199 flow. Second operand 4 states and 977 transitions. [2023-08-30 19:40:41,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 147 transitions, 654 flow [2023-08-30 19:40:41,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 147 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 19:40:41,034 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 278 flow [2023-08-30 19:40:41,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2023-08-30 19:40:41,035 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2023-08-30 19:40:41,036 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 278 flow [2023-08-30 19:40:41,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:41,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:40:41,037 INFO L208 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] [2023-08-30 19:40:41,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 19:40:41,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-30 19:40:41,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:40:41,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1731748126, now seen corresponding path program 1 times [2023-08-30 19:40:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:40:41,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253503636] [2023-08-30 19:40:41,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:40:41,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:40:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:40:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:40:41,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:40:41,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253503636] [2023-08-30 19:40:41,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253503636] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 19:40:41,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 19:40:41,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 19:40:41,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159966301] [2023-08-30 19:40:41,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 19:40:41,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 19:40:41,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:40:41,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 19:40:41,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 19:40:41,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 458 [2023-08-30 19:40:41,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:41,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:40:41,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 458 [2023-08-30 19:40:41,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:40:46,240 INFO L130 PetriNetUnfolder]: 52244/70746 cut-off events. [2023-08-30 19:40:46,240 INFO L131 PetriNetUnfolder]: For 34959/34959 co-relation queries the response was YES. [2023-08-30 19:40:46,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169029 conditions, 70746 events. 52244/70746 cut-off events. For 34959/34959 co-relation queries the response was YES. Maximal size of possible extension queue 1811. Compared 414211 event pairs, 34723 based on Foata normal form. 0/54996 useless extension candidates. Maximal degree in co-relation 71207. Up to 50266 conditions per place. [2023-08-30 19:40:46,572 INFO L137 encePairwiseOnDemand]: 452/458 looper letters, 121 selfloop transitions, 5 changer transitions 0/146 dead transitions. [2023-08-30 19:40:46,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 146 transitions, 753 flow [2023-08-30 19:40:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 19:40:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 19:40:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1157 transitions. [2023-08-30 19:40:46,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505240174672489 [2023-08-30 19:40:46,576 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1157 transitions. [2023-08-30 19:40:46,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1157 transitions. [2023-08-30 19:40:46,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:40:46,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1157 transitions. [2023-08-30 19:40:46,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 231.4) internal successors, (1157), 5 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:46,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:46,714 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:46,714 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 278 flow. Second operand 5 states and 1157 transitions. [2023-08-30 19:40:46,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 146 transitions, 753 flow [2023-08-30 19:40:46,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 146 transitions, 749 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-30 19:40:46,744 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 324 flow [2023-08-30 19:40:46,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2023-08-30 19:40:46,745 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2023-08-30 19:40:46,745 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 324 flow [2023-08-30 19:40:46,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:46,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:40:46,746 INFO L208 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] [2023-08-30 19:40:46,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 19:40:46,747 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-30 19:40:46,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:40:46,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1011656969, now seen corresponding path program 1 times [2023-08-30 19:40:46,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:40:46,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873298128] [2023-08-30 19:40:46,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:40:46,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:40:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:40:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:40:46,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:40:46,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873298128] [2023-08-30 19:40:46,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873298128] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 19:40:46,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 19:40:46,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 19:40:46,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162780662] [2023-08-30 19:40:46,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 19:40:46,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 19:40:46,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:40:46,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 19:40:46,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 19:40:47,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 458 [2023-08-30 19:40:47,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:47,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:40:47,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 458 [2023-08-30 19:40:47,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:40:51,223 INFO L130 PetriNetUnfolder]: 43919/59576 cut-off events. [2023-08-30 19:40:51,223 INFO L131 PetriNetUnfolder]: For 33750/33750 co-relation queries the response was YES. [2023-08-30 19:40:51,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146471 conditions, 59576 events. 43919/59576 cut-off events. For 33750/33750 co-relation queries the response was YES. Maximal size of possible extension queue 1587. Compared 341974 event pairs, 30832 based on Foata normal form. 0/50903 useless extension candidates. Maximal degree in co-relation 134447. Up to 50266 conditions per place. [2023-08-30 19:40:51,517 INFO L137 encePairwiseOnDemand]: 452/458 looper letters, 58 selfloop transitions, 2 changer transitions 51/131 dead transitions. [2023-08-30 19:40:51,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 131 transitions, 677 flow [2023-08-30 19:40:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 19:40:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 19:40:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1148 transitions. [2023-08-30 19:40:51,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013100436681223 [2023-08-30 19:40:51,521 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1148 transitions. [2023-08-30 19:40:51,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1148 transitions. [2023-08-30 19:40:51,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:40:51,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1148 transitions. [2023-08-30 19:40:51,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 229.6) internal successors, (1148), 5 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:51,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:51,531 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:51,531 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 324 flow. Second operand 5 states and 1148 transitions. [2023-08-30 19:40:51,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 131 transitions, 677 flow [2023-08-30 19:40:51,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 131 transitions, 673 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 19:40:51,547 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 302 flow [2023-08-30 19:40:51,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2023-08-30 19:40:51,548 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2023-08-30 19:40:51,548 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 302 flow [2023-08-30 19:40:51,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 216.8) internal successors, (1084), 5 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:51,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:40:51,549 INFO L208 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] [2023-08-30 19:40:51,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 19:40:51,550 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-30 19:40:51,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:40:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1272608977, now seen corresponding path program 1 times [2023-08-30 19:40:51,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:40:51,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997028783] [2023-08-30 19:40:51,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:40:51,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:40:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:40:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:40:51,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:40:51,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997028783] [2023-08-30 19:40:51,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997028783] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 19:40:51,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261149951] [2023-08-30 19:40:51,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:40:51,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:40:51,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:40:51,817 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) [2023-08-30 19:40:51,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 19:40:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:40:51,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 19:40:51,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 19:40:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:40:52,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 19:40:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:40:52,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261149951] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 19:40:52,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 19:40:52,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 19:40:52,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111811563] [2023-08-30 19:40:52,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 19:40:52,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 19:40:52,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:40:52,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 19:40:52,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-08-30 19:40:52,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 458 [2023-08-30 19:40:52,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 302 flow. Second operand has 11 states, 11 states have (on average 212.27272727272728) internal successors, (2335), 11 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:52,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:40:52,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 458 [2023-08-30 19:40:52,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:40:57,381 INFO L130 PetriNetUnfolder]: 50674/69621 cut-off events. [2023-08-30 19:40:57,382 INFO L131 PetriNetUnfolder]: For 48114/48114 co-relation queries the response was YES. [2023-08-30 19:40:57,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175548 conditions, 69621 events. 50674/69621 cut-off events. For 48114/48114 co-relation queries the response was YES. Maximal size of possible extension queue 1807. Compared 428541 event pairs, 15551 based on Foata normal form. 3638/69221 useless extension candidates. Maximal degree in co-relation 175527. Up to 28288 conditions per place. [2023-08-30 19:40:57,765 INFO L137 encePairwiseOnDemand]: 450/458 looper letters, 159 selfloop transitions, 8 changer transitions 0/187 dead transitions. [2023-08-30 19:40:57,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 187 transitions, 1059 flow [2023-08-30 19:40:57,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 19:40:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 19:40:57,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1593 transitions. [2023-08-30 19:40:57,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4968808484092327 [2023-08-30 19:40:57,917 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1593 transitions. [2023-08-30 19:40:57,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1593 transitions. [2023-08-30 19:40:57,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:40:57,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1593 transitions. [2023-08-30 19:40:57,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 227.57142857142858) internal successors, (1593), 7 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:57,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:57,924 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:57,924 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 302 flow. Second operand 7 states and 1593 transitions. [2023-08-30 19:40:57,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 187 transitions, 1059 flow [2023-08-30 19:40:57,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 187 transitions, 1035 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-30 19:40:57,958 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 368 flow [2023-08-30 19:40:57,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-08-30 19:40:57,960 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2023-08-30 19:40:57,961 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 368 flow [2023-08-30 19:40:57,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 212.27272727272728) internal successors, (2335), 11 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:57,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:40:57,962 INFO L208 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] [2023-08-30 19:40:57,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 19:40:58,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:40:58,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-30 19:40:58,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:40:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2079067074, now seen corresponding path program 1 times [2023-08-30 19:40:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:40:58,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169337382] [2023-08-30 19:40:58,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:40:58,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:40:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:40:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:40:58,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:40:58,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169337382] [2023-08-30 19:40:58,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169337382] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 19:40:58,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574800067] [2023-08-30 19:40:58,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:40:58,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:40:58,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:40:58,447 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) [2023-08-30 19:40:58,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 19:40:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:40:58,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 19:40:58,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 19:40:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:40:58,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 19:40:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:40:58,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574800067] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 19:40:58,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 19:40:58,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-30 19:40:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598845091] [2023-08-30 19:40:58,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 19:40:58,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 19:40:58,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:40:58,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 19:40:58,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-08-30 19:40:58,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 458 [2023-08-30 19:40:58,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 368 flow. Second operand has 11 states, 11 states have (on average 212.27272727272728) internal successors, (2335), 11 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:40:58,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:40:58,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 458 [2023-08-30 19:40:58,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:41:03,137 INFO L130 PetriNetUnfolder]: 40749/56313 cut-off events. [2023-08-30 19:41:03,137 INFO L131 PetriNetUnfolder]: For 64677/64677 co-relation queries the response was YES. [2023-08-30 19:41:03,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156646 conditions, 56313 events. 40749/56313 cut-off events. For 64677/64677 co-relation queries the response was YES. Maximal size of possible extension queue 1566. Compared 339564 event pairs, 12668 based on Foata normal form. 2458/55154 useless extension candidates. Maximal degree in co-relation 143767. Up to 26698 conditions per place. [2023-08-30 19:41:03,421 INFO L137 encePairwiseOnDemand]: 450/458 looper letters, 100 selfloop transitions, 5 changer transitions 51/176 dead transitions. [2023-08-30 19:41:03,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 176 transitions, 1023 flow [2023-08-30 19:41:03,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 19:41:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 19:41:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1584 transitions. [2023-08-30 19:41:03,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4940736119775421 [2023-08-30 19:41:03,425 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1584 transitions. [2023-08-30 19:41:03,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1584 transitions. [2023-08-30 19:41:03,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:41:03,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1584 transitions. [2023-08-30 19:41:03,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 226.28571428571428) internal successors, (1584), 7 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:03,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:03,434 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:03,434 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 368 flow. Second operand 7 states and 1584 transitions. [2023-08-30 19:41:03,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 176 transitions, 1023 flow [2023-08-30 19:41:03,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 176 transitions, 1007 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-30 19:41:03,453 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 362 flow [2023-08-30 19:41:03,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2023-08-30 19:41:03,454 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 21 predicate places. [2023-08-30 19:41:03,454 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 362 flow [2023-08-30 19:41:03,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 212.27272727272728) internal successors, (2335), 11 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:03,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:41:03,456 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-30 19:41:03,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 19:41:03,661 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,SelfDestructingSolverStorable5 [2023-08-30 19:41:03,662 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-30 19:41:03,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:41:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash -982059132, now seen corresponding path program 1 times [2023-08-30 19:41:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:41:03,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11835679] [2023-08-30 19:41:03,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:41:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:41:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:41:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:41:03,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:41:03,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11835679] [2023-08-30 19:41:03,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11835679] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 19:41:03,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084396447] [2023-08-30 19:41:03,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:41:03,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:41:03,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:41:03,954 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) [2023-08-30 19:41:03,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 19:41:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:41:04,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 19:41:04,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 19:41:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:41:04,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 19:41:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:41:04,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084396447] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 19:41:04,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 19:41:04,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-08-30 19:41:04,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867735052] [2023-08-30 19:41:04,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 19:41:04,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 19:41:04,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:41:04,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 19:41:04,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-08-30 19:41:04,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 458 [2023-08-30 19:41:04,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 85 transitions, 362 flow. Second operand has 13 states, 13 states have (on average 213.6153846153846) internal successors, (2777), 13 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:04,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:41:04,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 458 [2023-08-30 19:41:04,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:41:07,744 INFO L130 PetriNetUnfolder]: 28494/38831 cut-off events. [2023-08-30 19:41:07,744 INFO L131 PetriNetUnfolder]: For 64304/64304 co-relation queries the response was YES. [2023-08-30 19:41:07,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122203 conditions, 38831 events. 28494/38831 cut-off events. For 64304/64304 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 213410 event pairs, 15424 based on Foata normal form. 1152/38010 useless extension candidates. Maximal degree in co-relation 122162. Up to 32677 conditions per place. [2023-08-30 19:41:07,966 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 89 selfloop transitions, 7 changer transitions 0/116 dead transitions. [2023-08-30 19:41:07,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 116 transitions, 693 flow [2023-08-30 19:41:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 19:41:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 19:41:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1322 transitions. [2023-08-30 19:41:07,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810771470160116 [2023-08-30 19:41:07,970 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1322 transitions. [2023-08-30 19:41:07,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1322 transitions. [2023-08-30 19:41:07,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:41:07,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1322 transitions. [2023-08-30 19:41:07,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 220.33333333333334) internal successors, (1322), 6 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:07,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:07,978 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:07,978 INFO L175 Difference]: Start difference. First operand has 96 places, 85 transitions, 362 flow. Second operand 6 states and 1322 transitions. [2023-08-30 19:41:07,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 116 transitions, 693 flow [2023-08-30 19:41:08,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 651 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-30 19:41:08,003 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 368 flow [2023-08-30 19:41:08,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=368, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2023-08-30 19:41:08,003 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 16 predicate places. [2023-08-30 19:41:08,004 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 368 flow [2023-08-30 19:41:08,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 213.6153846153846) internal successors, (2777), 13 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:08,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:41:08,005 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-30 19:41:08,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 19:41:08,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:41:08,211 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-30 19:41:08,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:41:08,211 INFO L85 PathProgramCache]: Analyzing trace with hash -140044149, now seen corresponding path program 1 times [2023-08-30 19:41:08,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:41:08,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961838029] [2023-08-30 19:41:08,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:41:08,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:41:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:41:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:41:08,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:41:08,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961838029] [2023-08-30 19:41:08,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961838029] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 19:41:08,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680997712] [2023-08-30 19:41:08,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:41:08,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:41:08,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:41:08,443 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) [2023-08-30 19:41:08,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 19:41:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:41:08,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-30 19:41:08,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 19:41:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:41:08,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 19:41:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:41:08,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680997712] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-30 19:41:08,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-30 19:41:08,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2023-08-30 19:41:08,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922607774] [2023-08-30 19:41:08,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 19:41:08,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 19:41:08,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:41:08,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 19:41:08,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-08-30 19:41:08,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 458 [2023-08-30 19:41:08,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:08,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:41:08,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 458 [2023-08-30 19:41:08,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:41:11,175 INFO L130 PetriNetUnfolder]: 21901/29265 cut-off events. [2023-08-30 19:41:11,175 INFO L131 PetriNetUnfolder]: For 41498/41498 co-relation queries the response was YES. [2023-08-30 19:41:11,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92241 conditions, 29265 events. 21901/29265 cut-off events. For 41498/41498 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 147207 event pairs, 10095 based on Foata normal form. 816/28638 useless extension candidates. Maximal degree in co-relation 92202. Up to 25062 conditions per place. [2023-08-30 19:41:11,333 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 93 selfloop transitions, 7 changer transitions 0/120 dead transitions. [2023-08-30 19:41:11,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 120 transitions, 714 flow [2023-08-30 19:41:11,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 19:41:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 19:41:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1322 transitions. [2023-08-30 19:41:11,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810771470160116 [2023-08-30 19:41:11,337 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1322 transitions. [2023-08-30 19:41:11,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1322 transitions. [2023-08-30 19:41:11,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:41:11,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1322 transitions. [2023-08-30 19:41:11,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 220.33333333333334) internal successors, (1322), 6 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:11,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:11,344 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:11,344 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 368 flow. Second operand 6 states and 1322 transitions. [2023-08-30 19:41:11,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 120 transitions, 714 flow [2023-08-30 19:41:11,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 120 transitions, 689 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-30 19:41:11,368 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 384 flow [2023-08-30 19:41:11,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2023-08-30 19:41:11,369 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 18 predicate places. [2023-08-30 19:41:11,369 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 384 flow [2023-08-30 19:41:11,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:11,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:41:11,370 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-30 19:41:11,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-30 19:41:11,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:41:11,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-30 19:41:11,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:41:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1310477910, now seen corresponding path program 1 times [2023-08-30 19:41:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:41:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134711431] [2023-08-30 19:41:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:41:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:41:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:41:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 19:41:12,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:41:12,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134711431] [2023-08-30 19:41:12,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134711431] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 19:41:12,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406397643] [2023-08-30 19:41:12,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:41:12,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:41:12,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:41:12,686 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) [2023-08-30 19:41:12,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 19:41:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:41:12,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-30 19:41:12,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 19:41:13,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:41:13,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 19:41:13,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:41:13,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 19:41:13,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:41:13,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 19:41:13,570 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-08-30 19:41:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 19:41:13,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 19:41:15,377 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))))) is different from false [2023-08-30 19:41:16,869 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-30 19:41:16,965 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_495 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_495 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-30 19:41:17,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 19:41:17,060 INFO L350 Elim1Store]: Elim1 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 216 treesize of output 146 [2023-08-30 19:41:17,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 138 treesize of output 122 [2023-08-30 19:41:17,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 122 treesize of output 114 [2023-08-30 19:41:17,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 58 treesize of output 54 [2023-08-30 19:41:17,280 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 19:41:17,281 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 19:41:17,281 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 19:41:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 19:41:17,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406397643] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 19:41:17,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 19:41:17,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2023-08-30 19:41:17,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066064572] [2023-08-30 19:41:17,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 19:41:17,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-30 19:41:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:41:17,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-30 19:41:17,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=746, Unknown=25, NotChecked=174, Total=1056 [2023-08-30 19:41:17,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 458 [2023-08-30 19:41:17,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 384 flow. Second operand has 33 states, 33 states have (on average 171.15151515151516) internal successors, (5648), 33 states have internal predecessors, (5648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:17,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:41:17,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 458 [2023-08-30 19:41:17,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:41:28,630 INFO L130 PetriNetUnfolder]: 80622/105027 cut-off events. [2023-08-30 19:41:28,630 INFO L131 PetriNetUnfolder]: For 135851/135851 co-relation queries the response was YES. [2023-08-30 19:41:28,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327904 conditions, 105027 events. 80622/105027 cut-off events. For 135851/135851 co-relation queries the response was YES. Maximal size of possible extension queue 2137. Compared 573223 event pairs, 17446 based on Foata normal form. 1/101225 useless extension candidates. Maximal degree in co-relation 327864. Up to 45218 conditions per place. [2023-08-30 19:41:29,240 INFO L137 encePairwiseOnDemand]: 441/458 looper letters, 527 selfloop transitions, 117 changer transitions 1/655 dead transitions. [2023-08-30 19:41:29,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 655 transitions, 3884 flow [2023-08-30 19:41:29,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-30 19:41:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-30 19:41:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4427 transitions. [2023-08-30 19:41:29,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4202582115056009 [2023-08-30 19:41:29,253 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4427 transitions. [2023-08-30 19:41:29,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4427 transitions. [2023-08-30 19:41:29,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:41:29,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4427 transitions. [2023-08-30 19:41:29,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 192.47826086956522) internal successors, (4427), 23 states have internal predecessors, (4427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:29,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 458.0) internal successors, (10992), 24 states have internal predecessors, (10992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:29,282 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 458.0) internal successors, (10992), 24 states have internal predecessors, (10992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:29,282 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 384 flow. Second operand 23 states and 4427 transitions. [2023-08-30 19:41:29,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 655 transitions, 3884 flow [2023-08-30 19:41:29,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 655 transitions, 3864 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-30 19:41:29,378 INFO L231 Difference]: Finished difference. Result has 125 places, 217 transitions, 1483 flow [2023-08-30 19:41:29,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1483, PETRI_PLACES=125, PETRI_TRANSITIONS=217} [2023-08-30 19:41:29,379 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 50 predicate places. [2023-08-30 19:41:29,379 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 217 transitions, 1483 flow [2023-08-30 19:41:29,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 171.15151515151516) internal successors, (5648), 33 states have internal predecessors, (5648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:41:29,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:41:29,381 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-30 19:41:29,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 19:41:29,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:41:29,587 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-30 19:41:29,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:41:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash 906209572, now seen corresponding path program 2 times [2023-08-30 19:41:29,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:41:29,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163501561] [2023-08-30 19:41:29,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:41:29,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:41:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:41:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 19:41:30,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:41:30,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163501561] [2023-08-30 19:41:30,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163501561] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 19:41:30,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327327595] [2023-08-30 19:41:30,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 19:41:30,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:41:30,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:41:30,572 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) [2023-08-30 19:41:30,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 19:41:30,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 19:41:30,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 19:41:30,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 80 conjunts are in the unsatisfiable core [2023-08-30 19:41:30,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 19:41:30,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 19:41:30,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 19:41:30,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 19:41:31,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 19:41:31,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 19:41:31,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:41:31,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 19:41:31,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:41:31,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 19:41:31,790 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 19:41:31,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 19:41:31,794 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 10 [2023-08-30 19:41:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:41:31,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 19:41:32,054 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse0)))) (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse0)) (+ 1 c_~s_2~0))))) is different from false [2023-08-30 19:41:43,468 WARN L222 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:41:59,989 WARN L222 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:44:15,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 19:44:15,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 60 [2023-08-30 19:44:15,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 19:44:15,289 INFO L350 Elim1Store]: Elim1 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 758774 treesize of output 739326 [2023-08-30 19:44:15,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1434 treesize of output 1306 [2023-08-30 19:44:15,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 19:44:15,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1306 treesize of output 1202 [2023-08-30 19:44:15,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1194 treesize of output 1130 [2023-08-30 19:44:15,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 19:44:15,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1130 treesize of output 914 [2023-08-30 19:44:15,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 19:44:15,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 439 treesize of output 420 [2023-08-30 19:44:16,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 19:44:16,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 466 treesize of output 419 [2023-08-30 19:44:17,997 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 19:44:17,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 1 [2023-08-30 19:44:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:44:22,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327327595] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 19:44:22,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 19:44:22,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 19] total 45 [2023-08-30 19:44:22,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405853392] [2023-08-30 19:44:22,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 19:44:22,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-08-30 19:44:22,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:44:22,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-08-30 19:44:22,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1752, Unknown=102, NotChecked=88, Total=2162 [2023-08-30 19:44:22,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 458 [2023-08-30 19:44:22,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 217 transitions, 1483 flow. Second operand has 47 states, 47 states have (on average 152.2127659574468) internal successors, (7154), 47 states have internal predecessors, (7154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:44:22,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:44:22,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 458 [2023-08-30 19:44:22,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 19:44:47,888 WARN L222 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:44:50,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:44:52,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:44:54,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:44:56,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:44:58,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:45:00,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:45:02,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:45:20,382 WARN L222 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:45:22,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:45:24,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:45:26,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:45:28,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:45:31,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:45:59,700 WARN L222 SmtUtils]: Spent 24.21s on a formula simplification. DAG size of input: 68 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:46:01,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:46:04,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:46:06,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:46:08,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:46:10,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:46:12,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:46:14,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:46:16,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:46:18,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:46:20,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:46:22,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:46:33,649 WARN L222 SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 93 DAG size of output: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:46:40,196 WARN L222 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 96 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:46:57,775 WARN L222 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:47:14,538 WARN L222 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:47:28,142 WARN L222 SmtUtils]: Spent 7.10s on a formula simplification. DAG size of input: 83 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:47:30,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:47:32,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:47:34,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:47:36,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:47:38,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:47:40,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:47:43,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:47:56,492 WARN L222 SmtUtils]: Spent 10.29s on a formula simplification. DAG size of input: 73 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:47:57,449 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1 c_~s_2~0)) (.cse5 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (let ((.cse3 (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5))))) (.cse4 (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5)) .cse2))) (.cse1 (+ c_~X_0~0.offset 4)) (.cse0 (< c_~i_3~0 c_~n_1~0))) (and (<= 1 c_~n_1~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (or .cse0 (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|))))) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t3~0.base|) .cse3 (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (or .cse0 (and .cse3 .cse4)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse4 (or .cse0 (and (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5)))) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5)) .cse2)))) (or (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|)))) .cse0) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2023-08-30 19:48:10,478 WARN L222 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 71 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:48:13,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:48:16,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 19:48:18,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 19:48:18,431 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1 c_~s_2~0)) (.cse5 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (let ((.cse0 (< c_~i_3~0 c_~n_1~0)) (.cse3 (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5))))) (.cse4 (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5)) .cse2)))) (and (<= 1 c_~n_1~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (or .cse0 (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|)))))) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t3~0.base|) .cse3 (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (or .cse0 (and .cse3 .cse4)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse4 (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2023-08-30 19:48:54,170 WARN L222 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:49:20,848 WARN L222 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:49:23,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:25,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:27,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:29,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:31,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:35,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:37,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:39,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:41,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:43,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:45,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:47,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:49,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:51,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:53,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:55,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:57,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:49:59,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:02,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:04,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:06,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:08,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:10,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:17,087 WARN L222 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 83 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 19:50:19,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:21,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:23,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:25,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:27,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:29,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:31,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:33,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:35,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:37,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:40,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:42,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:44,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:46,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:50,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:52,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:54,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:56,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:50:58,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:00,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:02,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:06,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:08,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:10,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:13,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:15,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:18,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:21,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:23,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:25,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:29,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:32,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:34,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:40,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 19:51:46,260 INFO L130 PetriNetUnfolder]: 152595/198798 cut-off events. [2023-08-30 19:51:46,260 INFO L131 PetriNetUnfolder]: For 598525/598823 co-relation queries the response was YES. [2023-08-30 19:51:47,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752391 conditions, 198798 events. 152595/198798 cut-off events. For 598525/598823 co-relation queries the response was YES. Maximal size of possible extension queue 4158. Compared 1174803 event pairs, 19163 based on Foata normal form. 292/191292 useless extension candidates. Maximal degree in co-relation 752339. Up to 94924 conditions per place. [2023-08-30 19:51:48,082 INFO L137 encePairwiseOnDemand]: 424/458 looper letters, 1049 selfloop transitions, 376 changer transitions 31/1466 dead transitions. [2023-08-30 19:51:48,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 1466 transitions, 10830 flow [2023-08-30 19:51:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-08-30 19:51:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2023-08-30 19:51:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 9829 transitions. [2023-08-30 19:51:48,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37001204637855745 [2023-08-30 19:51:48,097 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 9829 transitions. [2023-08-30 19:51:48,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 9829 transitions. [2023-08-30 19:51:48,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 19:51:48,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 9829 transitions. [2023-08-30 19:51:48,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 169.4655172413793) internal successors, (9829), 58 states have internal predecessors, (9829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:51:48,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 458.0) internal successors, (27022), 59 states have internal predecessors, (27022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:51:48,144 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 458.0) internal successors, (27022), 59 states have internal predecessors, (27022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:51:48,144 INFO L175 Difference]: Start difference. First operand has 125 places, 217 transitions, 1483 flow. Second operand 58 states and 9829 transitions. [2023-08-30 19:51:48,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 1466 transitions, 10830 flow [2023-08-30 19:52:03,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 1466 transitions, 10737 flow, removed 43 selfloop flow, removed 2 redundant places. [2023-08-30 19:52:03,866 INFO L231 Difference]: Finished difference. Result has 225 places, 594 transitions, 5890 flow [2023-08-30 19:52:03,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=5890, PETRI_PLACES=225, PETRI_TRANSITIONS=594} [2023-08-30 19:52:03,867 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 150 predicate places. [2023-08-30 19:52:03,867 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 594 transitions, 5890 flow [2023-08-30 19:52:03,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 152.2127659574468) internal successors, (7154), 47 states have internal predecessors, (7154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:52:03,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 19:52:03,869 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-30 19:52:03,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 19:52:04,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:52:04,076 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-30 19:52:04,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 19:52:04,077 INFO L85 PathProgramCache]: Analyzing trace with hash 35489382, now seen corresponding path program 3 times [2023-08-30 19:52:04,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 19:52:04,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853267975] [2023-08-30 19:52:04,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 19:52:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 19:52:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 19:52:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 19:52:05,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 19:52:05,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853267975] [2023-08-30 19:52:05,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853267975] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 19:52:05,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521092054] [2023-08-30 19:52:05,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 19:52:05,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 19:52:05,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 19:52:05,977 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) [2023-08-30 19:52:05,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 19:52:06,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 19:52:06,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 19:52:06,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 68 conjunts are in the unsatisfiable core [2023-08-30 19:52:06,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 19:52:07,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:52:07,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 19:52:07,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 19:52:07,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 19:52:07,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 19:52:07,239 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 15 [2023-08-30 19:52:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:52:07,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 19:53:52,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 19:53:52,369 INFO L350 Elim1Store]: Elim1 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 234 treesize of output 156 [2023-08-30 19:53:52,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 25 [2023-08-30 19:53:52,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 24 [2023-08-30 19:53:52,493 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 19:53:52,494 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 19:53:52,504 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-30 19:53:52,504 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-08-30 19:53:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 19:53:57,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521092054] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 19:53:57,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 19:53:57,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2023-08-30 19:53:57,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983085817] [2023-08-30 19:53:57,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 19:53:57,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-08-30 19:53:57,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 19:53:57,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-08-30 19:53:57,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1746, Unknown=75, NotChecked=0, Total=1980 [2023-08-30 19:53:59,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 458 [2023-08-30 19:53:59,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 594 transitions, 5890 flow. Second operand has 45 states, 45 states have (on average 148.73333333333332) internal successors, (6693), 45 states have internal predecessors, (6693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 19:53:59,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 19:53:59,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 458 [2023-08-30 19:53:59,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15