./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/popl20-min-max-inc-dec.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 a1648913be4b4e88120f8ece4966a58804b334c451c87254dfc42f8e396f396f --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 13:31:25,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 13:31:25,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 13:31:25,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 13:31:25,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 13:31:25,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 13:31:25,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 13:31:25,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 13:31:25,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 13:31:25,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 13:31:25,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 13:31:25,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 13:31:25,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 13:31:25,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 13:31:25,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 13:31:25,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 13:31:25,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 13:31:25,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 13:31:25,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 13:31:25,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 13:31:25,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 13:31:25,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 13:31:25,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 13:31:25,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 13:31:25,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 13:31:25,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 13:31:25,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 13:31:25,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 13:31:25,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 13:31:25,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 13:31:25,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 13:31:25,309 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 13:31:25,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 13:31:25,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 13:31:25,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 13:31:25,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 13:31:25,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 13:31:25,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 13:31:25,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 13:31:25,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 13:31:25,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 13:31:25,314 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 13:31:25,335 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 13:31:25,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 13:31:25,336 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 13:31:25,337 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 13:31:25,337 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 13:31:25,337 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 13:31:25,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 13:31:25,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 13:31:25,338 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 13:31:25,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 13:31:25,339 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 13:31:25,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 13:31:25,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 13:31:25,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 13:31:25,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 13:31:25,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 13:31:25,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 13:31:25,340 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 13:31:25,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 13:31:25,340 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 13:31:25,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 13:31:25,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 13:31:25,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 13:31:25,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 13:31:25,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:31:25,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 13:31:25,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 13:31:25,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 13:31:25,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 13:31:25,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 13:31:25,342 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 13:31:25,342 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 13:31:25,343 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 13:31:25,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 13:31:25,343 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 13:31:25,343 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 -> a1648913be4b4e88120f8ece4966a58804b334c451c87254dfc42f8e396f396f 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 -> BEFORE [2023-09-01 13:31:25,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 13:31:25,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 13:31:25,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 13:31:25,592 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 13:31:25,592 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 13:31:25,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c [2023-09-01 13:31:26,590 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 13:31:26,760 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 13:31:26,761 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c [2023-09-01 13:31:26,770 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4d1a142/12c42e5f800c41ff8dedb54d26f2f3c9/FLAG874c719cb [2023-09-01 13:31:26,780 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4d1a142/12c42e5f800c41ff8dedb54d26f2f3c9 [2023-09-01 13:31:26,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 13:31:26,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 13:31:26,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 13:31:26,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 13:31:26,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 13:31:26,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:31:26" (1/1) ... [2023-09-01 13:31:26,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fcec6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:26, skipping insertion in model container [2023-09-01 13:31:26,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:31:26" (1/1) ... [2023-09-01 13:31:26,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 13:31:26,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 13:31:26,939 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/popl20-min-max-inc-dec.wvr.c[3271,3284] [2023-09-01 13:31:26,958 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:31:26,965 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 13:31:26,990 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/popl20-min-max-inc-dec.wvr.c[3271,3284] [2023-09-01 13:31:26,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:31:26,998 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:31:26,999 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:31:27,003 INFO L208 MainTranslator]: Completed translation [2023-09-01 13:31:27,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:27 WrapperNode [2023-09-01 13:31:27,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 13:31:27,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 13:31:27,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 13:31:27,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 13:31:27,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:27" (1/1) ... [2023-09-01 13:31:27,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:27" (1/1) ... [2023-09-01 13:31:27,055 INFO L138 Inliner]: procedures = 27, calls = 75, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 176 [2023-09-01 13:31:27,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 13:31:27,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 13:31:27,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 13:31:27,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 13:31:27,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:27" (1/1) ... [2023-09-01 13:31:27,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:27" (1/1) ... [2023-09-01 13:31:27,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:27" (1/1) ... [2023-09-01 13:31:27,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:27" (1/1) ... [2023-09-01 13:31:27,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:27" (1/1) ... [2023-09-01 13:31:27,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:27" (1/1) ... [2023-09-01 13:31:27,094 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:27" (1/1) ... [2023-09-01 13:31:27,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:27" (1/1) ... [2023-09-01 13:31:27,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 13:31:27,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 13:31:27,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 13:31:27,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 13:31:27,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:27" (1/1) ... [2023-09-01 13:31:27,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:31:27,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:31:27,162 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-09-01 13:31:27,219 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-09-01 13:31:27,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 13:31:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 13:31:27,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 13:31:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 13:31:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 13:31:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 13:31:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 13:31:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 13:31:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 13:31:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 13:31:27,229 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-09-01 13:31:27,230 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-09-01 13:31:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 13:31:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-09-01 13:31:27,230 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-09-01 13:31:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 13:31:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 13:31:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-01 13:31:27,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 13:31:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 13:31:27,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 13:31:27,232 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 13:31:27,326 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 13:31:27,328 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 13:31:27,575 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 13:31:27,660 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 13:31:27,663 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-09-01 13:31:27,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:31:27 BoogieIcfgContainer [2023-09-01 13:31:27,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 13:31:27,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 13:31:27,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 13:31:27,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 13:31:27,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 01:31:26" (1/3) ... [2023-09-01 13:31:27,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2315a7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:31:27, skipping insertion in model container [2023-09-01 13:31:27,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:31:27" (2/3) ... [2023-09-01 13:31:27,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2315a7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:31:27, skipping insertion in model container [2023-09-01 13:31:27,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:31:27" (3/3) ... [2023-09-01 13:31:27,694 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc-dec.wvr.c [2023-09-01 13:31:27,699 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 13:31:27,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 13:31:27,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 13:31:27,706 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 13:31:27,767 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-09-01 13:31:27,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 185 transitions, 410 flow [2023-09-01 13:31:27,843 INFO L130 PetriNetUnfolder]: 14/180 cut-off events. [2023-09-01 13:31:27,843 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-09-01 13:31:27,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 180 events. 14/180 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 133 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2023-09-01 13:31:27,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 185 transitions, 410 flow [2023-09-01 13:31:27,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 166 transitions, 362 flow [2023-09-01 13:31:27,860 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 13:31:27,873 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 166 transitions, 362 flow [2023-09-01 13:31:27,875 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 166 transitions, 362 flow [2023-09-01 13:31:27,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 166 transitions, 362 flow [2023-09-01 13:31:27,899 INFO L130 PetriNetUnfolder]: 14/166 cut-off events. [2023-09-01 13:31:27,899 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-09-01 13:31:27,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 166 events. 14/166 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 134 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2023-09-01 13:31:27,902 INFO L119 LiptonReduction]: Number of co-enabled transitions 3806 [2023-09-01 13:31:33,748 INFO L134 LiptonReduction]: Checked pairs total: 5582 [2023-09-01 13:31:33,748 INFO L136 LiptonReduction]: Total number of compositions: 149 [2023-09-01 13:31:33,775 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 13:31:33,780 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;@5d6472ea, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 13:31:33,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-09-01 13:31:33,786 INFO L130 PetriNetUnfolder]: 5/37 cut-off events. [2023-09-01 13:31:33,786 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-09-01 13:31:33,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:31:33,787 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] [2023-09-01 13:31:33,787 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 13:31:33,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:31:33,791 INFO L85 PathProgramCache]: Analyzing trace with hash 177751736, now seen corresponding path program 1 times [2023-09-01 13:31:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:31:33,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676357596] [2023-09-01 13:31:33,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:31:33,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:31:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:31:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:31:34,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:31:34,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676357596] [2023-09-01 13:31:34,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676357596] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:31:34,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:31:34,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 13:31:34,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389943438] [2023-09-01 13:31:34,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:31:34,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:31:34,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:31:34,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:31:34,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:31:34,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 334 [2023-09-01 13:31:34,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:31:34,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:31:34,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 334 [2023-09-01 13:31:34,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:31:34,819 INFO L130 PetriNetUnfolder]: 6110/7594 cut-off events. [2023-09-01 13:31:34,819 INFO L131 PetriNetUnfolder]: For 359/359 co-relation queries the response was YES. [2023-09-01 13:31:34,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15782 conditions, 7594 events. 6110/7594 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 30132 event pairs, 2980 based on Foata normal form. 0/5304 useless extension candidates. Maximal degree in co-relation 13404. Up to 6012 conditions per place. [2023-09-01 13:31:34,850 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 52 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-09-01 13:31:34,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 266 flow [2023-09-01 13:31:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:31:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:31:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 672 transitions. [2023-09-01 13:31:34,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029940119760479 [2023-09-01 13:31:34,861 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 672 transitions. [2023-09-01 13:31:34,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 672 transitions. [2023-09-01 13:31:34,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:31:34,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 672 transitions. [2023-09-01 13:31:34,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 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-09-01 13:31:34,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-09-01 13:31:34,872 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-09-01 13:31:34,873 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 106 flow. Second operand 4 states and 672 transitions. [2023-09-01 13:31:34,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 266 flow [2023-09-01 13:31:34,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 10 redundant places. [2023-09-01 13:31:34,883 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 100 flow [2023-09-01 13:31:34,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-09-01 13:31:34,886 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2023-09-01 13:31:34,887 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 100 flow [2023-09-01 13:31:34,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:31:34,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:31:34,887 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] [2023-09-01 13:31:34,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 13:31:34,888 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 13:31:34,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:31:34,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2063376111, now seen corresponding path program 1 times [2023-09-01 13:31:34,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:31:34,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399505838] [2023-09-01 13:31:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:31:34,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:31:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:31:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:31:34,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:31:34,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399505838] [2023-09-01 13:31:34,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399505838] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:31:34,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:31:34,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 13:31:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327460474] [2023-09-01 13:31:34,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:31:34,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:31:34,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:31:34,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:31:34,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:31:35,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 334 [2023-09-01 13:31:35,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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-09-01 13:31:35,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:31:35,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 334 [2023-09-01 13:31:35,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:31:35,611 INFO L130 PetriNetUnfolder]: 7432/9228 cut-off events. [2023-09-01 13:31:35,611 INFO L131 PetriNetUnfolder]: For 1669/1669 co-relation queries the response was YES. [2023-09-01 13:31:35,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20378 conditions, 9228 events. 7432/9228 cut-off events. For 1669/1669 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 37509 event pairs, 3779 based on Foata normal form. 0/6511 useless extension candidates. Maximal degree in co-relation 6677. Up to 7480 conditions per place. [2023-09-01 13:31:35,650 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 54 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-09-01 13:31:35,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 268 flow [2023-09-01 13:31:35,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:31:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:31:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 672 transitions. [2023-09-01 13:31:35,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029940119760479 [2023-09-01 13:31:35,653 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 672 transitions. [2023-09-01 13:31:35,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 672 transitions. [2023-09-01 13:31:35,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:31:35,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 672 transitions. [2023-09-01 13:31:35,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 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-09-01 13:31:35,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-09-01 13:31:35,657 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-09-01 13:31:35,657 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 100 flow. Second operand 4 states and 672 transitions. [2023-09-01 13:31:35,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 268 flow [2023-09-01 13:31:35,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 258 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-09-01 13:31:35,660 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 108 flow [2023-09-01 13:31:35,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-09-01 13:31:35,661 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2023-09-01 13:31:35,661 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 108 flow [2023-09-01 13:31:35,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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-09-01 13:31:35,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:31:35,662 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] [2023-09-01 13:31:35,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 13:31:35,662 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 13:31:35,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:31:35,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1327335702, now seen corresponding path program 1 times [2023-09-01 13:31:35,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:31:35,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352931981] [2023-09-01 13:31:35,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:31:35,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:31:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:31:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:31:35,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:31:35,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352931981] [2023-09-01 13:31:35,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352931981] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:31:35,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:31:35,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 13:31:35,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751888372] [2023-09-01 13:31:35,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:31:35,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:31:35,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:31:35,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:31:35,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:31:35,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 334 [2023-09-01 13:31:35,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 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-09-01 13:31:35,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:31:35,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 334 [2023-09-01 13:31:35,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:31:36,400 INFO L130 PetriNetUnfolder]: 9317/11685 cut-off events. [2023-09-01 13:31:36,400 INFO L131 PetriNetUnfolder]: For 2961/2961 co-relation queries the response was YES. [2023-09-01 13:31:36,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27111 conditions, 11685 events. 9317/11685 cut-off events. For 2961/2961 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 47277 event pairs, 4111 based on Foata normal form. 0/8912 useless extension candidates. Maximal degree in co-relation 12566. Up to 8724 conditions per place. [2023-09-01 13:31:36,442 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 59 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-09-01 13:31:36,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 298 flow [2023-09-01 13:31:36,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:31:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:31:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 675 transitions. [2023-09-01 13:31:36,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052395209580839 [2023-09-01 13:31:36,444 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 675 transitions. [2023-09-01 13:31:36,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 675 transitions. [2023-09-01 13:31:36,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:31:36,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 675 transitions. [2023-09-01 13:31:36,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 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-09-01 13:31:36,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-09-01 13:31:36,448 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-09-01 13:31:36,448 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 108 flow. Second operand 4 states and 675 transitions. [2023-09-01 13:31:36,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 298 flow [2023-09-01 13:31:36,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 288 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-09-01 13:31:36,452 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 116 flow [2023-09-01 13:31:36,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2023-09-01 13:31:36,453 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2023-09-01 13:31:36,455 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 116 flow [2023-09-01 13:31:36,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 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-09-01 13:31:36,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:31:36,456 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] [2023-09-01 13:31:36,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 13:31:36,456 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 13:31:36,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:31:36,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1929929813, now seen corresponding path program 1 times [2023-09-01 13:31:36,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:31:36,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484659182] [2023-09-01 13:31:36,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:31:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:31:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:31:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 13:31:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:31:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484659182] [2023-09-01 13:31:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484659182] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:31:36,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:31:36,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 13:31:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846879075] [2023-09-01 13:31:36,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:31:36,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:31:36,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:31:36,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:31:36,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:31:36,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 334 [2023-09-01 13:31:36,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 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-09-01 13:31:36,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:31:36,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 334 [2023-09-01 13:31:36,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:31:37,199 INFO L130 PetriNetUnfolder]: 8748/11085 cut-off events. [2023-09-01 13:31:37,200 INFO L131 PetriNetUnfolder]: For 3227/3953 co-relation queries the response was YES. [2023-09-01 13:31:37,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28117 conditions, 11085 events. 8748/11085 cut-off events. For 3227/3953 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 44716 event pairs, 4945 based on Foata normal form. 726/9683 useless extension candidates. Maximal degree in co-relation 9657. Up to 8498 conditions per place. [2023-09-01 13:31:37,239 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 61 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-09-01 13:31:37,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 315 flow [2023-09-01 13:31:37,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:31:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:31:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 675 transitions. [2023-09-01 13:31:37,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052395209580839 [2023-09-01 13:31:37,241 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 675 transitions. [2023-09-01 13:31:37,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 675 transitions. [2023-09-01 13:31:37,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:31:37,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 675 transitions. [2023-09-01 13:31:37,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 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-09-01 13:31:37,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-09-01 13:31:37,245 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 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-09-01 13:31:37,245 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 116 flow. Second operand 4 states and 675 transitions. [2023-09-01 13:31:37,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 315 flow [2023-09-01 13:31:37,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 306 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-09-01 13:31:37,248 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 124 flow [2023-09-01 13:31:37,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-09-01 13:31:37,248 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2023-09-01 13:31:37,249 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 124 flow [2023-09-01 13:31:37,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 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-09-01 13:31:37,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:31:37,249 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] [2023-09-01 13:31:37,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 13:31:37,250 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 13:31:37,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:31:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1825103121, now seen corresponding path program 1 times [2023-09-01 13:31:37,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:31:37,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481110596] [2023-09-01 13:31:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:31:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:31:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:31:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:31:37,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:31:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481110596] [2023-09-01 13:31:37,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481110596] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:31:37,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:31:37,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 13:31:37,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737257189] [2023-09-01 13:31:37,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:31:37,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 13:31:37,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:31:37,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 13:31:37,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 13:31:37,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 334 [2023-09-01 13:31:37,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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-09-01 13:31:37,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:31:37,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 334 [2023-09-01 13:31:37,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:31:37,862 INFO L130 PetriNetUnfolder]: 6702/8564 cut-off events. [2023-09-01 13:31:37,863 INFO L131 PetriNetUnfolder]: For 2867/3870 co-relation queries the response was YES. [2023-09-01 13:31:37,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22689 conditions, 8564 events. 6702/8564 cut-off events. For 2867/3870 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 34262 event pairs, 4945 based on Foata normal form. 1003/7780 useless extension candidates. Maximal degree in co-relation 7845. Up to 8499 conditions per place. [2023-09-01 13:31:37,901 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 39 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-09-01 13:31:37,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 208 flow [2023-09-01 13:31:37,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 13:31:37,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 13:31:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2023-09-01 13:31:37,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501996007984032 [2023-09-01 13:31:37,904 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 503 transitions. [2023-09-01 13:31:37,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions. [2023-09-01 13:31:37,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:31:37,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions. [2023-09-01 13:31:37,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:31:37,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 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-09-01 13:31:37,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 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-09-01 13:31:37,907 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 124 flow. Second operand 3 states and 503 transitions. [2023-09-01 13:31:37,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 208 flow [2023-09-01 13:31:37,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 13:31:37,911 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 130 flow [2023-09-01 13:31:37,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-09-01 13:31:37,912 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-09-01 13:31:37,912 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 130 flow [2023-09-01 13:31:37,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 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-09-01 13:31:37,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:31:37,913 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] [2023-09-01 13:31:37,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 13:31:37,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 13:31:37,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:31:37,913 INFO L85 PathProgramCache]: Analyzing trace with hash 865740571, now seen corresponding path program 1 times [2023-09-01 13:31:37,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:31:37,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225396075] [2023-09-01 13:31:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:31:37,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:31:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:31:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:31:38,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:31:38,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225396075] [2023-09-01 13:31:38,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225396075] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:31:38,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611134432] [2023-09-01 13:31:38,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:31:38,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:31:38,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:31:38,600 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-09-01 13:31:38,603 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-09-01 13:31:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:31:38,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 50 conjunts are in the unsatisfiable core [2023-09-01 13:31:38,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:31:38,802 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-09-01 13:31:38,832 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-09-01 13:31:38,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:31:38,889 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-09-01 13:31:38,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:31:38,989 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 21 treesize of output 21 [2023-09-01 13:31:39,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2023-09-01 13:31:39,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:31:39,160 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 23 treesize of output 23 [2023-09-01 13:31:39,218 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 26 treesize of output 14 [2023-09-01 13:31:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:31:39,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:31:41,938 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse0 (select .cse1 c_~A~0.base))) (or (< 2147483645 v_ArrVal_284) (< v_ArrVal_284 (+ (select .cse0 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse1 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0) (< (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ v_ArrVal_284 1)) (< c_~min~0 (+ v_ArrVal_284 3)))))) (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse2 (select .cse3 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (< v_ArrVal_284 (+ (select .cse2 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse3 c_~A~0.base (store .cse2 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0) (<= c_~min~0 (+ v_ArrVal_284 1))))))) is different from false [2023-09-01 13:31:42,435 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_281 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse0 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse0) (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse1 (select .cse2 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (<= .cse0 (+ v_ArrVal_284 1)) (< v_ArrVal_284 (+ (select .cse1 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0))))))))) (forall ((v_ArrVal_281 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (or (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse4 (select .cse5 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (<= c_~min~0 (+ v_ArrVal_284 1)) (< v_ArrVal_284 (+ (select .cse4 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse5 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0))))) (<= (select (select .cse6 c_~A~0.base) c_~A~0.offset) c_~min~0)))) (forall ((v_ArrVal_281 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse7 (select (select .cse10 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse7) (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse8 (select .cse9 c_~A~0.base))) (or (< 2147483645 v_ArrVal_284) (< .cse7 (+ v_ArrVal_284 3)) (< v_ArrVal_284 (+ (select .cse8 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse9 c_~A~0.base (store .cse8 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0))))))))) (forall ((v_ArrVal_281 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (or (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse11 (select .cse12 c_~A~0.base))) (or (< 2147483645 v_ArrVal_284) (< v_ArrVal_284 (+ (select .cse11 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse12 c_~A~0.base (store .cse11 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0) (< c_~min~0 (+ v_ArrVal_284 3)))))) (<= (select (select .cse13 c_~A~0.base) c_~A~0.offset) c_~min~0))))) is different from false [2023-09-01 13:31:42,568 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1))) (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse0 (select (select .cse4 c_~A~0.base) c_~A~0.offset)) (.cse2 (select .cse3 c_~A~0.base))) (or (< .cse0 .cse1) (<= 2147483647 v_ArrVal_284) (< .cse0 (+ v_ArrVal_284 3)) (< v_ArrVal_284 (+ (select .cse2 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse3 c_~A~0.base (store .cse2 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0)))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse7 (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse6 (select .cse7 c_~A~0.base))) (or (< 2147483645 v_ArrVal_284) (< (select (select .cse5 c_~A~0.base) c_~A~0.offset) (+ v_ArrVal_284 3)) (< v_ArrVal_284 (+ (select .cse6 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse7 c_~A~0.base (store .cse6 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0)))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse9 (select .cse10 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (<= (select (select .cse8 c_~A~0.base) c_~A~0.offset) (+ v_ArrVal_284 1)) (< v_ArrVal_284 (+ (select .cse9 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse10 c_~A~0.base (store .cse9 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0)))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse12 (select .cse13 c_~A~0.base)) (.cse11 (select (select .cse14 c_~A~0.base) c_~A~0.offset))) (or (< .cse11 .cse1) (< 2147483645 v_ArrVal_284) (< v_ArrVal_284 (+ (select .cse12 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse13 c_~A~0.base (store .cse12 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0) (< .cse11 (+ v_ArrVal_284 4))))))))) is different from false [2023-09-01 13:31:42,759 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< v_ArrVal_284 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (<= 2147483647 v_ArrVal_284) (<= (+ (select (select (store (store .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648) 0) (<= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ v_ArrVal_284 1))))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< v_ArrVal_284 (+ (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< 2147483645 v_ArrVal_284) (<= (+ (select (select (store (store .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648) 0) (< .cse5 (+ (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< .cse5 (+ v_ArrVal_284 4)))))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280))) (let ((.cse12 (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse10 (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse9 (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< v_ArrVal_284 (+ (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (<= 2147483647 v_ArrVal_284) (< .cse9 (+ v_ArrVal_284 3)) (<= (+ (select (select (store (store .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648) 0) (< .cse9 (+ (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse15 (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< v_ArrVal_284 (+ (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ v_ArrVal_284 3)) (< 2147483645 v_ArrVal_284) (<= (+ (select (select (store (store .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648) 0))))))) is different from false [2023-09-01 13:31:42,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:31:42,793 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 166 treesize of output 106 [2023-09-01 13:31:42,809 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 955 treesize of output 927 [2023-09-01 13:31:42,838 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 152 treesize of output 140 [2023-09-01 13:31:42,847 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 100 treesize of output 94 [2023-09-01 13:31:42,871 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 246 treesize of output 230 [2023-09-01 13:31:42,881 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 62 treesize of output 54 [2023-09-01 13:31:42,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:31:42,942 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 120 treesize of output 84 [2023-09-01 13:31:42,950 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 1684 treesize of output 1660 [2023-09-01 13:31:42,979 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 89 treesize of output 85 [2023-09-01 13:31:42,988 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-09-01 13:31:42,997 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 246 treesize of output 230 [2023-09-01 13:31:43,005 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 87 treesize of output 79 [2023-09-01 13:31:43,059 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-01 13:31:43,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 1 [2023-09-01 13:31:43,064 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-09-01 13:31:43,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 1 [2023-09-01 13:31:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-09-01 13:31:43,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611134432] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:31:43,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:31:43,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 17] total 41 [2023-09-01 13:31:43,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617210382] [2023-09-01 13:31:43,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:31:43,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-09-01 13:31:43,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:31:43,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-09-01 13:31:43,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1246, Unknown=24, NotChecked=308, Total=1806 [2023-09-01 13:31:43,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 334 [2023-09-01 13:31:43,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 130 flow. Second operand has 43 states, 43 states have (on average 100.65116279069767) internal successors, (4328), 43 states have internal predecessors, (4328), 0 states have call successors, (0), 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-09-01 13:31:43,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:31:43,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 334 [2023-09-01 13:31:43,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:32:06,297 WARN L222 SmtUtils]: Spent 22.26s on a formula simplification. DAG size of input: 102 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:32:28,753 WARN L222 SmtUtils]: Spent 22.23s on a formula simplification. DAG size of input: 104 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:32:56,085 WARN L222 SmtUtils]: Spent 26.25s on a formula simplification. DAG size of input: 150 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:33:15,937 WARN L222 SmtUtils]: Spent 18.01s on a formula simplification. DAG size of input: 78 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:33:41,686 WARN L222 SmtUtils]: Spent 23.62s on a formula simplification. DAG size of input: 76 DAG size of output: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:34:16,170 WARN L222 SmtUtils]: Spent 34.29s on a formula simplification. DAG size of input: 151 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:34:18,579 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-09-01 13:34:19,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:34:25,447 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-09-01 13:34:49,951 WARN L222 SmtUtils]: Spent 20.06s on a formula simplification. DAG size of input: 115 DAG size of output: 93 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:35:12,865 WARN L222 SmtUtils]: Spent 17.61s on a formula simplification. DAG size of input: 74 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:35:14,947 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-09-01 13:35:30,985 WARN L222 SmtUtils]: Spent 7.50s on a formula simplification. DAG size of input: 81 DAG size of output: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:35:33,020 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-09-01 13:35:35,028 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-09-01 13:35:37,055 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-09-01 13:35:39,236 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-09-01 13:35:41,244 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-09-01 13:36:32,411 WARN L222 SmtUtils]: Spent 40.82s on a formula simplification. DAG size of input: 139 DAG size of output: 117 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:36:34,493 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-09-01 13:36:36,561 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-09-01 13:36:38,568 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-09-01 13:37:03,828 WARN L222 SmtUtils]: Spent 22.30s on a formula simplification. DAG size of input: 104 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:37:17,575 WARN L222 SmtUtils]: Spent 12.59s on a formula simplification. DAG size of input: 80 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:37:20,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:37:22,178 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-09-01 13:37:24,185 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-09-01 13:37:26,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:38:02,754 WARN L222 SmtUtils]: Spent 34.33s on a formula simplification. DAG size of input: 115 DAG size of output: 106 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:38:04,758 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-09-01 13:38:06,764 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-09-01 13:38:08,771 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-09-01 13:38:10,848 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-09-01 13:38:12,855 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-09-01 13:38:29,641 WARN L222 SmtUtils]: Spent 12.31s on a formula simplification. DAG size of input: 113 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:38:36,067 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-09-01 13:38:38,304 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-09-01 13:39:29,172 WARN L222 SmtUtils]: Spent 46.46s on a formula simplification. DAG size of input: 127 DAG size of output: 94 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:39:31,191 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-09-01 13:39:33,200 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-09-01 13:39:35,209 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-09-01 13:39:37,230 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-09-01 13:39:39,236 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-09-01 13:39:41,267 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-09-01 13:39:43,276 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-09-01 13:39:58,303 WARN L222 SmtUtils]: Spent 14.51s on a formula simplification. DAG size of input: 78 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:40:00,326 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-09-01 13:40:22,699 WARN L222 SmtUtils]: Spent 22.26s on a formula simplification. DAG size of input: 106 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:40:26,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:40:28,127 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-09-01 13:40:30,132 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-09-01 13:40:32,141 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-09-01 13:40:40,534 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-09-01 13:40:42,895 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-09-01 13:40:44,901 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-09-01 13:41:29,613 WARN L222 SmtUtils]: Spent 40.47s on a formula simplification. DAG size of input: 154 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:41:31,628 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-09-01 13:41:33,678 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-09-01 13:41:35,814 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-09-01 13:41:37,826 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-09-01 13:41:39,834 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-09-01 13:41:46,314 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-09-01 13:41:56,621 WARN L222 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 79 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:41:58,699 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-09-01 13:42:00,710 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-09-01 13:42:02,718 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-09-01 13:42:04,724 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-09-01 13:42:06,734 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-09-01 13:42:08,742 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-09-01 13:42:10,750 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-09-01 13:42:12,755 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-09-01 13:42:14,763 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-09-01 13:42:16,769 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-09-01 13:42:18,780 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-09-01 13:42:21,058 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-09-01 13:42:23,065 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-09-01 13:42:25,074 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-09-01 13:42:27,082 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-09-01 13:42:29,089 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-09-01 13:42:31,096 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-09-01 13:42:33,108 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-09-01 13:42:35,129 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-09-01 13:42:37,175 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-09-01 13:42:39,187 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-09-01 13:42:41,218 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-09-01 13:43:10,514 WARN L222 SmtUtils]: Spent 24.29s on a formula simplification. DAG size of input: 152 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:43:41,995 WARN L222 SmtUtils]: Spent 20.50s on a formula simplification. DAG size of input: 117 DAG size of output: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:43:44,099 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-09-01 13:43:45,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-09-01 13:44:38,544 WARN L222 SmtUtils]: Spent 34.55s on a formula simplification. DAG size of input: 137 DAG size of output: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:44:40,561 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-09-01 13:44:42,566 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-09-01 13:45:04,985 WARN L222 SmtUtils]: Spent 18.22s on a formula simplification. DAG size of input: 113 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:45:06,990 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-09-01 13:45:09,007 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-09-01 13:45:18,342 WARN L222 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 78 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 13:45:20,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-09-01 13:45:22,412 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] Killed by 15