./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a --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 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:49:26,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:49:26,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:49:26,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:49:26,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:49:26,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:49:26,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:49:26,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:49:26,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:49:26,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:49:26,275 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:49:26,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:49:26,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:49:26,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:49:26,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:49:26,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:49:26,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:49:26,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:49:26,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:49:26,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:49:26,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:49:26,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:49:26,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:49:26,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:49:26,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:49:26,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:49:26,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:49:26,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:49:26,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:49:26,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:49:26,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:49:26,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:49:26,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:49:26,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:49:26,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:49:26,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:49:26,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:49:26,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:49:26,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:49:26,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:49:26,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:49:26,332 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 13:49:26,371 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:49:26,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:49:26,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:49:26,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:49:26,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:49:26,374 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:49:26,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:49:26,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:49:26,375 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:49:26,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:49:26,377 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:49:26,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:49:26,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:49:26,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:49:26,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 13:49:26,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:49:26,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 13:49:26,378 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:49:26,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 13:49:26,379 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:49:26,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 13:49:26,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:49:26,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:49:26,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:49:26,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:49:26,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:49:26,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:49:26,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 13:49:26,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:49:26,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:49:26,382 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 13:49:26,383 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 13:49:26,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 13:49:26,383 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a 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 -> 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c [2022-11-21 13:49:26,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:49:26,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:49:26,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:49:26,749 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:49:26,750 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:49:26,751 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-11-21 13:49:29,799 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:49:30,082 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:49:30,083 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-11-21 13:49:30,090 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/data/0c99737ca/35559f8eded34603abe67c7dd3dac696/FLAGf88eabb2d [2022-11-21 13:49:30,113 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/data/0c99737ca/35559f8eded34603abe67c7dd3dac696 [2022-11-21 13:49:30,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:49:30,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:49:30,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:49:30,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:49:30,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:49:30,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:49:30" (1/1) ... [2022-11-21 13:49:30,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe38b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30, skipping insertion in model container [2022-11-21 13:49:30,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:49:30" (1/1) ... [2022-11-21 13:49:30,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:49:30,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:49:30,312 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-21 13:49:30,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:49:30,332 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:49:30,355 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-21 13:49:30,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:49:30,373 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:49:30,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30 WrapperNode [2022-11-21 13:49:30,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:49:30,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:49:30,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:49:30,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:49:30,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30" (1/1) ... [2022-11-21 13:49:30,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30" (1/1) ... [2022-11-21 13:49:30,414 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-21 13:49:30,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:49:30,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:49:30,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:49:30,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:49:30,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30" (1/1) ... [2022-11-21 13:49:30,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30" (1/1) ... [2022-11-21 13:49:30,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30" (1/1) ... [2022-11-21 13:49:30,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30" (1/1) ... [2022-11-21 13:49:30,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30" (1/1) ... [2022-11-21 13:49:30,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30" (1/1) ... [2022-11-21 13:49:30,440 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30" (1/1) ... [2022-11-21 13:49:30,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30" (1/1) ... [2022-11-21 13:49:30,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:49:30,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:49:30,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:49:30,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:49:30,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30" (1/1) ... [2022-11-21 13:49:30,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:49:30,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:49:30,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:49:30,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:49:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:49:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-21 13:49:30,522 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-21 13:49:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-21 13:49:30,523 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-21 13:49:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-21 13:49:30,523 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-21 13:49:30,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:49:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:49:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:49:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 13:49:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 13:49:30,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:49:30,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:49:30,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:49:30,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:49:30,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:49:30,527 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 13:49:30,635 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:49:30,638 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:49:30,991 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:49:31,108 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:49:31,108 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-21 13:49:31,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:49:31 BoogieIcfgContainer [2022-11-21 13:49:31,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:49:31,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:49:31,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:49:31,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:49:31,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:49:30" (1/3) ... [2022-11-21 13:49:31,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2253933b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:49:31, skipping insertion in model container [2022-11-21 13:49:31,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:49:30" (2/3) ... [2022-11-21 13:49:31,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2253933b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:49:31, skipping insertion in model container [2022-11-21 13:49:31,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:49:31" (3/3) ... [2022-11-21 13:49:31,131 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-11-21 13:49:31,140 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 13:49:31,153 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:49:31,153 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 13:49:31,154 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 13:49:31,244 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-21 13:49:31,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 154 transitions, 332 flow [2022-11-21 13:49:31,370 INFO L130 PetriNetUnfolder]: 12/151 cut-off events. [2022-11-21 13:49:31,370 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 13:49:31,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 12/151 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-11-21 13:49:31,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 154 transitions, 332 flow [2022-11-21 13:49:31,382 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 140 transitions, 298 flow [2022-11-21 13:49:31,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:49:31,401 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;@3d9f1030, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:49:31,402 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-21 13:49:31,512 INFO L130 PetriNetUnfolder]: 12/139 cut-off events. [2022-11-21 13:49:31,512 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 13:49:31,513 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:31,513 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:31,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 13:49:31,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 405465620, now seen corresponding path program 1 times [2022-11-21 13:49:31,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:31,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664260169] [2022-11-21 13:49:31,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:31,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:31,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:31,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664260169] [2022-11-21 13:49:31,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664260169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:31,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:31,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:49:31,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679565458] [2022-11-21 13:49:31,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:31,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:49:31,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:31,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:49:31,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:49:31,987 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 154 [2022-11-21 13:49:31,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 140 transitions, 298 flow. Second operand has 2 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:31,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:31,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 154 [2022-11-21 13:49:32,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:32,126 INFO L130 PetriNetUnfolder]: 41/265 cut-off events. [2022-11-21 13:49:32,126 INFO L131 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2022-11-21 13:49:32,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 265 events. 41/265 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 715 event pairs, 15 based on Foata normal form. 42/276 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-11-21 13:49:32,132 INFO L137 encePairwiseOnDemand]: 146/154 looper letters, 9 selfloop transitions, 0 changer transitions 4/132 dead transitions. [2022-11-21 13:49:32,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 132 transitions, 300 flow [2022-11-21 13:49:32,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:49:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 13:49:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 289 transitions. [2022-11-21 13:49:32,147 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9383116883116883 [2022-11-21 13:49:32,148 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 289 transitions. [2022-11-21 13:49:32,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 289 transitions. [2022-11-21 13:49:32,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:32,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 289 transitions. [2022-11-21 13:49:32,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:32,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:32,162 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:32,165 INFO L175 Difference]: Start difference. First operand has 138 places, 140 transitions, 298 flow. Second operand 2 states and 289 transitions. [2022-11-21 13:49:32,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 132 transitions, 300 flow [2022-11-21 13:49:32,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 132 transitions, 288 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-21 13:49:32,175 INFO L231 Difference]: Finished difference. Result has 133 places, 128 transitions, 262 flow [2022-11-21 13:49:32,178 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=262, PETRI_PLACES=133, PETRI_TRANSITIONS=128} [2022-11-21 13:49:32,181 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, -5 predicate places. [2022-11-21 13:49:32,182 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 128 transitions, 262 flow [2022-11-21 13:49:32,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:32,183 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:32,183 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:32,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:49:32,184 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 13:49:32,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:32,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2142861004, now seen corresponding path program 1 times [2022-11-21 13:49:32,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:32,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363313560] [2022-11-21 13:49:32,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:32,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:32,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:32,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363313560] [2022-11-21 13:49:32,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363313560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:32,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:32,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 13:49:32,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944811592] [2022-11-21 13:49:32,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:32,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:49:32,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:32,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:49:32,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:49:32,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 154 [2022-11-21 13:49:33,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 128 transitions, 262 flow. Second operand has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:33,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:33,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 154 [2022-11-21 13:49:33,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:33,349 INFO L130 PetriNetUnfolder]: 295/679 cut-off events. [2022-11-21 13:49:33,350 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-21 13:49:33,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 679 events. 295/679 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2975 event pairs, 167 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 1135. Up to 421 conditions per place. [2022-11-21 13:49:33,362 INFO L137 encePairwiseOnDemand]: 144/154 looper letters, 44 selfloop transitions, 6 changer transitions 4/136 dead transitions. [2022-11-21 13:49:33,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 136 transitions, 386 flow [2022-11-21 13:49:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:49:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-21 13:49:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 815 transitions. [2022-11-21 13:49:33,371 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.661525974025974 [2022-11-21 13:49:33,372 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 815 transitions. [2022-11-21 13:49:33,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 815 transitions. [2022-11-21 13:49:33,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:33,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 815 transitions. [2022-11-21 13:49:33,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.875) internal successors, (815), 8 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:33,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:33,382 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:33,382 INFO L175 Difference]: Start difference. First operand has 133 places, 128 transitions, 262 flow. Second operand 8 states and 815 transitions. [2022-11-21 13:49:33,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 136 transitions, 386 flow [2022-11-21 13:49:33,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 386 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 13:49:33,389 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 290 flow [2022-11-21 13:49:33,390 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=290, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-11-21 13:49:33,392 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 2 predicate places. [2022-11-21 13:49:33,393 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 290 flow [2022-11-21 13:49:33,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:33,394 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:33,394 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:33,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:49:33,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 13:49:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1947980679, now seen corresponding path program 1 times [2022-11-21 13:49:33,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:33,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409713785] [2022-11-21 13:49:33,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:33,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:33,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:33,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409713785] [2022-11-21 13:49:33,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409713785] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:33,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018539246] [2022-11-21 13:49:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:33,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:33,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:49:33,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:49:33,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:49:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:33,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:49:33,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:49:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:34,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:49:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:34,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018539246] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:34,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:49:34,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-21 13:49:34,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222721844] [2022-11-21 13:49:34,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:34,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:49:34,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:34,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:49:34,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-21 13:49:34,398 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 154 [2022-11-21 13:49:34,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:34,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:34,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 154 [2022-11-21 13:49:34,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:34,620 INFO L130 PetriNetUnfolder]: 175/511 cut-off events. [2022-11-21 13:49:34,620 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-21 13:49:34,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 511 events. 175/511 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2090 event pairs, 45 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 827. Up to 137 conditions per place. [2022-11-21 13:49:34,627 INFO L137 encePairwiseOnDemand]: 146/154 looper letters, 33 selfloop transitions, 7 changer transitions 0/137 dead transitions. [2022-11-21 13:49:34,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 137 transitions, 388 flow [2022-11-21 13:49:34,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:49:34,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-21 13:49:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 838 transitions. [2022-11-21 13:49:34,630 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7773654916512059 [2022-11-21 13:49:34,630 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 838 transitions. [2022-11-21 13:49:34,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 838 transitions. [2022-11-21 13:49:34,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:34,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 838 transitions. [2022-11-21 13:49:34,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:34,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:34,637 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:34,637 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 290 flow. Second operand 7 states and 838 transitions. [2022-11-21 13:49:34,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 137 transitions, 388 flow [2022-11-21 13:49:34,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 370 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-11-21 13:49:34,643 INFO L231 Difference]: Finished difference. Result has 140 places, 131 transitions, 305 flow [2022-11-21 13:49:34,643 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=305, PETRI_PLACES=140, PETRI_TRANSITIONS=131} [2022-11-21 13:49:34,645 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 2 predicate places. [2022-11-21 13:49:34,645 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 131 transitions, 305 flow [2022-11-21 13:49:34,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:34,646 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:34,646 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:34,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 13:49:34,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:34,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 13:49:34,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:34,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1971120592, now seen corresponding path program 1 times [2022-11-21 13:49:34,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:34,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528613799] [2022-11-21 13:49:34,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:34,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:49:35,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:35,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528613799] [2022-11-21 13:49:35,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528613799] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:35,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920586848] [2022-11-21 13:49:35,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:35,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:35,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:49:35,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:49:35,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:49:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:35,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 13:49:35,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:49:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:49:35,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:49:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:49:35,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920586848] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:35,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:49:35,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-21 13:49:35,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888317520] [2022-11-21 13:49:35,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:35,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 13:49:35,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:35,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 13:49:35,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-11-21 13:49:35,819 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 154 [2022-11-21 13:49:35,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 131 transitions, 305 flow. Second operand has 9 states, 9 states have (on average 110.33333333333333) internal successors, (993), 9 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:35,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:35,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 154 [2022-11-21 13:49:35,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:36,295 INFO L130 PetriNetUnfolder]: 600/1204 cut-off events. [2022-11-21 13:49:36,296 INFO L131 PetriNetUnfolder]: For 404/584 co-relation queries the response was YES. [2022-11-21 13:49:36,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 1204 events. 600/1204 cut-off events. For 404/584 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6302 event pairs, 103 based on Foata normal form. 180/1238 useless extension candidates. Maximal degree in co-relation 2453. Up to 249 conditions per place. [2022-11-21 13:49:36,307 INFO L137 encePairwiseOnDemand]: 142/154 looper letters, 74 selfloop transitions, 19 changer transitions 0/183 dead transitions. [2022-11-21 13:49:36,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 183 transitions, 644 flow [2022-11-21 13:49:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:49:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-21 13:49:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1264 transitions. [2022-11-21 13:49:36,311 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7461629279811098 [2022-11-21 13:49:36,311 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1264 transitions. [2022-11-21 13:49:36,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1264 transitions. [2022-11-21 13:49:36,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:36,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1264 transitions. [2022-11-21 13:49:36,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.9090909090909) internal successors, (1264), 11 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:36,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 154.0) internal successors, (1848), 12 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:36,319 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 154.0) internal successors, (1848), 12 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:36,319 INFO L175 Difference]: Start difference. First operand has 140 places, 131 transitions, 305 flow. Second operand 11 states and 1264 transitions. [2022-11-21 13:49:36,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 183 transitions, 644 flow [2022-11-21 13:49:36,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 183 transitions, 631 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-21 13:49:36,324 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 404 flow [2022-11-21 13:49:36,324 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=404, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2022-11-21 13:49:36,325 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 14 predicate places. [2022-11-21 13:49:36,325 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 404 flow [2022-11-21 13:49:36,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.33333333333333) internal successors, (993), 9 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:36,326 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:36,326 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:36,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:49:36,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:36,532 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 13:49:36,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:36,532 INFO L85 PathProgramCache]: Analyzing trace with hash 797684560, now seen corresponding path program 2 times [2022-11-21 13:49:36,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:36,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778160113] [2022-11-21 13:49:36,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:36,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:49:36,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:36,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778160113] [2022-11-21 13:49:36,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778160113] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:36,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624891310] [2022-11-21 13:49:36,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:49:36,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:36,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:49:36,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:49:36,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 13:49:36,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 13:49:36,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:49:36,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 13:49:36,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:49:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:49:37,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:49:37,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624891310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:37,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:49:37,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-11-21 13:49:37,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117887818] [2022-11-21 13:49:37,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:37,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:49:37,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:37,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:49:37,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-21 13:49:37,303 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 154 [2022-11-21 13:49:37,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 143 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:37,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:37,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 154 [2022-11-21 13:49:37,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:37,707 INFO L130 PetriNetUnfolder]: 412/876 cut-off events. [2022-11-21 13:49:37,707 INFO L131 PetriNetUnfolder]: For 824/929 co-relation queries the response was YES. [2022-11-21 13:49:37,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 876 events. 412/876 cut-off events. For 824/929 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3967 event pairs, 118 based on Foata normal form. 131/985 useless extension candidates. Maximal degree in co-relation 2190. Up to 334 conditions per place. [2022-11-21 13:49:37,717 INFO L137 encePairwiseOnDemand]: 145/154 looper letters, 42 selfloop transitions, 11 changer transitions 0/145 dead transitions. [2022-11-21 13:49:37,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 145 transitions, 503 flow [2022-11-21 13:49:37,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:49:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-21 13:49:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 865 transitions. [2022-11-21 13:49:37,720 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7021103896103896 [2022-11-21 13:49:37,721 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 865 transitions. [2022-11-21 13:49:37,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 865 transitions. [2022-11-21 13:49:37,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:37,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 865 transitions. [2022-11-21 13:49:37,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:37,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:37,727 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:37,728 INFO L175 Difference]: Start difference. First operand has 152 places, 143 transitions, 404 flow. Second operand 8 states and 865 transitions. [2022-11-21 13:49:37,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 145 transitions, 503 flow [2022-11-21 13:49:37,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 145 transitions, 490 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-21 13:49:37,738 INFO L231 Difference]: Finished difference. Result has 151 places, 137 transitions, 381 flow [2022-11-21 13:49:37,738 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=381, PETRI_PLACES=151, PETRI_TRANSITIONS=137} [2022-11-21 13:49:37,741 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 13 predicate places. [2022-11-21 13:49:37,741 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 137 transitions, 381 flow [2022-11-21 13:49:37,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:37,742 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:49:37,742 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:37,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 13:49:37,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:37,956 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 13:49:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:37,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1636578117, now seen corresponding path program 1 times [2022-11-21 13:49:37,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:37,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146137573] [2022-11-21 13:49:37,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:37,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:49:39,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:39,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146137573] [2022-11-21 13:49:39,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146137573] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:39,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925966927] [2022-11-21 13:49:39,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:39,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:39,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:49:39,823 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:49:39,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 13:49:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:39,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-21 13:49:39,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:49:41,224 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:49:41,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-11-21 13:49:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:42,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:49:43,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:49:43,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 161 [2022-11-21 13:49:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:52,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925966927] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:49:52,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:49:52,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 19] total 49 [2022-11-21 13:49:52,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125633331] [2022-11-21 13:49:52,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:49:52,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-21 13:49:52,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:52,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-21 13:49:52,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=2010, Unknown=0, NotChecked=0, Total=2352 [2022-11-21 13:49:52,538 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 154 [2022-11-21 13:49:52,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 137 transitions, 381 flow. Second operand has 49 states, 49 states have (on average 69.81632653061224) internal successors, (3421), 49 states have internal predecessors, (3421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:52,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:49:52,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 154 [2022-11-21 13:49:52,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:49:59,889 INFO L130 PetriNetUnfolder]: 4545/7535 cut-off events. [2022-11-21 13:49:59,890 INFO L131 PetriNetUnfolder]: For 6421/6421 co-relation queries the response was YES. [2022-11-21 13:49:59,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19388 conditions, 7535 events. 4545/7535 cut-off events. For 6421/6421 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 51240 event pairs, 988 based on Foata normal form. 1/7486 useless extension candidates. Maximal degree in co-relation 19376. Up to 2970 conditions per place. [2022-11-21 13:49:59,952 INFO L137 encePairwiseOnDemand]: 121/154 looper letters, 302 selfloop transitions, 126 changer transitions 9/490 dead transitions. [2022-11-21 13:49:59,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 490 transitions, 2524 flow [2022-11-21 13:49:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-21 13:49:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-11-21 13:49:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3512 transitions. [2022-11-21 13:49:59,962 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48521691074882567 [2022-11-21 13:49:59,962 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3512 transitions. [2022-11-21 13:49:59,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3512 transitions. [2022-11-21 13:49:59,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 13:49:59,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3512 transitions. [2022-11-21 13:49:59,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 74.72340425531915) internal successors, (3512), 47 states have internal predecessors, (3512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:59,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 154.0) internal successors, (7392), 48 states have internal predecessors, (7392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:59,988 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 154.0) internal successors, (7392), 48 states have internal predecessors, (7392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:59,989 INFO L175 Difference]: Start difference. First operand has 151 places, 137 transitions, 381 flow. Second operand 47 states and 3512 transitions. [2022-11-21 13:49:59,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 490 transitions, 2524 flow [2022-11-21 13:50:00,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 490 transitions, 2481 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-21 13:50:00,037 INFO L231 Difference]: Finished difference. Result has 207 places, 268 transitions, 1262 flow [2022-11-21 13:50:00,038 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=1262, PETRI_PLACES=207, PETRI_TRANSITIONS=268} [2022-11-21 13:50:00,038 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 69 predicate places. [2022-11-21 13:50:00,038 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 268 transitions, 1262 flow [2022-11-21 13:50:00,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 69.81632653061224) internal successors, (3421), 49 states have internal predecessors, (3421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:50:00,040 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 13:50:00,041 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:50:00,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-21 13:50:00,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 13:50:00,247 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 13:50:00,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1813782651, now seen corresponding path program 2 times [2022-11-21 13:50:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:50:00,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119082909] [2022-11-21 13:50:00,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:50:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:50:02,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:50:02,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119082909] [2022-11-21 13:50:02,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119082909] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:50:02,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011764220] [2022-11-21 13:50:02,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:50:02,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:50:02,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:50:02,438 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:50:02,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 13:50:02,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:50:02,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:50:02,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-21 13:50:02,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:03,479 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 [2022-11-21 13:50:04,044 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 [2022-11-21 13:50:04,200 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 [2022-11-21 13:50:04,479 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 [2022-11-21 13:50:05,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:50:05,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-11-21 13:50:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:50:05,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:50:16,437 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~max2~0 c_~max3~0)) (.cse8 (= c_~max1~0 c_~max2~0))) (and (or .cse0 (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max3~0 (select .cse1 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max1~0 .cse2)) (< 0 ~M~0) (< ~M~0 0) (= .cse2 c_~max2~0)))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse4 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse3)) (< 0 ~M~0) (< ~M~0 0) (<= .cse3 c_~max2~0) (< c_~max1~0 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse3 c_~max1~0))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (select .cse7 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse5)) (not (< c_~max1~0 .cse6)) (< 0 ~M~0) (< ~M~0 0) (= .cse6 c_~max2~0) (< c_~max2~0 .cse5))))) (or (and (or .cse8 .cse0) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max3~0 (select .cse9 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< 0 ~M~0) (< ~M~0 0) (< c_~max1~0 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse11 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse10)) (< 0 ~M~0) (< ~M~0 0) (< c_~max1~0 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 .cse10))))) .cse8) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max3~0 (select .cse12 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= .cse13 c_~max3~0) (not (< c_~max1~0 .cse13)) (< 0 ~M~0) (< ~M~0 0))))))) is different from false [2022-11-21 13:50:17,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:50:17,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2022-11-21 13:50:17,287 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:50:17,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 247 [2022-11-21 13:50:17,305 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:50:17,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 231 [2022-11-21 13:50:17,321 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:50:17,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 199 [2022-11-21 13:50:17,339 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 13:50:17,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 97 [2022-11-21 13:50:17,485 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 13:50:17,486 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 126 treesize of output 1 [2022-11-21 13:50:17,496 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 13:50:17,496 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 94 treesize of output 1 [2022-11-21 13:50:17,513 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 13:50:17,513 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 123 treesize of output 1 [2022-11-21 13:50:17,524 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 13:50:17,524 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 90 treesize of output 1 [2022-11-21 13:50:17,533 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 13:50:17,533 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 90 treesize of output 1 [2022-11-21 13:50:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-21 13:50:17,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011764220] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:50:17,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:50:17,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 23] total 68 [2022-11-21 13:50:17,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499759239] [2022-11-21 13:50:17,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:50:17,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-21 13:50:17,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:50:17,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-21 13:50:17,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=3627, Unknown=34, NotChecked=130, Total=4556 [2022-11-21 13:50:17,931 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2022-11-21 13:50:17,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 268 transitions, 1262 flow. Second operand has 68 states, 68 states have (on average 58.044117647058826) internal successors, (3947), 68 states have internal predecessors, (3947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:50:17,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 13:50:17,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2022-11-21 13:50:17,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 13:50:31,728 WARN L233 SmtUtils]: Spent 9.13s on a formula simplification. DAG size of input: 202 DAG size of output: 196 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:50:38,923 WARN L233 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 114 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:51:23,288 WARN L233 SmtUtils]: Spent 41.44s on a formula simplification. DAG size of input: 222 DAG size of output: 200 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:51:26,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:51:28,509 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] [2022-11-21 13:51:30,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:51:37,131 WARN L233 SmtUtils]: Spent 5.73s on a formula simplification. DAG size of input: 137 DAG size of output: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:51:54,237 WARN L233 SmtUtils]: Spent 8.83s on a formula simplification that was a NOOP. DAG size: 230 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:52:10,494 WARN L233 SmtUtils]: Spent 14.37s on a formula simplification. DAG size of input: 242 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:52:58,343 WARN L233 SmtUtils]: Spent 44.27s on a formula simplification. DAG size of input: 236 DAG size of output: 218 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:53:51,559 WARN L233 SmtUtils]: Spent 50.54s on a formula simplification. DAG size of input: 210 DAG size of output: 186 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:54:05,079 WARN L233 SmtUtils]: Spent 10.93s on a formula simplification. DAG size of input: 234 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:54:18,337 WARN L233 SmtUtils]: Spent 11.93s on a formula simplification. DAG size of input: 244 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:54:20,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:54:36,225 WARN L233 SmtUtils]: Spent 14.65s on a formula simplification. DAG size of input: 247 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:54:58,933 WARN L233 SmtUtils]: Spent 21.41s on a formula simplification. DAG size of input: 233 DAG size of output: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:55:29,458 WARN L233 SmtUtils]: Spent 23.72s on a formula simplification. DAG size of input: 233 DAG size of output: 214 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:55:51,285 WARN L233 SmtUtils]: Spent 17.17s on a formula simplification. DAG size of input: 245 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:55:53,312 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] [2022-11-21 13:56:11,759 WARN L233 SmtUtils]: Spent 14.55s on a formula simplification. DAG size of input: 236 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:56:15,002 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] [2022-11-21 13:56:38,432 WARN L233 SmtUtils]: Spent 21.26s on a formula simplification. DAG size of input: 245 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:56:40,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 13:56:50,421 WARN L233 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 249 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:57:16,078 WARN L233 SmtUtils]: Spent 19.81s on a formula simplification. DAG size of input: 124 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:57:33,836 WARN L233 SmtUtils]: Spent 15.14s on a formula simplification. DAG size of input: 239 DAG size of output: 233 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:57:36,284 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse45 (select |c_#memory_int| c_~A~0.base)) (.cse7 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (let ((.cse18 (= c_~max1~0 c_~max2~0)) (.cse4 (< c_~max2~0 c_~max3~0)) (.cse66 (= c_~max1~0 c_~max3~0)) (.cse16 (<= c_~max3~0 c_~max2~0)) (.cse44 (select .cse45 .cse7))) (let ((.cse59 (+ c_thread3Thread1of1ForFork1_~i~2 1)) (.cse40 (< c_~max1~0 .cse44)) (.cse42 (forall ((~M~0 Int)) (let ((.cse83 (select .cse45 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse83)) (< 0 ~M~0) (< c_~max2~0 .cse83) (< (+ ~M~0 1) c_~N~0))))) (.cse1 (and (or .cse18 .cse4) (or .cse66 .cse16))) (.cse46 (forall ((~M~0 Int)) (or (< c_~max3~0 (select .cse45 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))))) (and (or (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (or (< 0 ~M~0) (< c_~max1~0 (select .cse0 c_~A~0.offset)) (< ~M~0 0) (< c_~max3~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4))))))) .cse1) (or (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse2 (select .cse3 c_~A~0.offset))) (or (= .cse2 c_~max2~0) (< 0 ~M~0) (< ~M~0 0) (not (< c_~max1~0 .cse2)) (< c_~max3~0 (select .cse3 (+ c_~A~0.offset (* ~M~0 4)))))))) .cse4) (or .cse1 (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (or (< c_~max1~0 (select .cse5 c_~A~0.offset)) (< c_~max3~0 (select .cse5 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< ~M~0 0))))) (or .cse1 (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (or (< 0 ~M~0) (< c_~max1~0 (select .cse6 .cse7)) (< c_~max3~0 (select .cse6 (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse8 (select .cse9 c_~A~0.offset))) (or (not (< c_~max1~0 .cse8)) (< c_~max3~0 (select .cse9 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (= c_~max3~0 .cse8) (< ~M~0 0))))) (forall ((v_ArrVal_193 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse10 (select .cse11 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse10)) (< 0 ~M~0) (= c_~max1~0 .cse10) (<= .cse10 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select .cse11 .cse7))))) (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse12 (select .cse13 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse12)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~max1~0 (select .cse13 .cse7)) (= c_~max1~0 .cse12) (<= .cse12 c_~max2~0))))) (or (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse7))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (= c_~max3~0 .cse14) (< c_~max3~0 (select .cse15 (+ c_~A~0.offset (* ~M~0 4)))) (not (< c_~max1~0 .cse14)))))) .cse16) (or .cse1 (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (or (< 0 ~M~0) (< ~M~0 0) (< c_~max1~0 (select .cse17 c_~A~0.offset)) (< c_~max3~0 (select .cse17 (+ c_~A~0.offset (* ~M~0 4)))))))) (or .cse18 (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse19 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse19)) (< 0 ~M~0) (< c_~max1~0 (select .cse20 .cse7)) (< c_~max2~0 .cse19) (< (+ ~M~0 1) c_~N~0)))))) (or .cse18 (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse22 (select .cse21 (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max1~0 (select .cse21 c_~A~0.offset)) (< 0 ~M~0) (not (< c_~max3~0 .cse22)) (< ~M~0 0) (< c_~max2~0 .cse22)))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse25 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse23 (select .cse25 c_~A~0.offset)) (.cse24 (select .cse25 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max1~0 .cse23)) (< 0 ~M~0) (= c_~max2~0 .cse23) (not (< c_~max3~0 .cse24)) (< ~M~0 0) (< c_~max2~0 .cse24))))) (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse27 (select .cse28 c_~A~0.offset)) (.cse26 (select .cse28 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse26)) (not (< c_~max1~0 .cse27)) (< 0 ~M~0) (= .cse27 c_~max2~0) (< ~M~0 0) (< c_~max2~0 .cse26))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse29 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse30 (select .cse29 (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max1~0 (select .cse29 c_~A~0.offset)) (<= .cse30 c_~max2~0) (< 0 ~M~0) (not (< c_~max3~0 .cse30)) (< ~M~0 0) (= .cse30 c_~max1~0))))) (or .cse16 (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse31 (select .cse32 .cse7))) (or (< 0 ~M~0) (= c_~max3~0 .cse31) (< c_~max3~0 (select .cse32 (+ c_~A~0.offset (* ~M~0 4)))) (not (< c_~max1~0 .cse31)) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse34 (select .cse33 .cse7))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~max3~0 (select .cse33 (+ c_~A~0.offset (* ~M~0 4)))) (= c_~max2~0 .cse34) (not (< c_~max1~0 .cse34)))))) .cse4) (or .cse18 (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse35 (select .cse36 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse35)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~max1~0 (select .cse36 .cse7)) (< c_~max2~0 .cse35)))))) (or .cse4 (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse38 (select .cse37 .cse7))) (or (< 0 ~M~0) (< c_~max3~0 (select .cse37 (+ c_~A~0.offset (* ~M~0 4)))) (= c_~max2~0 .cse38) (not (< c_~max1~0 .cse38)) (< (+ ~M~0 1) c_~N~0)))))) (or .cse1 (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~max1~0 (select .cse39 .cse7)) (< c_~max3~0 (select .cse39 (+ c_~A~0.offset (* ~M~0 4)))))))) (or (not .cse40) (let ((.cse41 (= .cse44 c_~max2~0))) (and (or .cse41 .cse42) (forall ((~M~0 Int)) (let ((.cse43 (select .cse45 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse43)) (= .cse44 .cse43) (< 0 ~M~0) (<= .cse43 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (or .cse46 (and (or .cse16 (= .cse44 c_~max3~0)) (or .cse4 .cse41)))))) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse49 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse47 (select .cse49 c_~A~0.offset)) (.cse48 (select .cse49 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse47 c_~max2~0) (not (< c_~max3~0 .cse48)) (< 0 ~M~0) (< ~M~0 0) (not (< c_~max1~0 .cse47)) (< c_~max2~0 .cse48))))) (forall ((v_ArrVal_193 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse52 (select .cse51 .cse7))) (or (forall ((~M~0 Int)) (let ((.cse50 (select .cse51 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse50)) (< 0 ~M~0) (< c_~max2~0 .cse50) (< (+ ~M~0 1) c_~N~0)))) (= c_~max2~0 .cse52) (not (< c_~max1~0 .cse52)))))) (or (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse54 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse53 (select .cse54 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse53)) (< 0 ~M~0) (< ~M~0 0) (< c_~max1~0 (select .cse54 c_~A~0.offset)) (< c_~max2~0 .cse53))))) .cse18) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse56 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse55 (select .cse56 c_~A~0.offset))) (or (< 0 ~M~0) (< ~M~0 0) (not (< c_~max1~0 .cse55)) (= .cse55 c_~max3~0) (< c_~max3~0 (select .cse56 (+ c_~A~0.offset (* ~M~0 4)))))))) (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse58 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse57 (select .cse58 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse57)) (< 0 ~M~0) (< c_~max1~0 (select .cse58 c_~A~0.offset)) (< ~M~0 0) (<= .cse57 c_~max2~0) (= c_~max1~0 .cse57))))) (or (< c_thread2Thread1of1ForFork0_~i~1 c_~M~0) (< .cse59 c_~N~0) (let ((.cse61 (select .cse45 (+ c_~A~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))))) (let ((.cse60 (< c_~max3~0 .cse61))) (and (or .cse1 .cse60) (or (and (or .cse18 (< c_~max2~0 .cse61)) (or (<= .cse61 c_~max2~0) (= c_~max1~0 .cse61))) (not .cse60)))))) (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse63 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse62 (select .cse63 c_~A~0.offset))) (or (not (< c_~max1~0 .cse62)) (= .cse62 c_~max3~0) (< 0 ~M~0) (< ~M~0 0) (< c_~max3~0 (select .cse63 (+ c_~A~0.offset (* ~M~0 4)))))))) (or (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse65 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse64 (select .cse65 c_~A~0.offset))) (or (not (< c_~max1~0 .cse64)) (< 0 ~M~0) (= .cse64 c_~max2~0) (< ~M~0 0) (< c_~max3~0 (select .cse65 (+ c_~A~0.offset (* ~M~0 4)))))))) .cse4) (or (and .cse66 (<= 1 c_~max3~0) (= c_~max2~0 0)) (and .cse66 .cse18) (<= .cse59 c_~N~0)) (forall ((v_ArrVal_193 (Array Int Int))) (let ((.cse69 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse68 (select .cse69 .cse7))) (or (forall ((~M~0 Int)) (let ((.cse67 (select .cse69 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse67)) (< 0 ~M~0) (= .cse67 .cse68) (<= .cse67 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse68)))))) (or .cse40 (and (or .cse18 .cse42) (or .cse1 .cse46) (forall ((~M~0 Int)) (let ((.cse70 (select .cse45 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse70) (not (< c_~max3~0 .cse70)) (< 0 ~M~0) (<= .cse70 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse73 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse71 (select .cse73 (+ c_~A~0.offset (* ~M~0 4)))) (.cse72 (select .cse73 .cse7))) (or (not (< c_~max3~0 .cse71)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (= .cse71 .cse72) (<= .cse71 c_~max2~0) (not (< c_~max1~0 .cse72)))))) (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse75 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse74 (select .cse75 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse74)) (< 0 ~M~0) (= c_~max1~0 .cse74) (< ~M~0 0) (< c_~max1~0 (select .cse75 c_~A~0.offset)) (<= .cse74 c_~max2~0))))) (or .cse18 (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse77 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse76 (select .cse77 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse76)) (< 0 ~M~0) (< c_~max1~0 (select .cse77 c_~A~0.offset)) (< ~M~0 0) (< c_~max2~0 .cse76)))))) (or (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse79 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse78 (select .cse79 c_~A~0.offset))) (or (not (< c_~max1~0 .cse78)) (< c_~max3~0 (select .cse79 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (= c_~max2~0 .cse78) (< ~M~0 0))))) .cse4) (forall ((v_ArrVal_193 (Array Int Int)) (~M~0 Int)) (let ((.cse82 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~A~0.base))) (let ((.cse80 (select .cse82 (+ c_~A~0.offset (* ~M~0 4)))) (.cse81 (select .cse82 .cse7))) (or (not (< c_~max3~0 .cse80)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~max2~0 .cse80) (= c_~max2~0 .cse81) (not (< c_~max1~0 .cse81)))))))))) is different from false [2022-11-21 13:58:17,214 WARN L233 SmtUtils]: Spent 34.97s on a formula simplification. DAG size of input: 250 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:58:23,965 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] [2022-11-21 13:58:26,187 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] [2022-11-21 13:58:46,105 WARN L233 SmtUtils]: Spent 13.74s on a formula simplification. DAG size of input: 157 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:59:16,924 WARN L233 SmtUtils]: Spent 21.09s on a formula simplification. DAG size of input: 143 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:59:27,032 WARN L233 SmtUtils]: Spent 9.11s on a formula simplification. DAG size of input: 175 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:59:38,131 WARN L233 SmtUtils]: Spent 10.38s on a formula simplification. DAG size of input: 159 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:59:47,845 WARN L233 SmtUtils]: Spent 8.84s on a formula simplification. DAG size of input: 164 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:59:59,794 WARN L233 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 138 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:00:10,083 WARN L233 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 177 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:00:17,621 WARN L233 SmtUtils]: Spent 7.11s on a formula simplification. DAG size of input: 96 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:00:25,317 WARN L233 SmtUtils]: Spent 6.95s on a formula simplification. DAG size of input: 160 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:00:38,927 WARN L233 SmtUtils]: Spent 10.77s on a formula simplification. DAG size of input: 158 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:00:47,642 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] [2022-11-21 14:00:53,737 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 182 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:01:01,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 14:01:04,991 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] [2022-11-21 14:01:36,184 WARN L233 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 129 DAG size of output: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:01:37,122 INFO L130 PetriNetUnfolder]: 12492/20356 cut-off events. [2022-11-21 14:01:37,123 INFO L131 PetriNetUnfolder]: For 34707/34997 co-relation queries the response was YES. [2022-11-21 14:01:37,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65332 conditions, 20356 events. 12492/20356 cut-off events. For 34707/34997 co-relation queries the response was YES. Maximal size of possible extension queue 1106. Compared 155440 event pairs, 833 based on Foata normal form. 53/20277 useless extension candidates. Maximal degree in co-relation 65305. Up to 5834 conditions per place. [2022-11-21 14:01:37,371 INFO L137 encePairwiseOnDemand]: 104/154 looper letters, 756 selfloop transitions, 914 changer transitions 8/1726 dead transitions. [2022-11-21 14:01:37,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 1726 transitions, 11863 flow [2022-11-21 14:01:37,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-11-21 14:01:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2022-11-21 14:01:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 9395 transitions. [2022-11-21 14:01:37,394 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40943955373485574 [2022-11-21 14:01:37,394 INFO L72 ComplementDD]: Start complementDD. Operand 149 states and 9395 transitions. [2022-11-21 14:01:37,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 9395 transitions. [2022-11-21 14:01:37,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 14:01:37,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 149 states and 9395 transitions. [2022-11-21 14:01:37,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 150 states, 149 states have (on average 63.053691275167786) internal successors, (9395), 149 states have internal predecessors, (9395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:37,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 150 states, 150 states have (on average 154.0) internal successors, (23100), 150 states have internal predecessors, (23100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:37,464 INFO L81 ComplementDD]: Finished complementDD. Result has 150 states, 150 states have (on average 154.0) internal successors, (23100), 150 states have internal predecessors, (23100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:37,464 INFO L175 Difference]: Start difference. First operand has 207 places, 268 transitions, 1262 flow. Second operand 149 states and 9395 transitions. [2022-11-21 14:01:37,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 1726 transitions, 11863 flow [2022-11-21 14:01:37,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 1726 transitions, 11780 flow, removed 26 selfloop flow, removed 14 redundant places. [2022-11-21 14:01:37,876 INFO L231 Difference]: Finished difference. Result has 413 places, 1172 transitions, 9592 flow [2022-11-21 14:01:37,877 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=149, PETRI_FLOW=9592, PETRI_PLACES=413, PETRI_TRANSITIONS=1172} [2022-11-21 14:01:37,879 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 275 predicate places. [2022-11-21 14:01:37,879 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 1172 transitions, 9592 flow [2022-11-21 14:01:37,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 58.044117647058826) internal successors, (3947), 68 states have internal predecessors, (3947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:01:37,882 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 14:01:37,882 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 14:01:37,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-21 14:01:38,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:38,090 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 14:01:38,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 14:01:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1453643387, now seen corresponding path program 3 times [2022-11-21 14:01:38,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 14:01:38,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93949536] [2022-11-21 14:01:38,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 14:01:38,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 14:01:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 14:01:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:01:40,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 14:01:40,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93949536] [2022-11-21 14:01:40,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93949536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 14:01:40,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719970016] [2022-11-21 14:01:40,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 14:01:40,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 14:01:40,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 14:01:40,669 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 14:01:40,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25b76075-c137-4300-9d13-8017c91b2176/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 14:01:40,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-21 14:01:40,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 14:01:40,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-21 14:01:40,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 14:01:42,036 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 [2022-11-21 14:01:42,780 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 [2022-11-21 14:01:43,128 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 [2022-11-21 14:01:43,477 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 [2022-11-21 14:01:44,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:01:44,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-11-21 14:01:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:01:45,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 14:01:54,078 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (< c_~max2~0 c_~max3~0)) (.cse7 (<= c_~max3~0 c_~max2~0)) (.cse8 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse0 c_~max2~0) (< 0 ~M~0) (< ~M~0 0) (= c_~max1~0 .cse0) (< c_~max1~0 (select .cse1 c_~A~0.offset)) (not (< c_~max3~0 .cse0)))))) (or (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse2 (select .cse3 c_~A~0.offset))) (or (< 0 ~M~0) (not (< c_~max1~0 .cse2)) (< c_~max3~0 (select .cse3 (+ c_~A~0.offset (* ~M~0 4)))) (< ~M~0 0) (= .cse2 c_~max2~0))))) .cse4) (or (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse5 (select .cse6 c_~A~0.offset))) (or (= .cse5 c_~max3~0) (< 0 ~M~0) (not (< c_~max1~0 .cse5)) (< c_~max3~0 (select .cse6 (+ c_~A~0.offset (* ~M~0 4)))) (< ~M~0 0))))) .cse7) (or (and (or .cse8 .cse4) (or (= c_~max1~0 c_~max3~0) .cse7)) (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (or (< 0 ~M~0) (< c_~max3~0 (select .cse9 (+ c_~A~0.offset (* ~M~0 4)))) (< ~M~0 0) (< c_~max1~0 (select .cse9 c_~A~0.offset)))))) (or (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse10 (select .cse11 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (< c_~max2~0 .cse10) (< c_~max1~0 (select .cse11 c_~A~0.offset)) (not (< c_~max3~0 .cse10)))))) .cse8) (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse13 (select .cse14 (+ c_~A~0.offset (* ~M~0 4)))) (.cse12 (select .cse14 c_~A~0.offset))) (or (< 0 ~M~0) (not (< c_~max1~0 .cse12)) (< ~M~0 0) (< c_~max2~0 .cse13) (not (< c_~max3~0 .cse13)) (= .cse12 c_~max2~0))))))) is different from false [2022-11-21 14:01:57,129 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~max1~0 c_~max2~0)) (.cse0 (<= c_~max3~0 c_~max2~0)) (.cse11 (< c_~max2~0 c_~max3~0))) (and (or .cse0 (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< 0 ~M~0) (< ~M~0 0) (= c_~max3~0 .cse1) (not (< c_~max1~0 .cse1)) (< c_~max3~0 (select .cse2 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))) (or .cse3 (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse5 (select .cse4 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< 0 ~M~0) (< c_~max1~0 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< ~M~0 0) (not (< c_~max3~0 .cse5)) (< c_~max2~0 .cse5)))))) (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse7 (select .cse8 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= c_~max2~0 .cse6) (< 0 ~M~0) (< ~M~0 0) (not (< c_~max3~0 .cse7)) (not (< c_~max1~0 .cse6)) (< c_~max2~0 .cse7))))) (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse9 (select .cse10 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< 0 ~M~0) (<= .cse9 c_~max2~0) (< c_~max1~0 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< ~M~0 0) (not (< c_~max3~0 .cse9)) (= .cse9 c_~max1~0))))) (or (and (or .cse3 .cse11) (or (= c_~max1~0 c_~max3~0) .cse0)) (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< 0 ~M~0) (< c_~max1~0 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< ~M~0 0) (< c_~max3~0 (select .cse12 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) (or .cse11 (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~max2~0 .cse13) (< 0 ~M~0) (< ~M~0 0) (not (< c_~max1~0 .cse13)) (< c_~max3~0 (select .cse14 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))))) is different from false [2022-11-21 14:02:00,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:02:00,289 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 123 treesize of output 87 [2022-11-21 14:02:00,324 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:00,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2231 treesize of output 2139 [2022-11-21 14:02:00,402 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:00,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2135 treesize of output 1883 [2022-11-21 14:02:00,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:02:00,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1641 treesize of output 1577 [2022-11-21 14:02:00,571 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:00,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1815 treesize of output 1691 [2022-11-21 14:02:02,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:02:02,042 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 94 treesize of output 70 [2022-11-21 14:02:02,065 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:02,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 845 treesize of output 809 [2022-11-21 14:02:02,103 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:02,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 805 treesize of output 697 [2022-11-21 14:02:02,137 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:02,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 693 treesize of output 669 [2022-11-21 14:02:02,174 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:02,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 665 treesize of output 613 [2022-11-21 14:02:03,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:02:03,348 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 126 treesize of output 90 [2022-11-21 14:02:03,398 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:03,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2326 treesize of output 2218 [2022-11-21 14:02:03,465 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:03,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2214 treesize of output 1898 [2022-11-21 14:02:03,549 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:03,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1894 treesize of output 1818 [2022-11-21 14:02:03,610 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:03,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1814 treesize of output 1658 [2022-11-21 14:02:15,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:02:15,341 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 90 treesize of output 66 [2022-11-21 14:02:15,381 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:15,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1593 treesize of output 1533 [2022-11-21 14:02:15,437 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:15,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1529 treesize of output 1373 [2022-11-21 14:02:15,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:02:15,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 917 treesize of output 877 [2022-11-21 14:02:15,521 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:15,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1329 treesize of output 1253 [2022-11-21 14:02:19,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:02:19,177 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 61 treesize of output 49 [2022-11-21 14:02:19,212 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:19,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1083 treesize of output 1039 [2022-11-21 14:02:19,253 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:19,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1035 treesize of output 975 [2022-11-21 14:02:19,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 14:02:19,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 503 treesize of output 471 [2022-11-21 14:02:19,328 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-21 14:02:19,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 939 treesize of output 815 [2022-11-21 14:02:22,327 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-21 14:02:22,328 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 90 treesize of output 1 [2022-11-21 14:02:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 14:02:23,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719970016] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 14:02:23,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 14:02:23,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 23] total 68 [2022-11-21 14:02:23,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431959911] [2022-11-21 14:02:23,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 14:02:23,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-21 14:02:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 14:02:23,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-21 14:02:23,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=3585, Unknown=34, NotChecked=258, Total=4556 [2022-11-21 14:02:23,035 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2022-11-21 14:02:23,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 1172 transitions, 9592 flow. Second operand has 68 states, 68 states have (on average 58.044117647058826) internal successors, (3947), 68 states have internal predecessors, (3947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 14:02:23,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 14:02:23,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2022-11-21 14:02:23,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 14:02:38,599 WARN L233 SmtUtils]: Spent 9.00s on a formula simplification. DAG size of input: 157 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:02:39,593 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_int| c_~A~0.base)) (.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (let ((.cse19 (= c_~max1~0 c_~max2~0)) (.cse11 (< c_~max2~0 c_~max3~0)) (.cse14 (<= c_~max3~0 c_~max2~0)) (.cse26 (select .cse27 .cse3))) (let ((.cse22 (< c_~max1~0 .cse26)) (.cse24 (forall ((~M~0 Int)) (let ((.cse43 (select .cse27 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse43)) (< 0 ~M~0) (< c_~max2~0 .cse43) (< (+ ~M~0 1) c_~N~0))))) (.cse4 (and (or .cse19 .cse11) (or (= c_~max1~0 c_~max3~0) .cse14))) (.cse28 (forall ((~M~0 Int)) (or (< c_~max3~0 (select .cse27 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))))) (and (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse0 c_~max2~0) (< 0 ~M~0) (not (< c_~max3~0 .cse0)) (= .cse1 .cse0) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse1)))))) (or .cse4 (forall ((~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (or (< 0 ~M~0) (< c_~max1~0 (select .cse5 .cse3)) (< c_~max3~0 (select .cse5 (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))))) (forall ((~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse6 (select .cse8 (+ c_~A~0.offset (* ~M~0 4)))) (.cse7 (select .cse8 .cse3))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (not (< c_~max3~0 .cse6)) (< c_~max2~0 .cse6) (= .cse7 c_~max2~0) (not (< c_~max1~0 .cse7)))))) (or (forall ((~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse10 (select .cse9 .cse3))) (or (< 0 ~M~0) (< c_~max3~0 (select .cse9 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse10 c_~max2~0) (not (< c_~max1~0 .cse10)) (< (+ ~M~0 1) c_~N~0))))) .cse11) (or (forall ((~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse3))) (or (= .cse12 c_~max3~0) (< 0 ~M~0) (< c_~max3~0 (select .cse13 (+ c_~A~0.offset (* ~M~0 4)))) (not (< c_~max1~0 .cse12)) (< (+ ~M~0 1) c_~N~0))))) .cse14) (or .cse4 (forall ((~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~max1~0 (select .cse15 .cse3)) (< c_~max3~0 (select .cse15 (+ c_~A~0.offset (* ~M~0 4)))))))) (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse3))) (or (= .cse16 c_~max2~0) (forall ((~M~0 Int)) (let ((.cse17 (select .cse18 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (not (< c_~max3~0 .cse17)) (< c_~max2~0 .cse17) (< (+ ~M~0 1) c_~N~0)))) (not (< c_~max1~0 .cse16)))))) (or .cse19 (forall ((~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse20 (select .cse21 (+ c_~A~0.offset (* ~M~0 4))))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (not (< c_~max3~0 .cse20)) (< c_~max1~0 (select .cse21 .cse3)) (< c_~max2~0 .cse20)))))) (or (not .cse22) (let ((.cse23 (= .cse26 c_~max2~0))) (and (or .cse23 .cse24) (forall ((~M~0 Int)) (let ((.cse25 (select .cse27 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse25)) (= .cse26 .cse25) (< 0 ~M~0) (<= .cse25 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))) (or .cse28 (and (or .cse14 (= .cse26 c_~max3~0)) (or .cse11 .cse23)))))) (or (forall ((~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse30 (select .cse29 .cse3))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~max3~0 (select .cse29 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse30 c_~max2~0) (not (< c_~max1~0 .cse30)))))) .cse11) (forall ((~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse31 (select .cse33 (+ c_~A~0.offset (* ~M~0 4)))) (.cse32 (select .cse33 .cse3))) (or (<= .cse31 c_~max2~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (not (< c_~max3~0 .cse31)) (= .cse32 .cse31) (not (< c_~max1~0 .cse32)))))) (forall ((~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse34 (select .cse35 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse34 c_~max2~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (= c_~max1~0 .cse34) (not (< c_~max3~0 .cse34)) (< c_~max1~0 (select .cse35 .cse3)))))) (or .cse22 (and (or .cse19 .cse24) (or .cse4 .cse28) (forall ((~M~0 Int)) (let ((.cse36 (select .cse27 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse36) (not (< c_~max3~0 .cse36)) (< 0 ~M~0) (<= .cse36 c_~max2~0) (< (+ ~M~0 1) c_~N~0)))))) (or .cse19 (forall ((~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse37 (select .cse38 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (not (< c_~max3~0 .cse37)) (< c_~max1~0 (select .cse38 .cse3)) (< c_~max2~0 .cse37) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (or (< c_~max1~0 (select .cse39 .cse3)) (forall ((~M~0 Int)) (let ((.cse40 (select .cse39 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse40 c_~max2~0) (< 0 ~M~0) (= c_~max1~0 .cse40) (not (< c_~max3~0 .cse40)) (< (+ ~M~0 1) c_~N~0))))))) (or .cse14 (forall ((~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base))) (let ((.cse41 (select .cse42 .cse3))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (= .cse41 c_~max3~0) (< 0 ~M~0) (< c_~max3~0 (select .cse42 (+ c_~A~0.offset (* ~M~0 4)))) (not (< c_~max1~0 .cse41))))))))))) is different from false [2022-11-21 14:02:45,887 WARN L233 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 130 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:02:58,224 WARN L233 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 185 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:03:07,776 WARN L233 SmtUtils]: Spent 9.25s on a formula simplification. DAG size of input: 167 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:03:24,079 WARN L233 SmtUtils]: Spent 15.50s on a formula simplification. DAG size of input: 168 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:03:27,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 14:03:36,382 WARN L233 SmtUtils]: Spent 5.94s on a formula simplification. DAG size of input: 140 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:03:50,605 WARN L233 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 141 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)