./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro --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 9abac63211b9980a3b9079d9eb140a85fbc6c5adec6517ed998cc9e140b19342 --- 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-8393723 [2022-11-18 19:55:46,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:55:46,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:55:46,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:55:46,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:55:46,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:55:46,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:55:46,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:55:46,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:55:46,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:55:46,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:55:46,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:55:46,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:55:46,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:55:46,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:55:46,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:55:46,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:55:46,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:55:46,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:55:46,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:55:46,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:55:46,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:55:46,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:55:46,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:55:46,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:55:46,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:55:46,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:55:46,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:55:46,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:55:46,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:55:46,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:55:46,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:55:46,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:55:46,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:55:46,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:55:46,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:55:46,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:55:46,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:55:46,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:55:46,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:55:46,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:55:46,230 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:55:46,269 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:55:46,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:55:46,270 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:55:46,270 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:55:46,272 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:55:46,272 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:55:46,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:55:46,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:55:46,273 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:55:46,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:55:46,275 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:55:46,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:55:46,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:55:46,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:55:46,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:55:46,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:55:46,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:55:46,277 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:55:46,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:55:46,277 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:55:46,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:55:46,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:55:46,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:55:46,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:55:46,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:55:46,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:55:46,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:55:46,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:55:46,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:55:46,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:55:46,282 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:55:46,282 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:55:46,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:55:46,283 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_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/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_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro 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 -> 9abac63211b9980a3b9079d9eb140a85fbc6c5adec6517ed998cc9e140b19342 [2022-11-18 19:55:46,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:55:46,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:55:46,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:55:46,642 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:55:46,643 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:55:46,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2022-11-18 19:55:46,718 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/data/9f73bffa5/b58d5865729f4e358081f537e9a37929/FLAGaf0b850f8 [2022-11-18 19:55:47,259 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:55:47,260 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2022-11-18 19:55:47,280 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/data/9f73bffa5/b58d5865729f4e358081f537e9a37929/FLAGaf0b850f8 [2022-11-18 19:55:47,626 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/data/9f73bffa5/b58d5865729f4e358081f537e9a37929 [2022-11-18 19:55:47,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:55:47,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:55:47,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:55:47,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:55:47,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:55:47,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:55:47" (1/1) ... [2022-11-18 19:55:47,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45cb992d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47, skipping insertion in model container [2022-11-18 19:55:47,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:55:47" (1/1) ... [2022-11-18 19:55:47,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:55:47,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:55:47,888 WARN L234 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_d05155a6-50c5-42d5-9f25-210cba62f9c7/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-11-18 19:55:47,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:55:47,909 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:55:47,932 WARN L234 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_d05155a6-50c5-42d5-9f25-210cba62f9c7/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-11-18 19:55:47,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:55:47,951 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:55:47,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47 WrapperNode [2022-11-18 19:55:47,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:55:47,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:55:47,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:55:47,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:55:47,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47" (1/1) ... [2022-11-18 19:55:47,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47" (1/1) ... [2022-11-18 19:55:48,016 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-11-18 19:55:48,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:55:48,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:55:48,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:55:48,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:55:48,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47" (1/1) ... [2022-11-18 19:55:48,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47" (1/1) ... [2022-11-18 19:55:48,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47" (1/1) ... [2022-11-18 19:55:48,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47" (1/1) ... [2022-11-18 19:55:48,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47" (1/1) ... [2022-11-18 19:55:48,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47" (1/1) ... [2022-11-18 19:55:48,068 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47" (1/1) ... [2022-11-18 19:55:48,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47" (1/1) ... [2022-11-18 19:55:48,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:55:48,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:55:48,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:55:48,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:55:48,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47" (1/1) ... [2022-11-18 19:55:48,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:55:48,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:48,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:55:48,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:55:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:55:48,177 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-18 19:55:48,178 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-18 19:55:48,178 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-18 19:55:48,179 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-18 19:55:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-18 19:55:48,179 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-18 19:55:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:55:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:55:48,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:55:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 19:55:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 19:55:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:55:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:55:48,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:55:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:55:48,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:55:48,182 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 19:55:48,322 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:55:48,323 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:55:48,716 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:55:48,850 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:55:48,859 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 19:55:48,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:55:48 BoogieIcfgContainer [2022-11-18 19:55:48,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:55:48,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:55:48,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:55:48,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:55:48,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:55:47" (1/3) ... [2022-11-18 19:55:48,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aab9ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:55:48, skipping insertion in model container [2022-11-18 19:55:48,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:55:47" (2/3) ... [2022-11-18 19:55:48,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aab9ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:55:48, skipping insertion in model container [2022-11-18 19:55:48,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:55:48" (3/3) ... [2022-11-18 19:55:48,892 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2022-11-18 19:55:48,906 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 19:55:48,919 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:55:48,919 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 19:55:48,920 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:55:49,041 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 19:55:49,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 330 flow [2022-11-18 19:55:49,175 INFO L130 PetriNetUnfolder]: 12/150 cut-off events. [2022-11-18 19:55:49,175 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 19:55:49,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 12/150 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/137 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2022-11-18 19:55:49,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 153 transitions, 330 flow [2022-11-18 19:55:49,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 139 transitions, 296 flow [2022-11-18 19:55:49,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:55:49,205 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;@5367c13a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:55:49,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-18 19:55:49,275 INFO L130 PetriNetUnfolder]: 12/138 cut-off events. [2022-11-18 19:55:49,283 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 19:55:49,283 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:49,284 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] [2022-11-18 19:55:49,285 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-18 19:55:49,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1463698298, now seen corresponding path program 1 times [2022-11-18 19:55:49,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:49,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852310832] [2022-11-18 19:55:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:49,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:49,678 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-18 19:55:49,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:49,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852310832] [2022-11-18 19:55:49,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852310832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:49,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:49,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:49,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744318765] [2022-11-18 19:55:49,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:49,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 19:55:49,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:49,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 19:55:49,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 19:55:49,755 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 153 [2022-11-18 19:55:49,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 139 transitions, 296 flow. Second operand has 2 states, 2 states have (on average 140.0) internal successors, (280), 2 states have internal predecessors, (280), 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-18 19:55:49,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:49,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 153 [2022-11-18 19:55:49,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:49,907 INFO L130 PetriNetUnfolder]: 41/264 cut-off events. [2022-11-18 19:55:49,907 INFO L131 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2022-11-18 19:55:49,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 264 events. 41/264 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 717 event pairs, 15 based on Foata normal form. 42/275 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-11-18 19:55:49,912 INFO L137 encePairwiseOnDemand]: 145/153 looper letters, 9 selfloop transitions, 0 changer transitions 4/131 dead transitions. [2022-11-18 19:55:49,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 298 flow [2022-11-18 19:55:49,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 19:55:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 19:55:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2022-11-18 19:55:49,927 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2022-11-18 19:55:49,928 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2022-11-18 19:55:49,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2022-11-18 19:55:49,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:49,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2022-11-18 19:55:49,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 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-18 19:55:49,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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-18 19:55:49,942 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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-18 19:55:49,944 INFO L175 Difference]: Start difference. First operand has 137 places, 139 transitions, 296 flow. Second operand 2 states and 287 transitions. [2022-11-18 19:55:49,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 298 flow [2022-11-18 19:55:49,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 286 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-18 19:55:49,952 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 260 flow [2022-11-18 19:55:49,954 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=260, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2022-11-18 19:55:49,958 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, -5 predicate places. [2022-11-18 19:55:49,958 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 260 flow [2022-11-18 19:55:49,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 140.0) internal successors, (280), 2 states have internal predecessors, (280), 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-18 19:55:49,959 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:49,959 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] [2022-11-18 19:55:49,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:55:49,960 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-18 19:55:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash 563593522, now seen corresponding path program 1 times [2022-11-18 19:55:49,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:49,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867663176] [2022-11-18 19:55:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:50,691 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-18 19:55:50,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:50,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867663176] [2022-11-18 19:55:50,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867663176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:50,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:50,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:55:50,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862665726] [2022-11-18 19:55:50,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:50,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:55:50,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:50,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:55:50,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:55:50,698 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 153 [2022-11-18 19:55:50,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 260 flow. Second operand has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 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-18 19:55:50,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:50,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 153 [2022-11-18 19:55:50,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:51,170 INFO L130 PetriNetUnfolder]: 295/678 cut-off events. [2022-11-18 19:55:51,170 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-18 19:55:51,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 678 events. 295/678 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3005 event pairs, 167 based on Foata normal form. 1/510 useless extension candidates. Maximal degree in co-relation 1134. Up to 421 conditions per place. [2022-11-18 19:55:51,181 INFO L137 encePairwiseOnDemand]: 143/153 looper letters, 44 selfloop transitions, 6 changer transitions 4/135 dead transitions. [2022-11-18 19:55:51,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 135 transitions, 384 flow [2022-11-18 19:55:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:55:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:55:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 901 transitions. [2022-11-18 19:55:51,190 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2022-11-18 19:55:51,190 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 901 transitions. [2022-11-18 19:55:51,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 901 transitions. [2022-11-18 19:55:51,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:51,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 901 transitions. [2022-11-18 19:55:51,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.11111111111111) internal successors, (901), 9 states have internal predecessors, (901), 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-18 19:55:51,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 153.0) internal successors, (1530), 10 states have internal predecessors, (1530), 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-18 19:55:51,202 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 153.0) internal successors, (1530), 10 states have internal predecessors, (1530), 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-18 19:55:51,203 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 260 flow. Second operand 9 states and 901 transitions. [2022-11-18 19:55:51,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 135 transitions, 384 flow [2022-11-18 19:55:51,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 135 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 19:55:51,210 INFO L231 Difference]: Finished difference. Result has 140 places, 128 transitions, 286 flow [2022-11-18 19:55:51,210 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=286, PETRI_PLACES=140, PETRI_TRANSITIONS=128} [2022-11-18 19:55:51,211 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 3 predicate places. [2022-11-18 19:55:51,212 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 286 flow [2022-11-18 19:55:51,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 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-18 19:55:51,213 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:51,213 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] [2022-11-18 19:55:51,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:55:51,214 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-18 19:55:51,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1756520908, now seen corresponding path program 1 times [2022-11-18 19:55:51,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:51,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935505631] [2022-11-18 19:55:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:51,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:51,554 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-18 19:55:51,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:51,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935505631] [2022-11-18 19:55:51,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935505631] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:51,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893404007] [2022-11-18 19:55:51,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:51,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:51,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:51,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:51,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:55:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:51,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:55:51,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:51,977 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-18 19:55:51,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:52,233 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-18 19:55:52,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893404007] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:52,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:55:52,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-18 19:55:52,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062009343] [2022-11-18 19:55:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:52,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:55:52,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:52,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:55:52,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:55:52,242 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2022-11-18 19:55:52,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 128 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 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-18 19:55:52,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:52,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2022-11-18 19:55:52,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:52,502 INFO L130 PetriNetUnfolder]: 182/617 cut-off events. [2022-11-18 19:55:52,502 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-11-18 19:55:52,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 617 events. 182/617 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3083 event pairs, 80 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 934. Up to 141 conditions per place. [2022-11-18 19:55:52,514 INFO L137 encePairwiseOnDemand]: 145/153 looper letters, 33 selfloop transitions, 7 changer transitions 0/136 dead transitions. [2022-11-18 19:55:52,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 384 flow [2022-11-18 19:55:52,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:55:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 19:55:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2022-11-18 19:55:52,517 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7759103641456583 [2022-11-18 19:55:52,517 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2022-11-18 19:55:52,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2022-11-18 19:55:52,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:52,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2022-11-18 19:55:52,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 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-18 19:55:52,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 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-18 19:55:52,524 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 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-18 19:55:52,525 INFO L175 Difference]: Start difference. First operand has 140 places, 128 transitions, 286 flow. Second operand 7 states and 831 transitions. [2022-11-18 19:55:52,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 384 flow [2022-11-18 19:55:52,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 368 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-11-18 19:55:52,532 INFO L231 Difference]: Finished difference. Result has 139 places, 130 transitions, 303 flow [2022-11-18 19:55:52,533 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=303, PETRI_PLACES=139, PETRI_TRANSITIONS=130} [2022-11-18 19:55:52,535 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-11-18 19:55:52,535 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 130 transitions, 303 flow [2022-11-18 19:55:52,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 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-18 19:55:52,536 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:52,537 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] [2022-11-18 19:55:52,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:55:52,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-18 19:55:52,743 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-18 19:55:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1514646045, now seen corresponding path program 1 times [2022-11-18 19:55:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:52,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944221187] [2022-11-18 19:55:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:53,042 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-18 19:55:53,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:53,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944221187] [2022-11-18 19:55:53,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944221187] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:53,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709167600] [2022-11-18 19:55:53,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:53,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:53,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:53,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:53,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:55:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:53,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 19:55:53,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:53,394 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-18 19:55:53,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:53,683 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-18 19:55:53,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709167600] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:53,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:55:53,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-18 19:55:53,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685199867] [2022-11-18 19:55:53,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:53,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:55:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:53,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:55:53,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-18 19:55:53,688 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-11-18 19:55:53,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 130 transitions, 303 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 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-18 19:55:53,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:53,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-11-18 19:55:53,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:54,260 INFO L130 PetriNetUnfolder]: 854/1551 cut-off events. [2022-11-18 19:55:54,260 INFO L131 PetriNetUnfolder]: For 557/813 co-relation queries the response was YES. [2022-11-18 19:55:54,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3288 conditions, 1551 events. 854/1551 cut-off events. For 557/813 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8602 event pairs, 215 based on Foata normal form. 256/1642 useless extension candidates. Maximal degree in co-relation 3280. Up to 429 conditions per place. [2022-11-18 19:55:54,274 INFO L137 encePairwiseOnDemand]: 142/153 looper letters, 84 selfloop transitions, 17 changer transitions 0/190 dead transitions. [2022-11-18 19:55:54,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 190 transitions, 676 flow [2022-11-18 19:55:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 19:55:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 19:55:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1261 transitions. [2022-11-18 19:55:54,278 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7492572786690433 [2022-11-18 19:55:54,279 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1261 transitions. [2022-11-18 19:55:54,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1261 transitions. [2022-11-18 19:55:54,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:54,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1261 transitions. [2022-11-18 19:55:54,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.63636363636364) internal successors, (1261), 11 states have internal predecessors, (1261), 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-18 19:55:54,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 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-18 19:55:54,289 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 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-18 19:55:54,289 INFO L175 Difference]: Start difference. First operand has 139 places, 130 transitions, 303 flow. Second operand 11 states and 1261 transitions. [2022-11-18 19:55:54,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 190 transitions, 676 flow [2022-11-18 19:55:54,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 190 transitions, 663 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 19:55:54,294 INFO L231 Difference]: Finished difference. Result has 149 places, 141 transitions, 383 flow [2022-11-18 19:55:54,295 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=383, PETRI_PLACES=149, PETRI_TRANSITIONS=141} [2022-11-18 19:55:54,296 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 12 predicate places. [2022-11-18 19:55:54,296 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 141 transitions, 383 flow [2022-11-18 19:55:54,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 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-18 19:55:54,297 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:54,297 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] [2022-11-18 19:55:54,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:55:54,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:54,503 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-18 19:55:54,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash -264680869, now seen corresponding path program 2 times [2022-11-18 19:55:54,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:54,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302566435] [2022-11-18 19:55:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:54,794 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-18 19:55:54,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:54,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302566435] [2022-11-18 19:55:54,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302566435] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:54,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487510410] [2022-11-18 19:55:54,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:55:54,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:54,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:54,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:54,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:55:54,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 19:55:54,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:55:54,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 19:55:54,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:55,265 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-18 19:55:55,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:55:55,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487510410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:55,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:55:55,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-11-18 19:55:55,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795414776] [2022-11-18 19:55:55,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:55,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:55:55,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:55,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:55:55,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-11-18 19:55:55,269 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 153 [2022-11-18 19:55:55,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 141 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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-18 19:55:55,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:55,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 153 [2022-11-18 19:55:55,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:55,705 INFO L130 PetriNetUnfolder]: 617/1313 cut-off events. [2022-11-18 19:55:55,705 INFO L131 PetriNetUnfolder]: For 865/1079 co-relation queries the response was YES. [2022-11-18 19:55:55,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3058 conditions, 1313 events. 617/1313 cut-off events. For 865/1079 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7315 event pairs, 178 based on Foata normal form. 241/1517 useless extension candidates. Maximal degree in co-relation 3046. Up to 535 conditions per place. [2022-11-18 19:55:55,720 INFO L137 encePairwiseOnDemand]: 144/153 looper letters, 48 selfloop transitions, 13 changer transitions 0/154 dead transitions. [2022-11-18 19:55:55,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 154 transitions, 558 flow [2022-11-18 19:55:55,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:55:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 19:55:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 857 transitions. [2022-11-18 19:55:55,724 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7001633986928104 [2022-11-18 19:55:55,725 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 857 transitions. [2022-11-18 19:55:55,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 857 transitions. [2022-11-18 19:55:55,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:55,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 857 transitions. [2022-11-18 19:55:55,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 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-18 19:55:55,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 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-18 19:55:55,774 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 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-18 19:55:55,774 INFO L175 Difference]: Start difference. First operand has 149 places, 141 transitions, 383 flow. Second operand 8 states and 857 transitions. [2022-11-18 19:55:55,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 154 transitions, 558 flow [2022-11-18 19:55:55,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 154 transitions, 551 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 19:55:55,781 INFO L231 Difference]: Finished difference. Result has 154 places, 144 transitions, 444 flow [2022-11-18 19:55:55,781 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=444, PETRI_PLACES=154, PETRI_TRANSITIONS=144} [2022-11-18 19:55:55,782 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 17 predicate places. [2022-11-18 19:55:55,782 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 144 transitions, 444 flow [2022-11-18 19:55:55,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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-18 19:55:55,782 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:55,783 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] [2022-11-18 19:55:55,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:55:55,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:55,984 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-18 19:55:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:55,984 INFO L85 PathProgramCache]: Analyzing trace with hash -129815812, now seen corresponding path program 1 times [2022-11-18 19:55:55,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:55,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003373944] [2022-11-18 19:55:55,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:57,824 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-18 19:55:57,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:57,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003373944] [2022-11-18 19:55:57,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003373944] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:57,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553874320] [2022-11-18 19:55:57,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:57,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:57,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:57,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:57,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:55:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:57,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-18 19:55:57,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:59,031 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-18 19:55:59,606 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-18 19:55:59,736 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-18 19:55:59,852 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-18 19:56:00,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:00,444 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-18 19:56:01,271 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-18 19:56:01,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:56:10,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:10,192 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-18 19:56:10,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:10,218 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 369 [2022-11-18 19:56:10,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:10,241 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 329 [2022-11-18 19:56:10,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:10,265 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 319 treesize of output 309 [2022-11-18 19:56:10,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:10,294 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 205 [2022-11-18 19:56:12,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:12,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 70 [2022-11-18 19:56:12,379 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:56:12,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 845 treesize of output 809 [2022-11-18 19:56:12,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:56:12,410 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 559 treesize of output 531 [2022-11-18 19:56:12,438 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:56:12,439 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 777 treesize of output 725 [2022-11-18 19:56:12,474 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:56:12,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 721 treesize of output 613 [2022-11-18 19:56:13,485 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 19:56:13,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 1 [2022-11-18 19:56:13,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:13,497 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-18 19:56:13,536 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:56:13,537 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 2187 treesize of output 2095 [2022-11-18 19:56:13,602 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:56:13,602 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 2091 treesize of output 2031 [2022-11-18 19:56:13,664 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:56:13,665 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 2027 treesize of output 1775 [2022-11-18 19:56:13,717 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:56:13,718 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 1771 treesize of output 1647 [2022-11-18 19:56:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:56:30,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553874320] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:56:30,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:56:30,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31, 25] total 71 [2022-11-18 19:56:30,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056759951] [2022-11-18 19:56:30,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:56:30,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-18 19:56:30,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:30,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-18 19:56:30,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=794, Invalid=4075, Unknown=101, NotChecked=0, Total=4970 [2022-11-18 19:56:30,664 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 153 [2022-11-18 19:56:30,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 144 transitions, 444 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-18 19:56:30,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:56:30,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 153 [2022-11-18 19:56:30,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:56:53,525 INFO L130 PetriNetUnfolder]: 12664/20066 cut-off events. [2022-11-18 19:56:53,525 INFO L131 PetriNetUnfolder]: For 20885/20885 co-relation queries the response was YES. [2022-11-18 19:56:53,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53509 conditions, 20066 events. 12664/20066 cut-off events. For 20885/20885 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 147083 event pairs, 794 based on Foata normal form. 2/19918 useless extension candidates. Maximal degree in co-relation 53495. Up to 6912 conditions per place. [2022-11-18 19:56:53,737 INFO L137 encePairwiseOnDemand]: 112/153 looper letters, 927 selfloop transitions, 499 changer transitions 12/1486 dead transitions. [2022-11-18 19:56:53,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 1486 transitions, 8191 flow [2022-11-18 19:56:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-11-18 19:56:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2022-11-18 19:56:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 8705 transitions. [2022-11-18 19:56:53,766 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4245927226612038 [2022-11-18 19:56:53,766 INFO L72 ComplementDD]: Start complementDD. Operand 134 states and 8705 transitions. [2022-11-18 19:56:53,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 8705 transitions. [2022-11-18 19:56:53,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:56:53,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 134 states and 8705 transitions. [2022-11-18 19:56:53,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 135 states, 134 states have (on average 64.96268656716418) internal successors, (8705), 134 states have internal predecessors, (8705), 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-18 19:56:53,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 135 states, 135 states have (on average 153.0) internal successors, (20655), 135 states have internal predecessors, (20655), 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-18 19:56:53,844 INFO L81 ComplementDD]: Finished complementDD. Result has 135 states, 135 states have (on average 153.0) internal successors, (20655), 135 states have internal predecessors, (20655), 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-18 19:56:53,844 INFO L175 Difference]: Start difference. First operand has 154 places, 144 transitions, 444 flow. Second operand 134 states and 8705 transitions. [2022-11-18 19:56:53,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 1486 transitions, 8191 flow [2022-11-18 19:56:54,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1486 transitions, 8067 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-11-18 19:56:54,173 INFO L231 Difference]: Finished difference. Result has 333 places, 663 transitions, 4180 flow [2022-11-18 19:56:54,173 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=134, PETRI_FLOW=4180, PETRI_PLACES=333, PETRI_TRANSITIONS=663} [2022-11-18 19:56:54,174 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 196 predicate places. [2022-11-18 19:56:54,174 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 663 transitions, 4180 flow [2022-11-18 19:56:54,176 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-18 19:56:54,176 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:56:54,177 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] [2022-11-18 19:56:54,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-18 19:56:54,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 19:56:54,382 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-18 19:56:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:56:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1440130774, now seen corresponding path program 2 times [2022-11-18 19:56:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:56:54,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993852732] [2022-11-18 19:56:54,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:56:54,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:56:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:56:56,542 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-18 19:56:56,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:56:56,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993852732] [2022-11-18 19:56:56,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993852732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:56:56,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018820430] [2022-11-18 19:56:56,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:56:56,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:56:56,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:56:56,547 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:56:56,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 19:56:56,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:56:56,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:56:56,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 19:56:56,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:56:57,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:57,616 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-18 19:56:58,115 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-18 19:56:58,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:56:58,496 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:58,497 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 87 treesize of output 51 [2022-11-18 19:56:59,056 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-18 19:56:59,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018820430] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:56:59,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:56:59,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16, 15] total 43 [2022-11-18 19:56:59,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472429887] [2022-11-18 19:56:59,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:56:59,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-18 19:56:59,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:56:59,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-18 19:56:59,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1528, Unknown=0, NotChecked=0, Total=1806 [2022-11-18 19:56:59,063 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2022-11-18 19:56:59,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 663 transitions, 4180 flow. Second operand has 43 states, 43 states have (on average 69.34883720930233) internal successors, (2982), 43 states have internal predecessors, (2982), 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-18 19:56:59,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:56:59,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2022-11-18 19:56:59,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:57:15,259 INFO L130 PetriNetUnfolder]: 18138/29540 cut-off events. [2022-11-18 19:57:15,260 INFO L131 PetriNetUnfolder]: For 187886/188081 co-relation queries the response was YES. [2022-11-18 19:57:15,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116855 conditions, 29540 events. 18138/29540 cut-off events. For 187886/188081 co-relation queries the response was YES. Maximal size of possible extension queue 1550. Compared 239281 event pairs, 1339 based on Foata normal form. 35/29408 useless extension candidates. Maximal degree in co-relation 116791. Up to 13794 conditions per place. [2022-11-18 19:57:15,967 INFO L137 encePairwiseOnDemand]: 116/153 looper letters, 810 selfloop transitions, 804 changer transitions 14/1680 dead transitions. [2022-11-18 19:57:15,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 1680 transitions, 14589 flow [2022-11-18 19:57:15,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-11-18 19:57:15,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2022-11-18 19:57:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 6427 transitions. [2022-11-18 19:57:15,991 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4828337465254301 [2022-11-18 19:57:15,991 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 6427 transitions. [2022-11-18 19:57:15,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 6427 transitions. [2022-11-18 19:57:15,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:57:15,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 6427 transitions. [2022-11-18 19:57:16,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 73.8735632183908) internal successors, (6427), 87 states have internal predecessors, (6427), 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-18 19:57:16,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 153.0) internal successors, (13464), 88 states have internal predecessors, (13464), 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-18 19:57:16,056 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 153.0) internal successors, (13464), 88 states have internal predecessors, (13464), 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-18 19:57:16,056 INFO L175 Difference]: Start difference. First operand has 333 places, 663 transitions, 4180 flow. Second operand 87 states and 6427 transitions. [2022-11-18 19:57:16,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 1680 transitions, 14589 flow [2022-11-18 19:57:19,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 1680 transitions, 14328 flow, removed 70 selfloop flow, removed 18 redundant places. [2022-11-18 19:57:19,135 INFO L231 Difference]: Finished difference. Result has 442 places, 1227 transitions, 11282 flow [2022-11-18 19:57:19,136 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=4027, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=304, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=11282, PETRI_PLACES=442, PETRI_TRANSITIONS=1227} [2022-11-18 19:57:19,137 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 305 predicate places. [2022-11-18 19:57:19,137 INFO L495 AbstractCegarLoop]: Abstraction has has 442 places, 1227 transitions, 11282 flow [2022-11-18 19:57:19,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 69.34883720930233) internal successors, (2982), 43 states have internal predecessors, (2982), 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-18 19:57:19,138 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:57:19,138 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] [2022-11-18 19:57:19,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-18 19:57:19,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:57:19,339 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-18 19:57:19,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:57:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1758676796, now seen corresponding path program 3 times [2022-11-18 19:57:19,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:57:19,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511341598] [2022-11-18 19:57:19,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:57:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:57:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:57:21,386 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-18 19:57:21,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:57:21,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511341598] [2022-11-18 19:57:21,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511341598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:57:21,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171231098] [2022-11-18 19:57:21,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 19:57:21,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:57:21,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:57:21,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:57:21,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 19:57:21,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 19:57:21,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:57:21,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-18 19:57:21,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:57:22,512 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-18 19:57:23,152 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-18 19:57:23,326 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-18 19:57:23,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:23,999 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-18 19:57:24,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:24,544 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-18 19:57:24,997 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-18 19:57:24,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:57:25,399 WARN L837 $PredicateComparison]: unable to prove that (or (<= (+ 2 c_~M~0) c_~N~0) (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) .cse1))) (or (= c_~min1~0 .cse0) (not (< .cse0 c_~min2~0))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_230 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) .cse1) c_~min2~0)))))) is different from false [2022-11-18 19:57:31,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:31,159 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-18 19:57:31,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:31,176 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 663 treesize of output 637 [2022-11-18 19:57:31,200 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:31,200 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 487 treesize of output 445 [2022-11-18 19:57:31,215 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 532 treesize of output 436 [2022-11-18 19:57:31,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:31,236 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 458 treesize of output 442 [2022-11-18 19:57:33,317 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:33,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 46 [2022-11-18 19:57:33,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:57:33,341 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:57:33,341 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 259 treesize of output 239 [2022-11-18 19:57:33,367 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:57:33,367 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 235 treesize of output 207 [2022-11-18 19:57:33,408 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:57:33,409 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 203 treesize of output 191 [2022-11-18 19:57:33,521 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 19:57:33,522 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 84 treesize of output 1 [2022-11-18 19:57:33,531 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 19:57:33,532 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 114 treesize of output 1 [2022-11-18 19:57:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-18 19:57:34,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171231098] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:57:34,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:57:34,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 28] total 73 [2022-11-18 19:57:34,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169195698] [2022-11-18 19:57:34,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:57:34,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-18 19:57:34,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:57:34,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-18 19:57:34,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=4515, Unknown=88, NotChecked=140, Total=5256 [2022-11-18 19:57:34,476 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 153 [2022-11-18 19:57:34,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 1227 transitions, 11282 flow. Second operand has 73 states, 73 states have (on average 54.76712328767123) internal successors, (3998), 73 states have internal predecessors, (3998), 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-18 19:57:34,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:57:34,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 153 [2022-11-18 19:57:34,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:57:45,590 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~min2~0 c_~min1~0))) (and (or (<= (+ 2 c_~M~0) c_~N~0) (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (let ((.cse4 (forall ((v_ArrVal_230 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) .cse2) c_~min2~0))) (.cse0 (< .cse5 c_~min1~0))) (and (or .cse0 (and (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) .cse2))) (or (= c_~min1~0 .cse1) (not (< .cse1 c_~min2~0))))) (or .cse3 .cse4))) (or (and (forall ((v_ArrVal_230 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_230) c_~A~0.base) .cse2))) (or (= .cse5 .cse6) (not (< .cse6 c_~min2~0))))) (or .cse4 (= c_~min2~0 .cse5))) (not .cse0)))))) (or .cse3 (<= (+ c_thread3Thread1of1ForFork1_~i~2 1) c_~N~0)) (= c_~min2~0 0))) is different from false [2022-11-18 19:58:02,915 INFO L130 PetriNetUnfolder]: 24206/40554 cut-off events. [2022-11-18 19:58:02,915 INFO L131 PetriNetUnfolder]: For 539150/539597 co-relation queries the response was YES. [2022-11-18 19:58:03,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203521 conditions, 40554 events. 24206/40554 cut-off events. For 539150/539597 co-relation queries the response was YES. Maximal size of possible extension queue 2232. Compared 356193 event pairs, 2868 based on Foata normal form. 45/40287 useless extension candidates. Maximal degree in co-relation 203417. Up to 17600 conditions per place. [2022-11-18 19:58:04,076 INFO L137 encePairwiseOnDemand]: 107/153 looper letters, 1011 selfloop transitions, 1227 changer transitions 7/2290 dead transitions. [2022-11-18 19:58:04,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 2290 transitions, 26328 flow [2022-11-18 19:58:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-11-18 19:58:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2022-11-18 19:58:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 5047 transitions. [2022-11-18 19:58:04,093 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3927015250544662 [2022-11-18 19:58:04,094 INFO L72 ComplementDD]: Start complementDD. Operand 84 states and 5047 transitions. [2022-11-18 19:58:04,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 5047 transitions. [2022-11-18 19:58:04,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:58:04,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 84 states and 5047 transitions. [2022-11-18 19:58:04,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 85 states, 84 states have (on average 60.083333333333336) internal successors, (5047), 84 states have internal predecessors, (5047), 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-18 19:58:04,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 85 states, 85 states have (on average 153.0) internal successors, (13005), 85 states have internal predecessors, (13005), 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-18 19:58:04,128 INFO L81 ComplementDD]: Finished complementDD. Result has 85 states, 85 states have (on average 153.0) internal successors, (13005), 85 states have internal predecessors, (13005), 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-18 19:58:04,128 INFO L175 Difference]: Start difference. First operand has 442 places, 1227 transitions, 11282 flow. Second operand 84 states and 5047 transitions. [2022-11-18 19:58:04,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 2290 transitions, 26328 flow [2022-11-18 19:58:19,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 2290 transitions, 25509 flow, removed 380 selfloop flow, removed 21 redundant places. [2022-11-18 19:58:19,895 INFO L231 Difference]: Finished difference. Result has 547 places, 1904 transitions, 22254 flow [2022-11-18 19:58:19,897 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=10803, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=632, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=22254, PETRI_PLACES=547, PETRI_TRANSITIONS=1904} [2022-11-18 19:58:19,897 INFO L288 CegarLoopForPetriNet]: 137 programPoint places, 410 predicate places. [2022-11-18 19:58:19,897 INFO L495 AbstractCegarLoop]: Abstraction has has 547 places, 1904 transitions, 22254 flow [2022-11-18 19:58:19,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 54.76712328767123) internal successors, (3998), 73 states have internal predecessors, (3998), 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-18 19:58:19,899 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:58:19,899 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] [2022-11-18 19:58:19,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 19:58:20,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:58:20,104 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-18 19:58:20,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:58:20,105 INFO L85 PathProgramCache]: Analyzing trace with hash -976196704, now seen corresponding path program 4 times [2022-11-18 19:58:20,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:58:20,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151560071] [2022-11-18 19:58:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:58:20,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:58:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:58:22,139 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-18 19:58:22,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:58:22,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151560071] [2022-11-18 19:58:22,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151560071] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:58:22,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286774483] [2022-11-18 19:58:22,141 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 19:58:22,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:58:22,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:58:22,142 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:58:22,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d05155a6-50c5-42d5-9f25-210cba62f9c7/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 19:58:22,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 19:58:22,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:58:22,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-18 19:58:22,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:58:23,114 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 15 treesize of output 11 [2022-11-18 19:58:23,892 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-18 19:58:24,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:58:24,301 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-18 19:58:24,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:58:24,524 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-18 19:58:25,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:58:25,159 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-18 19:58:25,725 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-18 19:58:25,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:58:31,101 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (not (< .cse0 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< .cse1 c_~min2~0)) (not (< ~M~0 c_~N~0)) (= .cse1 .cse0)))))))) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (let ((.cse3 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (not (< .cse3 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0))) (= c_~min2~0 .cse3))))) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (or (forall ((~M~0 Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse5 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< .cse5 c_~min2~0)) (not (< ~M~0 c_~N~0)) (= c_~min1~0 .cse5)))) (< (select (select .cse6 c_~A~0.base) c_~A~0.offset) c_~min1~0)))) (or (forall ((~M~0 Int) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (or (<= (+ 2 ~M~0) c_~N~0) (< (select (select .cse7 c_~A~0.base) c_~A~0.offset) c_~min1~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0)))) (= c_~min2~0 c_~min1~0))) is different from false [2022-11-18 19:58:31,991 WARN L837 $PredicateComparison]: unable to prove that (and (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (or (<= (+ 2 ~M~0) c_~N~0) (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min2~0) (not (< ~M~0 c_~N~0)) (< (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse1 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse2 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< .cse2 c_~min2~0)) (not (< ~M~0 c_~N~0)) (= .cse2 .cse1)))))))) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse4 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min2~0) (not (< ~M~0 c_~N~0)))) (= c_~min2~0 .cse4))))) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (or (forall ((~M~0 Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< .cse6 c_~min2~0)) (not (< ~M~0 c_~N~0)) (= .cse6 c_~min1~0)))) (< (select (select .cse7 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0))))) is different from false [2022-11-18 19:58:32,176 WARN L837 $PredicateComparison]: unable to prove that (and (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0) (< (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0))) (= c_~min2~0 .cse2) (not (< .cse2 c_~min1~0)))))) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (or (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< .cse4 c_~min2~0)) (= c_~min1~0 .cse4))))))) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse5 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= .cse5 .cse6) (not (< .cse5 c_~min2~0))))) (not (< .cse6 c_~min1~0))))))) is different from false [2022-11-18 19:58:32,269 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse0 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) |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 (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< .cse1 c_~min2~0)) (= .cse1 .cse0)))))))) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) |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_~min2~0))) (not (< .cse4 c_~min1~0)) (= c_~min2~0 .cse4))))) (forall ((v_ArrVal_265 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (or (< (select (select .cse5 |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) (forall ((~M~0 Int) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) |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 (<= (+ 2 ~M~0) c_~N~0) (= c_~min1~0 .cse6) (not (< ~M~0 c_~N~0)) (not (< .cse6 c_~min2~0)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_265))) (or (<= (+ 2 ~M~0) c_~N~0) (< (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_267) |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_~min2~0)))))) is different from false [2022-11-18 19:58:33,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:58:33,683 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 78 treesize of output 54 [2022-11-18 19:58:33,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:58:33,716 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 189 treesize of output 183 [2022-11-18 19:58:33,724 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 136 treesize of output 112 [2022-11-18 19:58:33,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:58:33,740 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 88 treesize of output 88 [2022-11-18 19:58:33,749 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 106 treesize of output 94 [2022-11-18 19:58:34,190 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 19:58:34,190 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 1 [2022-11-18 19:58:34,200 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:58:34,200 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 64 [2022-11-18 19:58:34,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:58:34,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:58:34,215 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:58:34,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 67 [2022-11-18 19:58:34,235 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:58:34,236 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 47 treesize of output 37 [2022-11-18 19:58:34,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:58:34,288 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2022-11-18 19:58:34,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:58:34,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:58:34,307 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:58:34,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2022-11-18 19:58:34,325 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 19:58:34,325 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 23 treesize of output 19 [2022-11-18 19:58:35,448 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-18 19:58:35,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286774483] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:58:35,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:58:35,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 31] total 76 [2022-11-18 19:58:35,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855716597] [2022-11-18 19:58:35,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:58:35,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-18 19:58:35,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:58:35,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-18 19:58:35,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=4577, Unknown=28, NotChecked=572, Total=5700 [2022-11-18 19:58:35,455 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 153 [2022-11-18 19:58:35,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 1904 transitions, 22254 flow. Second operand has 76 states, 76 states have (on average 57.61842105263158) internal successors, (4379), 76 states have internal predecessors, (4379), 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-18 19:58:35,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:58:35,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 153 [2022-11-18 19:58:35,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand