./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN --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 ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 --- 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-6b4ec56 [2022-11-20 11:05:56,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:05:56,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:05:56,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:05:56,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:05:56,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:05:56,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:05:56,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:05:56,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:05:56,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:05:56,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:05:56,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:05:56,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:05:56,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:05:56,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:05:56,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:05:56,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:05:56,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:05:56,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:05:56,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:05:56,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:05:56,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:05:56,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:05:56,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:05:56,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:05:56,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:05:56,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:05:56,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:05:56,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:05:56,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:05:56,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:05:56,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:05:56,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:05:56,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:05:56,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:05:56,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:05:56,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:05:56,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:05:56,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:05:56,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:05:56,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:05:56,629 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:05:56,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:05:56,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:05:56,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:05:56,701 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:05:56,702 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:05:56,702 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:05:56,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:05:56,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:05:56,704 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:05:56,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:05:56,705 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:05:56,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:05:56,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:05:56,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:05:56,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:05:56,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:05:56,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:05:56,707 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:05:56,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:05:56,707 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:05:56,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:05:56,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:05:56,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:05:56,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:05:56,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:05:56,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:05:56,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:05:56,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:05:56,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:05:56,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:05:56,711 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:05:56,711 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:05:56,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:05:56,712 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_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/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_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN 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 -> ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 [2022-11-20 11:05:57,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:05:57,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:05:57,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:05:57,090 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:05:57,091 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:05:57,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2022-11-20 11:06:00,515 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:06:00,750 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:06:00,750 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2022-11-20 11:06:00,758 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/data/81f28323e/26cb037dc6604d79a4050f8691da38bd/FLAGfd502a67f [2022-11-20 11:06:00,780 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/data/81f28323e/26cb037dc6604d79a4050f8691da38bd [2022-11-20 11:06:00,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:06:00,785 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:06:00,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:06:00,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:06:00,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:06:00,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:06:00" (1/1) ... [2022-11-20 11:06:00,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a24c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:00, skipping insertion in model container [2022-11-20 11:06:00,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:06:00" (1/1) ... [2022-11-20 11:06:00,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:06:00,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:06:01,008 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_5aede864-4e52-452e-82cd-8feadda410c3/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-11-20 11:06:01,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:06:01,033 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:06:01,062 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_5aede864-4e52-452e-82cd-8feadda410c3/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-11-20 11:06:01,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:06:01,085 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:06:01,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:01 WrapperNode [2022-11-20 11:06:01,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:06:01,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:06:01,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:06:01,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:06:01,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:01" (1/1) ... [2022-11-20 11:06:01,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:01" (1/1) ... [2022-11-20 11:06:01,142 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-20 11:06:01,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:06:01,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:06:01,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:06:01,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:06:01,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:01" (1/1) ... [2022-11-20 11:06:01,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:01" (1/1) ... [2022-11-20 11:06:01,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:01" (1/1) ... [2022-11-20 11:06:01,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:01" (1/1) ... [2022-11-20 11:06:01,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:01" (1/1) ... [2022-11-20 11:06:01,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:01" (1/1) ... [2022-11-20 11:06:01,191 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:01" (1/1) ... [2022-11-20 11:06:01,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:01" (1/1) ... [2022-11-20 11:06:01,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:06:01,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:06:01,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:06:01,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:06:01,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:01" (1/1) ... [2022-11-20 11:06:01,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:06:01,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:06:01,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:06:01,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:06:01,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:06:01,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 11:06:01,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 11:06:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 11:06:01,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 11:06:01,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 11:06:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 11:06:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:06:01,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:06:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:06:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 11:06:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 11:06:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:06:01,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:06:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:06:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:06:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:06:01,322 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 11:06:01,550 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:06:01,553 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:06:01,880 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:06:01,945 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:06:01,946 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 11:06:01,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:06:01 BoogieIcfgContainer [2022-11-20 11:06:01,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:06:01,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:06:01,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:06:01,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:06:01,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:06:00" (1/3) ... [2022-11-20 11:06:01,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620372b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:06:01, skipping insertion in model container [2022-11-20 11:06:01,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:06:01" (2/3) ... [2022-11-20 11:06:01,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620372b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:06:01, skipping insertion in model container [2022-11-20 11:06:01,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:06:01" (3/3) ... [2022-11-20 11:06:01,974 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-11-20 11:06:01,984 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 11:06:01,996 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:06:01,997 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:06:01,997 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 11:06:02,163 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 11:06:02,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 154 transitions, 332 flow [2022-11-20 11:06:02,307 INFO L130 PetriNetUnfolder]: 12/151 cut-off events. [2022-11-20 11:06:02,307 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 11:06:02,315 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-20 11:06:02,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 154 transitions, 332 flow [2022-11-20 11:06:02,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 140 transitions, 298 flow [2022-11-20 11:06:02,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:06:02,346 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;@55ea1528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:06:02,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 11:06:02,460 INFO L130 PetriNetUnfolder]: 12/139 cut-off events. [2022-11-20 11:06:02,461 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 11:06:02,461 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:06:02,462 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-20 11:06:02,463 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-20 11:06:02,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:06:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash 405465620, now seen corresponding path program 1 times [2022-11-20 11:06:02,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:06:02,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784923257] [2022-11-20 11:06:02,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:06:02,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:06:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:02,896 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-20 11:06:02,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:06:02,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784923257] [2022-11-20 11:06:02,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784923257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:06:02,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:06:02,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:06:02,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585942315] [2022-11-20 11:06:02,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:06:02,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:06:02,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:06:02,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:06:02,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:06:02,981 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 154 [2022-11-20 11:06:02,987 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-20 11:06:02,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:06:02,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 154 [2022-11-20 11:06:02,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:06:03,183 INFO L130 PetriNetUnfolder]: 41/265 cut-off events. [2022-11-20 11:06:03,183 INFO L131 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2022-11-20 11:06:03,186 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-20 11:06:03,189 INFO L137 encePairwiseOnDemand]: 146/154 looper letters, 9 selfloop transitions, 0 changer transitions 4/132 dead transitions. [2022-11-20 11:06:03,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 132 transitions, 300 flow [2022-11-20 11:06:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:06:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 11:06:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 289 transitions. [2022-11-20 11:06:03,206 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9383116883116883 [2022-11-20 11:06:03,207 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 289 transitions. [2022-11-20 11:06:03,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 289 transitions. [2022-11-20 11:06:03,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:06:03,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 289 transitions. [2022-11-20 11:06:03,223 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-20 11:06:03,233 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-20 11:06:03,234 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-20 11:06:03,236 INFO L175 Difference]: Start difference. First operand has 138 places, 140 transitions, 298 flow. Second operand 2 states and 289 transitions. [2022-11-20 11:06:03,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 132 transitions, 300 flow [2022-11-20 11:06:03,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 132 transitions, 288 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-20 11:06:03,250 INFO L231 Difference]: Finished difference. Result has 133 places, 128 transitions, 262 flow [2022-11-20 11:06:03,253 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-20 11:06:03,261 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, -5 predicate places. [2022-11-20 11:06:03,262 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 128 transitions, 262 flow [2022-11-20 11:06:03,262 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-20 11:06:03,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:06:03,264 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-20 11:06:03,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:06:03,265 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-20 11:06:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:06:03,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2142861004, now seen corresponding path program 1 times [2022-11-20 11:06:03,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:06:03,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219708589] [2022-11-20 11:06:03,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:06:03,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:06:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:04,221 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-20 11:06:04,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:06:04,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219708589] [2022-11-20 11:06:04,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219708589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:06:04,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:06:04,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 11:06:04,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783236442] [2022-11-20 11:06:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:06:04,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:06:04,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:06:04,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:06:04,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:06:04,228 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 154 [2022-11-20 11:06:04,230 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-20 11:06:04,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:06:04,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 154 [2022-11-20 11:06:04,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:06:04,631 INFO L130 PetriNetUnfolder]: 295/679 cut-off events. [2022-11-20 11:06:04,632 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-20 11:06:04,639 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-20 11:06:04,646 INFO L137 encePairwiseOnDemand]: 144/154 looper letters, 44 selfloop transitions, 6 changer transitions 4/136 dead transitions. [2022-11-20 11:06:04,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 136 transitions, 386 flow [2022-11-20 11:06:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:06:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 11:06:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 815 transitions. [2022-11-20 11:06:04,658 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.661525974025974 [2022-11-20 11:06:04,659 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 815 transitions. [2022-11-20 11:06:04,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 815 transitions. [2022-11-20 11:06:04,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:06:04,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 815 transitions. [2022-11-20 11:06:04,663 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-20 11:06:04,670 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-20 11:06:04,671 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-20 11:06:04,672 INFO L175 Difference]: Start difference. First operand has 133 places, 128 transitions, 262 flow. Second operand 8 states and 815 transitions. [2022-11-20 11:06:04,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 136 transitions, 386 flow [2022-11-20 11:06:04,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 386 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:06:04,682 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 290 flow [2022-11-20 11:06:04,683 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-20 11:06:04,684 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 2 predicate places. [2022-11-20 11:06:04,685 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 290 flow [2022-11-20 11:06:04,686 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-20 11:06:04,686 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:06:04,687 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-20 11:06:04,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:06:04,688 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-20 11:06:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:06:04,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1947980679, now seen corresponding path program 1 times [2022-11-20 11:06:04,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:06:04,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771439507] [2022-11-20 11:06:04,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:06:04,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:06:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:05,062 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-20 11:06:05,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:06:05,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771439507] [2022-11-20 11:06:05,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771439507] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:06:05,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447597077] [2022-11-20 11:06:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:06:05,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:06:05,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:06:05,071 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:06:05,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:06:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:05,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:06:05,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:06:05,402 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-20 11:06:05,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:06:05,700 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-20 11:06:05,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447597077] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 11:06:05,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:06:05,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-20 11:06:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987772730] [2022-11-20 11:06:05,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:06:05,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:06:05,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:06:05,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:06:05,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:06:05,707 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 154 [2022-11-20 11:06:05,708 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-20 11:06:05,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:06:05,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 154 [2022-11-20 11:06:05,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:06:05,987 INFO L130 PetriNetUnfolder]: 175/511 cut-off events. [2022-11-20 11:06:05,988 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-20 11:06:05,990 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-20 11:06:05,993 INFO L137 encePairwiseOnDemand]: 146/154 looper letters, 33 selfloop transitions, 7 changer transitions 0/137 dead transitions. [2022-11-20 11:06:05,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 137 transitions, 388 flow [2022-11-20 11:06:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:06:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 11:06:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 838 transitions. [2022-11-20 11:06:05,999 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7773654916512059 [2022-11-20 11:06:05,999 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 838 transitions. [2022-11-20 11:06:05,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 838 transitions. [2022-11-20 11:06:06,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:06:06,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 838 transitions. [2022-11-20 11:06:06,003 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-20 11:06:06,007 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-20 11:06:06,008 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-20 11:06:06,008 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 290 flow. Second operand 7 states and 838 transitions. [2022-11-20 11:06:06,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 137 transitions, 388 flow [2022-11-20 11:06:06,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 370 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-11-20 11:06:06,014 INFO L231 Difference]: Finished difference. Result has 140 places, 131 transitions, 305 flow [2022-11-20 11:06:06,014 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-20 11:06:06,015 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 2 predicate places. [2022-11-20 11:06:06,016 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 131 transitions, 305 flow [2022-11-20 11:06:06,017 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-20 11:06:06,017 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:06:06,017 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-20 11:06:06,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:06:06,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:06:06,225 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-20 11:06:06,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:06:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1971120592, now seen corresponding path program 1 times [2022-11-20 11:06:06,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:06:06,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037172885] [2022-11-20 11:06:06,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:06:06,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:06:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:06,528 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-20 11:06:06,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:06:06,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037172885] [2022-11-20 11:06:06,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037172885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:06:06,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330060203] [2022-11-20 11:06:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:06:06,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:06:06,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:06:06,532 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:06:06,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:06:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:06,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:06:06,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:06:06,891 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-20 11:06:06,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:06:07,208 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-20 11:06:07,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330060203] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 11:06:07,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:06:07,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-20 11:06:07,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800064829] [2022-11-20 11:06:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:06:07,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:06:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:06:07,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:06:07,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-11-20 11:06:07,223 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 154 [2022-11-20 11:06:07,225 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-20 11:06:07,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:06:07,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 154 [2022-11-20 11:06:07,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:06:07,699 INFO L130 PetriNetUnfolder]: 600/1204 cut-off events. [2022-11-20 11:06:07,700 INFO L131 PetriNetUnfolder]: For 404/584 co-relation queries the response was YES. [2022-11-20 11:06:07,704 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-20 11:06:07,712 INFO L137 encePairwiseOnDemand]: 142/154 looper letters, 74 selfloop transitions, 19 changer transitions 0/183 dead transitions. [2022-11-20 11:06:07,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 183 transitions, 644 flow [2022-11-20 11:06:07,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:06:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 11:06:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1264 transitions. [2022-11-20 11:06:07,717 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7461629279811098 [2022-11-20 11:06:07,717 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1264 transitions. [2022-11-20 11:06:07,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1264 transitions. [2022-11-20 11:06:07,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:06:07,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1264 transitions. [2022-11-20 11:06:07,723 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-20 11:06:07,727 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-20 11:06:07,731 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-20 11:06:07,731 INFO L175 Difference]: Start difference. First operand has 140 places, 131 transitions, 305 flow. Second operand 11 states and 1264 transitions. [2022-11-20 11:06:07,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 183 transitions, 644 flow [2022-11-20 11:06:07,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 183 transitions, 631 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 11:06:07,741 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 404 flow [2022-11-20 11:06:07,742 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-20 11:06:07,744 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 14 predicate places. [2022-11-20 11:06:07,744 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 404 flow [2022-11-20 11:06:07,745 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-20 11:06:07,745 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:06:07,745 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-20 11:06:07,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:06:07,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:06:07,953 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-20 11:06:07,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:06:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash 797684560, now seen corresponding path program 2 times [2022-11-20 11:06:07,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:06:07,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233164321] [2022-11-20 11:06:07,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:06:07,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:06:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:08,222 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-20 11:06:08,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:06:08,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233164321] [2022-11-20 11:06:08,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233164321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:06:08,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937719200] [2022-11-20 11:06:08,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:06:08,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:06:08,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:06:08,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:06:08,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:06:08,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 11:06:08,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:06:08,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 11:06:08,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:06:08,712 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-20 11:06:08,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:06:08,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937719200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:06:08,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:06:08,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-11-20 11:06:08,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165311499] [2022-11-20 11:06:08,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:06:08,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:06:08,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:06:08,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:06:08,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:06:08,717 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 154 [2022-11-20 11:06:08,718 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-20 11:06:08,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:06:08,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 154 [2022-11-20 11:06:08,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:06:09,191 INFO L130 PetriNetUnfolder]: 412/876 cut-off events. [2022-11-20 11:06:09,192 INFO L131 PetriNetUnfolder]: For 824/929 co-relation queries the response was YES. [2022-11-20 11:06:09,196 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-20 11:06:09,203 INFO L137 encePairwiseOnDemand]: 145/154 looper letters, 42 selfloop transitions, 11 changer transitions 0/145 dead transitions. [2022-11-20 11:06:09,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 145 transitions, 503 flow [2022-11-20 11:06:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:06:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 11:06:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 865 transitions. [2022-11-20 11:06:09,207 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7021103896103896 [2022-11-20 11:06:09,207 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 865 transitions. [2022-11-20 11:06:09,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 865 transitions. [2022-11-20 11:06:09,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:06:09,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 865 transitions. [2022-11-20 11:06:09,211 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-20 11:06:09,215 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-20 11:06:09,216 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-20 11:06:09,216 INFO L175 Difference]: Start difference. First operand has 152 places, 143 transitions, 404 flow. Second operand 8 states and 865 transitions. [2022-11-20 11:06:09,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 145 transitions, 503 flow [2022-11-20 11:06:09,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 145 transitions, 490 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-20 11:06:09,227 INFO L231 Difference]: Finished difference. Result has 151 places, 137 transitions, 381 flow [2022-11-20 11:06:09,227 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-20 11:06:09,230 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 13 predicate places. [2022-11-20 11:06:09,230 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 137 transitions, 381 flow [2022-11-20 11:06:09,231 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-20 11:06:09,231 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:06:09,231 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-20 11:06:09,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:06:09,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:06:09,439 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-20 11:06:09,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:06:09,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1636578117, now seen corresponding path program 1 times [2022-11-20 11:06:09,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:06:09,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289119023] [2022-11-20 11:06:09,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:06:09,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:06:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:11,582 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-20 11:06:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:06:11,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289119023] [2022-11-20 11:06:11,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289119023] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:06:11,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700686650] [2022-11-20 11:06:11,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:06:11,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:06:11,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:06:11,586 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:06:11,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:06:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:11,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-20 11:06:11,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:06:13,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:06:13,372 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-20 11:06:14,360 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-20 11:06:14,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:06:15,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:06:15,982 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-20 11:06:22,674 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-20 11:06:22,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700686650] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:06:22,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:06:22,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 19] total 49 [2022-11-20 11:06:22,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748845359] [2022-11-20 11:06:22,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:06:22,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-20 11:06:22,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:06:22,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-20 11:06:22,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=2010, Unknown=0, NotChecked=0, Total=2352 [2022-11-20 11:06:22,683 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 154 [2022-11-20 11:06:22,687 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-20 11:06:22,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:06:22,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 154 [2022-11-20 11:06:22,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:06:32,210 INFO L130 PetriNetUnfolder]: 4969/8469 cut-off events. [2022-11-20 11:06:32,210 INFO L131 PetriNetUnfolder]: For 7142/7142 co-relation queries the response was YES. [2022-11-20 11:06:32,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21531 conditions, 8469 events. 4969/8469 cut-off events. For 7142/7142 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 60764 event pairs, 990 based on Foata normal form. 2/8417 useless extension candidates. Maximal degree in co-relation 21519. Up to 3137 conditions per place. [2022-11-20 11:06:32,319 INFO L137 encePairwiseOnDemand]: 116/154 looper letters, 403 selfloop transitions, 171 changer transitions 18/645 dead transitions. [2022-11-20 11:06:32,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 645 transitions, 3326 flow [2022-11-20 11:06:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-20 11:06:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2022-11-20 11:06:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 4788 transitions. [2022-11-20 11:06:32,340 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48579545454545453 [2022-11-20 11:06:32,340 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 4788 transitions. [2022-11-20 11:06:32,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 4788 transitions. [2022-11-20 11:06:32,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:06:32,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 4788 transitions. [2022-11-20 11:06:32,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 74.8125) internal successors, (4788), 64 states have internal predecessors, (4788), 0 states have call successors, (0), 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-20 11:06:32,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 154.0) internal successors, (10010), 65 states have internal predecessors, (10010), 0 states have call successors, (0), 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-20 11:06:32,400 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 154.0) internal successors, (10010), 65 states have internal predecessors, (10010), 0 states have call successors, (0), 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-20 11:06:32,400 INFO L175 Difference]: Start difference. First operand has 151 places, 137 transitions, 381 flow. Second operand 64 states and 4788 transitions. [2022-11-20 11:06:32,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 645 transitions, 3326 flow [2022-11-20 11:06:32,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 645 transitions, 3274 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 11:06:32,488 INFO L231 Difference]: Finished difference. Result has 246 places, 301 transitions, 1592 flow [2022-11-20 11:06:32,489 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=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=1592, PETRI_PLACES=246, PETRI_TRANSITIONS=301} [2022-11-20 11:06:32,492 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 108 predicate places. [2022-11-20 11:06:32,493 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 301 transitions, 1592 flow [2022-11-20 11:06:32,495 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-20 11:06:32,495 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:06:32,495 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-20 11:06:32,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:06:32,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 11:06:32,703 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-20 11:06:32,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:06:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1813782651, now seen corresponding path program 2 times [2022-11-20 11:06:32,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:06:32,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852756164] [2022-11-20 11:06:32,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:06:32,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:06:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:06:37,308 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-20 11:06:37,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:06:37,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852756164] [2022-11-20 11:06:37,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852756164] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:06:37,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560644642] [2022-11-20 11:06:37,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:06:37,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:06:37,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:06:37,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:06:37,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:06:37,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:06:37,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:06:37,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-20 11:06:37,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:06:38,339 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-20 11:06:38,837 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-20 11:06:38,996 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-20 11:06:39,318 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-20 11:06:40,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:06:40,277 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-20 11:06:40,935 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-20 11:06:40,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:06:49,247 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~min3~0 c_~min2~0)) (.cse10 (= c_~min2~0 c_~min1~0))) (and (or .cse0 (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 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_~A~0.base))) (let ((.cse2 (select .cse1 c_~A~0.offset))) (or (< 0 ~M~0) (< ~M~0 0) (< (select .cse1 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (not (< .cse2 c_~min1~0)) (= c_~min2~0 .cse2)))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 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))) (let ((.cse4 (select .cse5 c_~A~0.offset)) (.cse3 (select .cse5 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse3 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse4 c_~min1~0)) (= c_~min2~0 .cse4) (< .cse3 c_~min2~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_~A~0.base))) (let ((.cse6 (select .cse7 c_~A~0.offset))) (or (= c_~min3~0 .cse6) (< 0 ~M~0) (< ~M~0 0) (< (select .cse7 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (not (< .cse6 c_~min1~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 (* ~M~0 4))))) (or (not (< .cse8 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse8 c_~min1~0) (<= c_~min2~0 .cse8) (< (select .cse9 c_~A~0.offset) c_~min1~0))))) (or (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse10 .cse0)) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 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_~A~0.base))) (or (< 0 ~M~0) (< ~M~0 0) (< (select .cse11 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse11 c_~A~0.offset) c_~min1~0))))) (or .cse10 (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse13 (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 ((.cse12 (select .cse13 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse12 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (< (select .cse13 c_~A~0.offset) c_~min1~0) (< .cse12 c_~min2~0)))))))) is different from false [2022-11-20 11:06:51,129 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (< c_~min3~0 c_~min2~0)) (.cse8 (= c_~min2~0 c_~min1~0))) (and (or (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 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_main_#t~ret12#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (= c_~min2~0 .cse0) (not (< .cse0 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (< (select .cse1 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0))))) .cse2) (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_main_#t~ret12#1.base|))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse3 c_~min1~0)) (= .cse3 c_~min3~0) (< 0 ~M~0) (< ~M~0 0) (< (select .cse4 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~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_main_#t~ret12#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse6 (select .cse7 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= c_~min2~0 .cse5) (not (< .cse5 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse6 c_~min3~0)) (< .cse6 c_~min2~0))))) (or (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse8 .cse2)) (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_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< (select .cse9 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (< (select .cse9 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0))))) (or .cse8 (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse10 (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_main_#t~ret12#1.base|))) (let ((.cse11 (select .cse10 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< (select .cse10 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse11 c_~min3~0)) (< .cse11 c_~min2~0)))))) (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_main_#t~ret12#1.base|))) (let ((.cse13 (select .cse12 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< (select .cse12 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (<= c_~min2~0 .cse13) (= c_~min1~0 .cse13) (< 0 ~M~0) (< ~M~0 0) (not (< .cse13 c_~min3~0)))))))) is different from false [2022-11-20 11:06:53,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:06:53,560 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-20 11:06:53,580 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:53,581 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 550 treesize of output 526 [2022-11-20 11:06:53,615 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:53,616 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 522 treesize of output 446 [2022-11-20 11:06:53,645 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:53,646 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 442 treesize of output 406 [2022-11-20 11:06:53,680 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:53,680 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 261 treesize of output 245 [2022-11-20 11:06:55,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:06:55,259 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-20 11:06:55,280 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:55,280 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 527 treesize of output 507 [2022-11-20 11:06:55,306 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:55,307 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 503 treesize of output 443 [2022-11-20 11:06:55,332 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:55,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 439 treesize of output 411 [2022-11-20 11:06:55,356 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:55,357 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 313 treesize of output 301 [2022-11-20 11:06:56,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:06:56,481 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-20 11:06:56,504 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:56,505 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 375 treesize of output 363 [2022-11-20 11:06:56,530 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:56,531 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 359 treesize of output 343 [2022-11-20 11:06:56,557 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:56,558 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 339 treesize of output 303 [2022-11-20 11:06:56,585 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:56,586 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 205 treesize of output 199 [2022-11-20 11:06:57,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:06:57,410 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-20 11:06:57,436 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:57,436 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 531 treesize of output 511 [2022-11-20 11:06:57,474 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:57,475 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 507 treesize of output 479 [2022-11-20 11:06:57,508 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:57,508 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 475 treesize of output 415 [2022-11-20 11:06:57,544 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:06:57,545 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 213 treesize of output 201 [2022-11-20 11:06:58,477 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:06:58,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 1 [2022-11-20 11:06:58,502 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:06:58,502 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-20 11:06:58,969 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-20 11:06:58,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560644642] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:06:58,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:06:58,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 29, 23] total 71 [2022-11-20 11:06:58,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647242511] [2022-11-20 11:06:58,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:06:58,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-20 11:06:58,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:06:58,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-20 11:06:58,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=754, Invalid=3920, Unknown=26, NotChecked=270, Total=4970 [2022-11-20 11:06:58,978 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2022-11-20 11:06:58,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 301 transitions, 1592 flow. Second operand has 71 states, 71 states have (on average 57.816901408450704) internal successors, (4105), 71 states have internal predecessors, (4105), 0 states have call successors, (0), 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-20 11:06:58,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:06:58,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2022-11-20 11:06:58,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:07:35,452 INFO L130 PetriNetUnfolder]: 12904/21667 cut-off events. [2022-11-20 11:07:35,452 INFO L131 PetriNetUnfolder]: For 105010/105807 co-relation queries the response was YES. [2022-11-20 11:07:35,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84215 conditions, 21667 events. 12904/21667 cut-off events. For 105010/105807 co-relation queries the response was YES. Maximal size of possible extension queue 1353. Compared 176946 event pairs, 1593 based on Foata normal form. 33/21577 useless extension candidates. Maximal degree in co-relation 84166. Up to 6293 conditions per place. [2022-11-20 11:07:35,722 INFO L137 encePairwiseOnDemand]: 112/154 looper letters, 754 selfloop transitions, 786 changer transitions 15/1603 dead transitions. [2022-11-20 11:07:35,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1603 transitions, 13206 flow [2022-11-20 11:07:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-11-20 11:07:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2022-11-20 11:07:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 7650 transitions. [2022-11-20 11:07:35,741 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4105398733497907 [2022-11-20 11:07:35,741 INFO L72 ComplementDD]: Start complementDD. Operand 121 states and 7650 transitions. [2022-11-20 11:07:35,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 7650 transitions. [2022-11-20 11:07:35,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:07:35,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 121 states and 7650 transitions. [2022-11-20 11:07:35,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 122 states, 121 states have (on average 63.22314049586777) internal successors, (7650), 121 states have internal predecessors, (7650), 0 states have call successors, (0), 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-20 11:07:35,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 122 states, 122 states have (on average 154.0) internal successors, (18788), 122 states have internal predecessors, (18788), 0 states have call successors, (0), 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-20 11:07:35,800 INFO L81 ComplementDD]: Finished complementDD. Result has 122 states, 122 states have (on average 154.0) internal successors, (18788), 122 states have internal predecessors, (18788), 0 states have call successors, (0), 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-20 11:07:35,800 INFO L175 Difference]: Start difference. First operand has 246 places, 301 transitions, 1592 flow. Second operand 121 states and 7650 transitions. [2022-11-20 11:07:35,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 1603 transitions, 13206 flow [2022-11-20 11:07:36,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 1603 transitions, 13079 flow, removed 48 selfloop flow, removed 16 redundant places. [2022-11-20 11:07:36,970 INFO L231 Difference]: Finished difference. Result has 410 places, 1053 transitions, 9917 flow [2022-11-20 11:07:36,971 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=1518, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=121, PETRI_FLOW=9917, PETRI_PLACES=410, PETRI_TRANSITIONS=1053} [2022-11-20 11:07:36,972 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 272 predicate places. [2022-11-20 11:07:36,972 INFO L495 AbstractCegarLoop]: Abstraction has has 410 places, 1053 transitions, 9917 flow [2022-11-20 11:07:36,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 57.816901408450704) internal successors, (4105), 71 states have internal predecessors, (4105), 0 states have call successors, (0), 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-20 11:07:36,984 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:07:36,985 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-20 11:07:36,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:07:37,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:07:37,192 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-20 11:07:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:37,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1132651911, now seen corresponding path program 3 times [2022-11-20 11:07:37,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:37,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875538478] [2022-11-20 11:07:37,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:37,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:39,153 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-20 11:07:39,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:39,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875538478] [2022-11-20 11:07:39,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875538478] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:07:39,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555147162] [2022-11-20 11:07:39,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:07:39,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:07:39,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:07:39,156 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:07:39,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:07:39,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 11:07:39,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:07:39,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 11:07:39,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:07:40,169 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-20 11:07:40,658 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-20 11:07:41,012 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-20 11:07:41,184 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-20 11:07:42,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:07:42,441 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-20 11:07:43,024 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-20 11:07:43,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:07:50,746 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (<= c_~min2~0 c_~min3~0)) (.cse8 (= c_~min2~0 c_~min1~0)) (.cse3 (< c_~min3~0 c_~min2~0))) (and (forall ((v_ArrVal_229 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |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 ((.cse1 (select .cse2 c_~A~0.offset)) (.cse0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse0 c_~min2~0) (< 0 ~M~0) (< ~M~0 0) (= c_~min2~0 .cse1) (not (< .cse1 c_~min1~0)) (not (< .cse0 c_~min3~0)))))) (or .cse3 (forall ((v_ArrVal_229 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |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 .cse4 c_~A~0.offset))) (or (< 0 ~M~0) (< ~M~0 0) (< (select .cse4 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= c_~min2~0 .cse5) (not (< .cse5 c_~min1~0))))))) (forall ((v_ArrVal_229 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |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 ((.cse7 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (or (< (select .cse6 c_~A~0.offset) c_~min1~0) (< 0 ~M~0) (= c_~min1~0 .cse7) (< ~M~0 0) (<= c_~min2~0 .cse7) (not (< .cse7 c_~min3~0)))))) (or .cse8 (forall ((v_ArrVal_229 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |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 .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (< (select .cse9 c_~A~0.offset) c_~min1~0) (< .cse10 c_~min2~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse10 c_~min3~0))))))) (or .cse11 (forall ((v_ArrVal_229 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |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 ((.cse12 (select .cse13 c_~A~0.offset))) (or (< 0 ~M~0) (= .cse12 c_~min3~0) (< ~M~0 0) (< (select .cse13 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (not (< .cse12 c_~min1~0))))))) (or (and (or .cse11 (= c_~min1~0 c_~min3~0)) (or .cse8 .cse3)) (forall ((v_ArrVal_229 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |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 (< (select .cse14 c_~A~0.offset) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (< (select .cse14 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0))))))) is different from false [2022-11-20 11:07:54,139 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (<= c_~min2~0 c_~min3~0)) (.cse0 (= c_~min2~0 c_~min1~0)) (.cse6 (< c_~min3~0 c_~min2~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 ((.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_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse2 (select .cse1 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (< (select .cse1 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< .cse2 c_~min2~0) (not (< .cse2 c_~min3~0))))))) (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 ((.cse5 (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_main_#t~ret12#1.base|))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse4 c_~min1~0)) (< 0 ~M~0) (= c_~min3~0 .cse4) (< ~M~0 0) (< (select .cse5 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0)))))) (or (and (or .cse3 (= c_~min1~0 c_~min3~0)) (or .cse0 .cse6)) (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse7 (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_main_#t~ret12#1.base|))) (or (< 0 ~M~0) (< ~M~0 0) (< (select .cse7 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< (select .cse7 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0))))) (or (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_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse8 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (= c_~min2~0 .cse8) (< (select .cse9 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0))))) .cse6) (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_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse10 (select .cse11 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= c_~min1~0 .cse10) (< 0 ~M~0) (< ~M~0 0) (< (select .cse11 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (<= c_~min2~0 .cse10) (not (< .cse10 c_~min3~0)))))) (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_main_#t~ret12#1.base|))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse13 (select .cse14 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< .cse12 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (= c_~min2~0 .cse12) (< .cse13 c_~min2~0) (not (< .cse13 c_~min3~0)))))))) is different from false [2022-11-20 11:07:54,524 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (= c_~min2~0 c_~min1~0)) (.cse8 (<= c_~min2~0 c_~min3~0)) (.cse9 (< c_~min3~0 c_~min2~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_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse0 (select .cse1 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< 0 ~M~0) (<= c_~min2~0 .cse0) (= c_~min1~0 .cse0) (not (< .cse0 c_~min3~0)) (< ~M~0 0) (< (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0))))) (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 ((.cse2 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse3 (select .cse4 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= c_~min2~0 .cse2) (< 0 ~M~0) (not (< .cse3 c_~min3~0)) (< ~M~0 0) (not (< .cse2 c_~min1~0)) (< .cse3 c_~min2~0))))) (or .cse5 (forall ((v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int)) (~M~0 Int) (v_ArrVal_230 (Array Int Int))) (let ((.cse7 (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 .cse7 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< 0 ~M~0) (not (< .cse6 c_~min3~0)) (< ~M~0 0) (< .cse6 c_~min2~0) (< (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0)))))) (or (and (or .cse8 (= c_~min1~0 c_~min3~0)) (or .cse5 .cse9)) (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|))) (or (< 0 ~M~0) (< ~M~0 0) (< (select .cse10 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (< (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0))))) (or .cse8 (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|))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse11 c_~min1~0)) (= c_~min3~0 .cse11) (< (select .cse12 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0)))))) (or .cse9 (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_~min2~0 .cse13) (< 0 ~M~0) (< ~M~0 0) (not (< .cse13 c_~min1~0)) (< (select .cse14 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0)))))))) is different from false [2022-11-20 11:07:56,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:07:56,298 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-20 11:07:56,322 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:07:56,323 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-20 11:07:56,386 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:07:56,392 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-20 11:07:56,457 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:07:56,459 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 1738 [2022-11-20 11:07:56,558 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:07:56,559 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 1330 treesize of output 1254 [2022-11-20 11:08:17,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:08:17,075 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-20 11:08:17,100 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:17,100 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 1095 treesize of output 1051 [2022-11-20 11:08:17,143 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:17,144 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 1047 treesize of output 987 [2022-11-20 11:08:17,180 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:17,180 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 983 treesize of output 859 [2022-11-20 11:08:17,216 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:17,216 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 855 treesize of output 827 [2022-11-20 11:08:18,048 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:08:18,049 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-20 11:08:18,080 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:18,081 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-20 11:08:18,132 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:18,133 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-20 11:08:18,182 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:18,183 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 1369 treesize of output 1293 [2022-11-20 11:08:18,229 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:18,230 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 1289 treesize of output 1253 [2022-11-20 11:08:19,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:08:19,172 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-20 11:08:19,203 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:19,204 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-20 11:08:19,257 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:19,257 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 1453 [2022-11-20 11:08:19,305 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:19,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 1449 treesize of output 1293 [2022-11-20 11:08:19,353 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:19,354 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 885 treesize of output 849 [2022-11-20 11:08:20,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:08:20,586 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-20 11:08:20,620 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:20,621 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-20 11:08:20,660 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:20,661 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-20 11:08:20,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:08:20,701 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-20 11:08:20,730 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:08:20,731 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-20 11:08:27,876 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 11:08:27,877 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-20 11:08:28,425 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-20 11:08:28,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555147162] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:08:28,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:08:28,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 32, 26] total 68 [2022-11-20 11:08:28,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241315731] [2022-11-20 11:08:28,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:08:28,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-20 11:08:28,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:08:28,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-20 11:08:28,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=3592, Unknown=29, NotChecked=384, Total=4556 [2022-11-20 11:08:28,434 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 154 [2022-11-20 11:08:28,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 1053 transitions, 9917 flow. Second operand has 68 states, 68 states have (on average 58.970588235294116) internal successors, (4010), 68 states have internal predecessors, (4010), 0 states have call successors, (0), 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-20 11:08:28,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:08:28,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 154 [2022-11-20 11:08:28,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:08:56,589 INFO L130 PetriNetUnfolder]: 18767/31536 cut-off events. [2022-11-20 11:08:56,590 INFO L131 PetriNetUnfolder]: For 366012/367602 co-relation queries the response was YES. [2022-11-20 11:08:57,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166179 conditions, 31536 events. 18767/31536 cut-off events. For 366012/367602 co-relation queries the response was YES. Maximal size of possible extension queue 2006. Compared 268104 event pairs, 1166 based on Foata normal form. 59/31409 useless extension candidates. Maximal degree in co-relation 166070. Up to 16488 conditions per place. [2022-11-20 11:08:57,552 INFO L137 encePairwiseOnDemand]: 111/154 looper letters, 961 selfloop transitions, 1433 changer transitions 30/2474 dead transitions. [2022-11-20 11:08:57,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 2474 transitions, 30587 flow [2022-11-20 11:08:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-20 11:08:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2022-11-20 11:08:57,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 5141 transitions. [2022-11-20 11:08:57,583 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42257109978628965 [2022-11-20 11:08:57,583 INFO L72 ComplementDD]: Start complementDD. Operand 79 states and 5141 transitions. [2022-11-20 11:08:57,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 5141 transitions. [2022-11-20 11:08:57,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:08:57,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 79 states and 5141 transitions. [2022-11-20 11:08:57,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 80 states, 79 states have (on average 65.07594936708861) internal successors, (5141), 79 states have internal predecessors, (5141), 0 states have call successors, (0), 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-20 11:08:57,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 80 states, 80 states have (on average 154.0) internal successors, (12320), 80 states have internal predecessors, (12320), 0 states have call successors, (0), 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-20 11:08:57,643 INFO L81 ComplementDD]: Finished complementDD. Result has 80 states, 80 states have (on average 154.0) internal successors, (12320), 80 states have internal predecessors, (12320), 0 states have call successors, (0), 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-20 11:08:57,644 INFO L175 Difference]: Start difference. First operand has 410 places, 1053 transitions, 9917 flow. Second operand 79 states and 5141 transitions. [2022-11-20 11:08:57,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 2474 transitions, 30587 flow [2022-11-20 11:09:07,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 2474 transitions, 27306 flow, removed 1587 selfloop flow, removed 18 redundant places. [2022-11-20 11:09:07,781 INFO L231 Difference]: Finished difference. Result has 515 places, 2115 transitions, 25391 flow [2022-11-20 11:09:07,782 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=8577, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1053, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=510, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=25391, PETRI_PLACES=515, PETRI_TRANSITIONS=2115} [2022-11-20 11:09:07,783 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 377 predicate places. [2022-11-20 11:09:07,783 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 2115 transitions, 25391 flow [2022-11-20 11:09:07,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 58.970588235294116) internal successors, (4010), 68 states have internal predecessors, (4010), 0 states have call successors, (0), 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-20 11:09:07,785 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:09:07,786 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-20 11:09:07,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:09:07,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 11:09:07,993 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:09:07,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:09:07,993 INFO L85 PathProgramCache]: Analyzing trace with hash -678288927, now seen corresponding path program 4 times [2022-11-20 11:09:07,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:09:07,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56713228] [2022-11-20 11:09:07,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:09:07,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:09:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:09:10,434 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-20 11:09:10,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:09:10,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56713228] [2022-11-20 11:09:10,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56713228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:09:10,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480184536] [2022-11-20 11:09:10,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:09:10,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:09:10,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:09:10,436 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:09:10,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 11:09:10,558 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:09:10,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:09:10,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 11:09:10,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:09:12,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:09:12,308 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-20 11:09:12,931 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-20 11:09:12,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:09:14,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:09:14,512 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 164 treesize of output 164 [2022-11-20 11:09:22,060 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-20 11:09:22,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480184536] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:09:22,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:09:22,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 21] total 55 [2022-11-20 11:09:22,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134351050] [2022-11-20 11:09:22,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:09:22,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-20 11:09:22,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:09:22,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-20 11:09:22,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=2465, Unknown=0, NotChecked=0, Total=2970 [2022-11-20 11:09:22,069 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 154 [2022-11-20 11:09:22,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 2115 transitions, 25391 flow. Second operand has 55 states, 55 states have (on average 75.07272727272728) internal successors, (4129), 55 states have internal predecessors, (4129), 0 states have call successors, (0), 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-20 11:09:22,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:09:22,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 154 [2022-11-20 11:09:22,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:09:55,367 INFO L130 PetriNetUnfolder]: 24096/42336 cut-off events. [2022-11-20 11:09:55,368 INFO L131 PetriNetUnfolder]: For 991068/997263 co-relation queries the response was YES. [2022-11-20 11:09:56,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315689 conditions, 42336 events. 24096/42336 cut-off events. For 991068/997263 co-relation queries the response was YES. Maximal size of possible extension queue 2228. Compared 392036 event pairs, 1769 based on Foata normal form. 683/42235 useless extension candidates. Maximal degree in co-relation 315535. Up to 11895 conditions per place. [2022-11-20 11:09:56,724 INFO L137 encePairwiseOnDemand]: 121/154 looper letters, 805 selfloop transitions, 1986 changer transitions 7/3278 dead transitions. [2022-11-20 11:09:56,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 3278 transitions, 45361 flow [2022-11-20 11:09:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-20 11:09:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-11-20 11:09:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3415 transitions. [2022-11-20 11:09:56,734 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5157052250075506 [2022-11-20 11:09:56,735 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3415 transitions. [2022-11-20 11:09:56,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3415 transitions. [2022-11-20 11:09:56,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:09:56,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3415 transitions. [2022-11-20 11:09:56,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 79.4186046511628) internal successors, (3415), 43 states have internal predecessors, (3415), 0 states have call successors, (0), 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-20 11:09:56,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 154.0) internal successors, (6776), 44 states have internal predecessors, (6776), 0 states have call successors, (0), 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-20 11:09:56,761 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 154.0) internal successors, (6776), 44 states have internal predecessors, (6776), 0 states have call successors, (0), 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-20 11:09:56,762 INFO L175 Difference]: Start difference. First operand has 515 places, 2115 transitions, 25391 flow. Second operand 43 states and 3415 transitions. [2022-11-20 11:09:56,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 3278 transitions, 45361 flow [2022-11-20 11:10:45,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 3278 transitions, 42125 flow, removed 1597 selfloop flow, removed 18 redundant places. [2022-11-20 11:10:45,586 INFO L231 Difference]: Finished difference. Result has 551 places, 3022 transitions, 41640 flow [2022-11-20 11:10:45,587 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=22951, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=41640, PETRI_PLACES=551, PETRI_TRANSITIONS=3022} [2022-11-20 11:10:45,588 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 413 predicate places. [2022-11-20 11:10:45,588 INFO L495 AbstractCegarLoop]: Abstraction has has 551 places, 3022 transitions, 41640 flow [2022-11-20 11:10:45,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 75.07272727272728) internal successors, (4129), 55 states have internal predecessors, (4129), 0 states have call successors, (0), 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-20 11:10:45,589 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:10:45,589 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-20 11:10:45,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 11:10:45,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:10:45,791 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 11:10:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:10:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash 815230947, now seen corresponding path program 5 times [2022-11-20 11:10:45,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:10:45,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781999219] [2022-11-20 11:10:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:10:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:10:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:10:47,739 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-20 11:10:47,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:10:47,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781999219] [2022-11-20 11:10:47,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781999219] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:10:47,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446817728] [2022-11-20 11:10:47,743 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 11:10:47,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:10:47,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:10:47,745 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:10:47,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5aede864-4e52-452e-82cd-8feadda410c3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 11:10:47,889 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:10:47,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:10:47,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-20 11:10:47,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:10:47,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-20 11:10:48,061 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:10:48,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 11:10:48,728 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 11:10:48,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 11:10:49,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 11:10:49,917 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-20 11:10:50,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 11:10:50,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-20 11:10:51,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:10:51,268 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-20 11:10:52,757 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-20 11:10:52,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:11:09,004 WARN L233 SmtUtils]: Spent 13.13s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:11:29,152 WARN L233 SmtUtils]: Spent 15.73s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:11:29,658 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (let ((.cse0 (<= c_~min2~0 c_~min3~0)) (.cse3 (= c_~min2~0 c_~min1~0)) (.cse4 (< c_~min3~0 c_~min2~0))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (let ((.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (not (< .cse1 c_~min1~0)) (= c_~min3~0 .cse1) (not (< ~M~0 c_~N~0)) (< (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (+ ~M~0 1) c_~N~0)))))) (or (and (or .cse0 (= c_~min1~0 c_~min3~0)) (or .cse3 .cse4)) (forall ((~M~0 Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (or (not (< ~M~0 c_~N~0)) (< (select (select .cse5 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_300 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (or (forall ((~M~0 Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse6) (not (< ~M~0 c_~N~0)) (<= c_~min2~0 .cse6) (not (< .cse6 c_~min3~0)) (< (+ ~M~0 1) c_~N~0)))) (< (select (select .cse7 c_~A~0.base) c_~A~0.offset) c_~min1~0)))) (or .cse3 (forall ((~M~0 Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< .cse8 c_~min3~0)) (< (select (select .cse9 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< .cse8 c_~min2~0) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (let ((.cse10 (select (select .cse11 c_~A~0.base) c_~A~0.offset))) (or (not (< .cse10 c_~min1~0)) (not (< ~M~0 c_~N~0)) (= c_~min2~0 .cse10) (< (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (+ ~M~0 1) c_~N~0))))) .cse4) (forall ((v_ArrVal_300 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (let ((.cse12 (select (select .cse14 c_~A~0.base) c_~A~0.offset))) (or (not (< .cse12 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse13 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< .cse13 c_~min3~0)) (< .cse13 c_~min2~0) (< (+ ~M~0 1) c_~N~0)))) (= c_~min2~0 .cse12))))) (forall ((v_ArrVal_300 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (let ((.cse15 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (not (< .cse15 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (<= c_~min2~0 .cse16) (not (< .cse16 c_~min3~0)) (= .cse16 .cse15) (< (+ ~M~0 1) c_~N~0))))))))))) is different from false [2022-11-20 11:11:37,106 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (let ((.cse11 (<= c_~min2~0 c_~min3~0)) (.cse3 (= c_~min2~0 c_~min1~0)) (.cse2 (< c_~min3~0 c_~min2~0))) (and (or (forall ((~M~0 Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_299) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< ~M~0 c_~N~0)) (< (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (not (< .cse1 c_~min1~0)) (= c_~min2~0 .cse1) (< (+ ~M~0 1) c_~N~0))))) .cse2) (or .cse3 (forall ((~M~0 Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_299) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (let ((.cse5 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< .cse5 c_~min2~0) (< (+ ~M~0 1) c_~N~0) (not (< .cse5 c_~min3~0))))))) (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_299) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse6 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (< .cse7 c_~min2~0) (< (+ ~M~0 1) c_~N~0) (not (< .cse7 c_~min3~0))))) (= c_~min2~0 .cse6))))) (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_299) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (or (forall ((~M~0 Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (= c_~min1~0 .cse9) (<= c_~min2~0 .cse9) (< (+ ~M~0 1) c_~N~0) (not (< .cse9 c_~min3~0))))) (< (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (or .cse11 (forall ((~M~0 Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_299) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< ~M~0 c_~N~0)) (< (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (not (< .cse13 c_~min1~0)) (= c_~min3~0 .cse13) (< (+ ~M~0 1) c_~N~0)))))) (or (and (or .cse11 (= c_~min1~0 c_~min3~0)) (or .cse3 .cse2)) (forall ((~M~0 Int) (v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_301 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_299) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (or (not (< ~M~0 c_~N~0)) (< (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_299) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_300))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse15 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_301) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse16 .cse15) (not (< ~M~0 c_~N~0)) (<= c_~min2~0 .cse16) (< (+ ~M~0 1) c_~N~0) (not (< .cse16 c_~min3~0)))))))))))) is different from false [2022-11-20 11:11:41,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:11:41,297 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 117 treesize of output 81 [2022-11-20 11:11:41,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:11:41,316 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 847 treesize of output 809 [2022-11-20 11:11:41,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 580 treesize of output 484 [2022-11-20 11:11:41,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:11:41,368 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 535 treesize of output 513 [2022-11-20 11:11:41,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:11:41,397 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 671 treesize of output 617 [2022-11-20 11:11:43,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 11:11:43,863 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 91 treesize of output 67 [2022-11-20 11:11:43,889 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:11:43,890 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 2621 treesize of output 2489 [2022-11-20 11:11:43,945 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:11:43,946 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 2485 treesize of output 2389 [2022-11-20 11:11:43,998 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 11:11:43,999 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 1831 treesize of output 1635 [2022-11-20 11:11:44,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2092 treesize of output 1708