./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_86-lists_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_86-lists_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db5eab03de8fef3e653289c5dcf0b220be6d8b09a4df3c07d6d5a066426e755a --- 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-2329fc7 [2022-12-13 19:59:21,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:59:21,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:59:22,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:59:22,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:59:22,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:59:22,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:59:22,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:59:22,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:59:22,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:59:22,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:59:22,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:59:22,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:59:22,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:59:22,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:59:22,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:59:22,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:59:22,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:59:22,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:59:22,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:59:22,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:59:22,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:59:22,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:59:22,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:59:22,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:59:22,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:59:22,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:59:22,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:59:22,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:59:22,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:59:22,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:59:22,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:59:22,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:59:22,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:59:22,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:59:22,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:59:22,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:59:22,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:59:22,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:59:22,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:59:22,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:59:22,042 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 19:59:22,066 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:59:22,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:59:22,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:59:22,067 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:59:22,067 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:59:22,067 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:59:22,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:59:22,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:59:22,069 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:59:22,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:59:22,073 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:59:22,074 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:59:22,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:59:22,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:59:22,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:59:22,074 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 19:59:22,074 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 19:59:22,075 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 19:59:22,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:59:22,075 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 19:59:22,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:59:22,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:59:22,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:59:22,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:59:22,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:59:22,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:59:22,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:59:22,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:59:22,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:59:22,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:59:22,077 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:59:22,077 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:59:22,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:59:22,077 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:59:22,077 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/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_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> db5eab03de8fef3e653289c5dcf0b220be6d8b09a4df3c07d6d5a066426e755a [2022-12-13 19:59:22,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:59:22,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:59:22,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:59:22,290 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:59:22,290 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:59:22,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/goblint-regression/28-race_reach_86-lists_racing.i [2022-12-13 19:59:24,961 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:59:25,166 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:59:25,166 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/sv-benchmarks/c/goblint-regression/28-race_reach_86-lists_racing.i [2022-12-13 19:59:25,176 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/data/0939257ce/21e63a4e364c4a51baa4e3ced5985740/FLAG7d6aa3cf4 [2022-12-13 19:59:25,186 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/data/0939257ce/21e63a4e364c4a51baa4e3ced5985740 [2022-12-13 19:59:25,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:59:25,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:59:25,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:59:25,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:59:25,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:59:25,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:59:25" (1/1) ... [2022-12-13 19:59:25,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dab0b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25, skipping insertion in model container [2022-12-13 19:59:25,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:59:25" (1/1) ... [2022-12-13 19:59:25,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:59:25,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:59:25,529 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/sv-benchmarks/c/goblint-regression/28-race_reach_86-lists_racing.i[47038,47051] [2022-12-13 19:59:25,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:59:25,605 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:59:25,631 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/sv-benchmarks/c/goblint-regression/28-race_reach_86-lists_racing.i[47038,47051] [2022-12-13 19:59:25,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:59:25,679 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:59:25,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25 WrapperNode [2022-12-13 19:59:25,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:59:25,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:59:25,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:59:25,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:59:25,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25" (1/1) ... [2022-12-13 19:59:25,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25" (1/1) ... [2022-12-13 19:59:25,719 INFO L138 Inliner]: procedures = 278, calls = 60, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 227 [2022-12-13 19:59:25,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:59:25,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:59:25,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:59:25,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:59:25,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25" (1/1) ... [2022-12-13 19:59:25,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25" (1/1) ... [2022-12-13 19:59:25,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25" (1/1) ... [2022-12-13 19:59:25,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25" (1/1) ... [2022-12-13 19:59:25,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25" (1/1) ... [2022-12-13 19:59:25,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25" (1/1) ... [2022-12-13 19:59:25,743 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25" (1/1) ... [2022-12-13 19:59:25,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25" (1/1) ... [2022-12-13 19:59:25,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:59:25,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:59:25,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:59:25,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:59:25,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25" (1/1) ... [2022-12-13 19:59:25,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:59:25,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:59:25,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:59:25,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:59:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:59:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 19:59:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2022-12-13 19:59:25,809 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2022-12-13 19:59:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:59:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 19:59:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2022-12-13 19:59:25,809 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2022-12-13 19:59:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 19:59:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 19:59:25,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 19:59:25,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:59:25,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 19:59:25,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:59:25,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:59:25,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:59:25,812 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 19:59:25,933 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:59:25,935 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:59:26,306 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:59:26,314 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:59:26,314 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-12-13 19:59:26,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:59:26 BoogieIcfgContainer [2022-12-13 19:59:26,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:59:26,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:59:26,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:59:26,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:59:26,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:59:25" (1/3) ... [2022-12-13 19:59:26,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5421a914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:59:26, skipping insertion in model container [2022-12-13 19:59:26,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:59:25" (2/3) ... [2022-12-13 19:59:26,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5421a914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:59:26, skipping insertion in model container [2022-12-13 19:59:26,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:59:26" (3/3) ... [2022-12-13 19:59:26,332 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_86-lists_racing.i [2022-12-13 19:59:26,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:59:26,345 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-12-13 19:59:26,345 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 19:59:26,429 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 19:59:26,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 287 transitions, 596 flow [2022-12-13 19:59:26,559 INFO L130 PetriNetUnfolder]: 54/537 cut-off events. [2022-12-13 19:59:26,559 INFO L131 PetriNetUnfolder]: For 8/16 co-relation queries the response was YES. [2022-12-13 19:59:26,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 537 events. 54/537 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2459 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 272. Up to 8 conditions per place. [2022-12-13 19:59:26,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 287 transitions, 596 flow [2022-12-13 19:59:26,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 287 transitions, 596 flow [2022-12-13 19:59:26,576 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:59:26,584 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 267 places, 287 transitions, 596 flow [2022-12-13 19:59:26,586 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 267 places, 287 transitions, 596 flow [2022-12-13 19:59:26,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 287 transitions, 596 flow [2022-12-13 19:59:26,653 INFO L130 PetriNetUnfolder]: 54/537 cut-off events. [2022-12-13 19:59:26,654 INFO L131 PetriNetUnfolder]: For 8/16 co-relation queries the response was YES. [2022-12-13 19:59:26,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 537 events. 54/537 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2459 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 272. Up to 8 conditions per place. [2022-12-13 19:59:26,667 INFO L119 LiptonReduction]: Number of co-enabled transitions 27012 [2022-12-13 19:59:34,946 INFO L134 LiptonReduction]: Checked pairs total: 71720 [2022-12-13 19:59:34,947 INFO L136 LiptonReduction]: Total number of compositions: 246 [2022-12-13 19:59:34,957 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:59:34,961 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@638fdeba, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:59:34,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2022-12-13 19:59:34,963 INFO L130 PetriNetUnfolder]: 1/3 cut-off events. [2022-12-13 19:59:34,963 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:59:34,963 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:59:34,964 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:59:34,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-12-13 19:59:34,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:59:34,968 INFO L85 PathProgramCache]: Analyzing trace with hash 35666, now seen corresponding path program 1 times [2022-12-13 19:59:34,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:59:34,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966035763] [2022-12-13 19:59:34,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:34,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:59:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:59:35,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:59:35,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966035763] [2022-12-13 19:59:35,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966035763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:59:35,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:59:35,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:59:35,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169537039] [2022-12-13 19:59:35,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:59:35,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 19:59:35,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:59:35,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 19:59:35,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 19:59:35,110 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 533 [2022-12-13 19:59:35,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 115 transitions, 252 flow. Second operand has 2 states, 2 states have (on average 264.0) internal successors, (528), 2 states have internal predecessors, (528), 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-12-13 19:59:35,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:59:35,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 533 [2022-12-13 19:59:35,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:59:37,540 INFO L130 PetriNetUnfolder]: 18093/31351 cut-off events. [2022-12-13 19:59:37,540 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2022-12-13 19:59:37,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59148 conditions, 31351 events. 18093/31351 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 251298 event pairs, 17344 based on Foata normal form. 1304/17091 useless extension candidates. Maximal degree in co-relation 56404. Up to 27656 conditions per place. [2022-12-13 19:59:37,675 INFO L137 encePairwiseOnDemand]: 518/533 looper letters, 80 selfloop transitions, 0 changer transitions 0/99 dead transitions. [2022-12-13 19:59:37,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 99 transitions, 380 flow [2022-12-13 19:59:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 19:59:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 19:59:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 621 transitions. [2022-12-13 19:59:37,687 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5825515947467167 [2022-12-13 19:59:37,688 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 621 transitions. [2022-12-13 19:59:37,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 621 transitions. [2022-12-13 19:59:37,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:59:37,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 621 transitions. [2022-12-13 19:59:37,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 310.5) internal successors, (621), 2 states have internal predecessors, (621), 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-12-13 19:59:37,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 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-12-13 19:59:37,704 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 533.0) internal successors, (1599), 3 states have internal predecessors, (1599), 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-12-13 19:59:37,706 INFO L175 Difference]: Start difference. First operand has 102 places, 115 transitions, 252 flow. Second operand 2 states and 621 transitions. [2022-12-13 19:59:37,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 99 transitions, 380 flow [2022-12-13 19:59:37,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 99 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 19:59:37,719 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 220 flow [2022-12-13 19:59:37,721 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=220, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2022-12-13 19:59:37,747 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -4 predicate places. [2022-12-13 19:59:37,747 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 220 flow [2022-12-13 19:59:37,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 264.0) internal successors, (528), 2 states have internal predecessors, (528), 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-12-13 19:59:37,748 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:59:37,748 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:59:37,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:59:37,748 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-12-13 19:59:37,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:59:37,749 INFO L85 PathProgramCache]: Analyzing trace with hash 35669, now seen corresponding path program 1 times [2022-12-13 19:59:37,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:59:37,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841611410] [2022-12-13 19:59:37,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:37,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:59:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:59:37,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:59:37,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841611410] [2022-12-13 19:59:37,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841611410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:59:37,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:59:37,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:59:37,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559987827] [2022-12-13 19:59:37,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:59:37,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:59:37,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:59:37,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:59:37,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:59:38,098 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 533 [2022-12-13 19:59:38,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 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-12-13 19:59:38,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:59:38,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 533 [2022-12-13 19:59:38,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:59:40,193 INFO L130 PetriNetUnfolder]: 18093/31352 cut-off events. [2022-12-13 19:59:40,193 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2022-12-13 19:59:40,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59151 conditions, 31352 events. 18093/31352 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 1037. Compared 251315 event pairs, 17344 based on Foata normal form. 0/15788 useless extension candidates. Maximal degree in co-relation 59146. Up to 27656 conditions per place. [2022-12-13 19:59:40,292 INFO L137 encePairwiseOnDemand]: 528/533 looper letters, 79 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2022-12-13 19:59:40,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 100 transitions, 384 flow [2022-12-13 19:59:40,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:59:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:59:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2022-12-13 19:59:40,294 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5290806754221389 [2022-12-13 19:59:40,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 846 transitions. [2022-12-13 19:59:40,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 846 transitions. [2022-12-13 19:59:40,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:59:40,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 846 transitions. [2022-12-13 19:59:40,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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-12-13 19:59:40,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 533.0) internal successors, (2132), 4 states have internal predecessors, (2132), 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-12-13 19:59:40,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 533.0) internal successors, (2132), 4 states have internal predecessors, (2132), 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-12-13 19:59:40,300 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 220 flow. Second operand 3 states and 846 transitions. [2022-12-13 19:59:40,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 100 transitions, 384 flow [2022-12-13 19:59:40,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 100 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 19:59:40,304 INFO L231 Difference]: Finished difference. Result has 101 places, 100 transitions, 236 flow [2022-12-13 19:59:40,305 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=101, PETRI_TRANSITIONS=100} [2022-12-13 19:59:40,305 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -1 predicate places. [2022-12-13 19:59:40,305 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 100 transitions, 236 flow [2022-12-13 19:59:40,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 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-12-13 19:59:40,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:59:40,306 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 19:59:40,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:59:40,306 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-12-13 19:59:40,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:59:40,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1107091, now seen corresponding path program 1 times [2022-12-13 19:59:40,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:59:40,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566192324] [2022-12-13 19:59:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:40,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:59:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:59:40,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:59:40,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566192324] [2022-12-13 19:59:40,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566192324] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:59:40,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714530169] [2022-12-13 19:59:40,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:40,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:59:40,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:59:40,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:59:40,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 19:59:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:40,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 19:59:40,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:59:40,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:59:40,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 19:59:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:59:40,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:59:40,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:59:40,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2022-12-13 19:59:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:59:44,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714530169] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:59:44,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:59:44,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2022-12-13 19:59:44,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587295428] [2022-12-13 19:59:44,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:59:44,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 19:59:44,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:59:44,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 19:59:44,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:59:46,507 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 533 [2022-12-13 19:59:46,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 100 transitions, 236 flow. Second operand has 8 states, 8 states have (on average 245.125) internal successors, (1961), 8 states have internal predecessors, (1961), 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-12-13 19:59:46,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:59:46,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 533 [2022-12-13 19:59:46,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:59:52,446 INFO L130 PetriNetUnfolder]: 45067/76915 cut-off events. [2022-12-13 19:59:52,446 INFO L131 PetriNetUnfolder]: For 480/480 co-relation queries the response was YES. [2022-12-13 19:59:52,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145973 conditions, 76915 events. 45067/76915 cut-off events. For 480/480 co-relation queries the response was YES. Maximal size of possible extension queue 2429. Compared 692335 event pairs, 37272 based on Foata normal form. 0/37269 useless extension candidates. Maximal degree in co-relation 145966. Up to 28736 conditions per place. [2022-12-13 19:59:52,731 INFO L137 encePairwiseOnDemand]: 527/533 looper letters, 223 selfloop transitions, 7 changer transitions 0/249 dead transitions. [2022-12-13 19:59:52,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 249 transitions, 1044 flow [2022-12-13 19:59:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:59:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 19:59:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1699 transitions. [2022-12-13 19:59:52,740 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5312695434646654 [2022-12-13 19:59:52,740 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1699 transitions. [2022-12-13 19:59:52,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1699 transitions. [2022-12-13 19:59:52,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:59:52,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1699 transitions. [2022-12-13 19:59:52,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 283.1666666666667) internal successors, (1699), 6 states have internal predecessors, (1699), 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-12-13 19:59:52,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 533.0) internal successors, (3731), 7 states have internal predecessors, (3731), 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-12-13 19:59:52,763 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 533.0) internal successors, (3731), 7 states have internal predecessors, (3731), 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-12-13 19:59:52,763 INFO L175 Difference]: Start difference. First operand has 101 places, 100 transitions, 236 flow. Second operand 6 states and 1699 transitions. [2022-12-13 19:59:52,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 249 transitions, 1044 flow [2022-12-13 19:59:52,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 249 transitions, 1040 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 19:59:52,772 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 284 flow [2022-12-13 19:59:52,772 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=108, PETRI_TRANSITIONS=105} [2022-12-13 19:59:52,773 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, 6 predicate places. [2022-12-13 19:59:52,773 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 284 flow [2022-12-13 19:59:52,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 245.125) internal successors, (1961), 8 states have internal predecessors, (1961), 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-12-13 19:59:52,775 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:59:52,775 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1] [2022-12-13 19:59:52,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:59:52,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:59:52,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-12-13 19:59:52,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:59:52,978 INFO L85 PathProgramCache]: Analyzing trace with hash 34321172, now seen corresponding path program 1 times [2022-12-13 19:59:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:59:52,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424027309] [2022-12-13 19:59:52,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:52,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:59:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:59:53,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:59:53,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424027309] [2022-12-13 19:59:53,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424027309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:59:53,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:59:53,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:59:53,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142884840] [2022-12-13 19:59:53,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:59:53,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:59:53,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:59:53,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:59:53,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:59:53,167 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 533 [2022-12-13 19:59:53,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-12-13 19:59:53,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:59:53,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 533 [2022-12-13 19:59:53,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:59:58,493 INFO L130 PetriNetUnfolder]: 45566/78494 cut-off events. [2022-12-13 19:59:58,493 INFO L131 PetriNetUnfolder]: For 1931/1931 co-relation queries the response was YES. [2022-12-13 19:59:58,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151120 conditions, 78494 events. 45566/78494 cut-off events. For 1931/1931 co-relation queries the response was YES. Maximal size of possible extension queue 2555. Compared 719825 event pairs, 36064 based on Foata normal form. 0/41424 useless extension candidates. Maximal degree in co-relation 151110. Up to 60818 conditions per place. [2022-12-13 19:59:58,829 INFO L137 encePairwiseOnDemand]: 525/533 looper letters, 125 selfloop transitions, 7 changer transitions 0/151 dead transitions. [2022-12-13 19:59:58,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 151 transitions, 636 flow [2022-12-13 19:59:58,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:59:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:59:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2022-12-13 19:59:58,831 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5572232645403377 [2022-12-13 19:59:58,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 891 transitions. [2022-12-13 19:59:58,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 891 transitions. [2022-12-13 19:59:58,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:59:58,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 891 transitions. [2022-12-13 19:59:58,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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-12-13 19:59:58,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 533.0) internal successors, (2132), 4 states have internal predecessors, (2132), 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-12-13 19:59:58,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 533.0) internal successors, (2132), 4 states have internal predecessors, (2132), 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-12-13 19:59:58,836 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 284 flow. Second operand 3 states and 891 transitions. [2022-12-13 19:59:58,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 151 transitions, 636 flow [2022-12-13 19:59:58,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 151 transitions, 630 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 19:59:58,844 INFO L231 Difference]: Finished difference. Result has 110 places, 107 transitions, 316 flow [2022-12-13 19:59:58,845 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=110, PETRI_TRANSITIONS=107} [2022-12-13 19:59:58,845 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, 8 predicate places. [2022-12-13 19:59:58,845 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 316 flow [2022-12-13 19:59:58,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-12-13 19:59:58,846 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:59:58,846 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2022-12-13 19:59:58,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:59:58,846 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-12-13 19:59:58,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:59:58,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1063956153, now seen corresponding path program 1 times [2022-12-13 19:59:58,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:59:58,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725669059] [2022-12-13 19:59:58,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:59:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:59:58,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:59:58,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725669059] [2022-12-13 19:59:58,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725669059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:59:58,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250612326] [2022-12-13 19:59:58,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:59:58,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:59:58,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:59:58,902 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:59:58,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 19:59:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:59:59,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 19:59:59,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:59:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:59:59,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:59:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:59:59,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250612326] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:59:59,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:59:59,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 19:59:59,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127666411] [2022-12-13 19:59:59,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:59:59,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 19:59:59,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:59:59,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 19:59:59,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-12-13 19:59:59,071 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 533 [2022-12-13 19:59:59,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 107 transitions, 316 flow. Second operand has 9 states, 9 states have (on average 259.22222222222223) internal successors, (2333), 9 states have internal predecessors, (2333), 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-12-13 19:59:59,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:59:59,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 533 [2022-12-13 19:59:59,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:00:02,391 INFO L130 PetriNetUnfolder]: 21011/36926 cut-off events. [2022-12-13 20:00:02,392 INFO L131 PetriNetUnfolder]: For 6600/6600 co-relation queries the response was YES. [2022-12-13 20:00:02,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74032 conditions, 36926 events. 21011/36926 cut-off events. For 6600/6600 co-relation queries the response was YES. Maximal size of possible extension queue 1257. Compared 310803 event pairs, 19432 based on Foata normal form. 4/21544 useless extension candidates. Maximal degree in co-relation 74020. Up to 32395 conditions per place. [2022-12-13 20:00:02,538 INFO L137 encePairwiseOnDemand]: 529/533 looper letters, 82 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2022-12-13 20:00:02,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 109 transitions, 510 flow [2022-12-13 20:00:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 20:00:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 20:00:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2155 transitions. [2022-12-13 20:00:02,542 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5053939962476548 [2022-12-13 20:00:02,543 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2155 transitions. [2022-12-13 20:00:02,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2155 transitions. [2022-12-13 20:00:02,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:00:02,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2155 transitions. [2022-12-13 20:00:02,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 269.375) internal successors, (2155), 8 states have internal predecessors, (2155), 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-12-13 20:00:02,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 533.0) internal successors, (4797), 9 states have internal predecessors, (4797), 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-12-13 20:00:02,552 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 533.0) internal successors, (4797), 9 states have internal predecessors, (4797), 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-12-13 20:00:02,552 INFO L175 Difference]: Start difference. First operand has 110 places, 107 transitions, 316 flow. Second operand 8 states and 2155 transitions. [2022-12-13 20:00:02,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 109 transitions, 510 flow [2022-12-13 20:00:02,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 109 transitions, 490 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 20:00:02,571 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 340 flow [2022-12-13 20:00:02,571 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=340, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2022-12-13 20:00:02,571 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places. [2022-12-13 20:00:02,572 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 340 flow [2022-12-13 20:00:02,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 259.22222222222223) internal successors, (2333), 9 states have internal predecessors, (2333), 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-12-13 20:00:02,572 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:00:02,572 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2022-12-13 20:00:02,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 20:00:02,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:00:02,774 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-12-13 20:00:02,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:00:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1377047851, now seen corresponding path program 2 times [2022-12-13 20:00:02,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:00:02,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637221177] [2022-12-13 20:00:02,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:00:02,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:00:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:00:03,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:00:03,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637221177] [2022-12-13 20:00:03,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637221177] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:00:03,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762159338] [2022-12-13 20:00:03,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:00:03,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:00:03,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:00:03,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:00:03,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 20:00:03,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:00:03,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:00:03,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-13 20:00:03,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:00:03,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:03,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:00:03,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:03,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:00:03,620 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:00:03,621 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 11 treesize of output 11 [2022-12-13 20:00:03,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:03,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:00:03,659 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:00:03,660 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 11 treesize of output 11 [2022-12-13 20:00:03,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:00:03,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:00:03,703 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:00:03,703 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 11 treesize of output 11 [2022-12-13 20:00:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:00:03,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:00:05,778 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:00:05,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2022-12-13 20:00:11,867 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:00:11,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:00:11,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 70 [2022-12-13 20:00:14,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:00:14,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 76 [2022-12-13 20:00:18,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:00:18,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 82 [2022-12-13 20:00:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:00:20,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762159338] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:00:20,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:00:20,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 20:00:20,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642804553] [2022-12-13 20:00:20,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:00:20,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 20:00:20,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:00:20,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 20:00:20,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-13 20:00:30,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:00:33,004 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 533 [2022-12-13 20:00:33,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 340 flow. Second operand has 17 states, 17 states have (on average 245.05882352941177) internal successors, (4166), 17 states have internal predecessors, (4166), 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-12-13 20:00:33,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:00:33,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 533 [2022-12-13 20:00:33,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:00:35,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:00:36,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:00:37,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:00:39,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:00:41,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:00:45,264 INFO L130 PetriNetUnfolder]: 21318/37138 cut-off events. [2022-12-13 20:00:45,265 INFO L131 PetriNetUnfolder]: For 2583/2583 co-relation queries the response was YES. [2022-12-13 20:00:45,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73274 conditions, 37138 events. 21318/37138 cut-off events. For 2583/2583 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 311490 event pairs, 11122 based on Foata normal form. 6/21761 useless extension candidates. Maximal degree in co-relation 73258. Up to 32464 conditions per place. [2022-12-13 20:00:45,415 INFO L137 encePairwiseOnDemand]: 529/533 looper letters, 165 selfloop transitions, 15 changer transitions 0/199 dead transitions. [2022-12-13 20:00:45,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 199 transitions, 964 flow [2022-12-13 20:00:45,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 20:00:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 20:00:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3111 transitions. [2022-12-13 20:00:45,420 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48639774859287055 [2022-12-13 20:00:45,420 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3111 transitions. [2022-12-13 20:00:45,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3111 transitions. [2022-12-13 20:00:45,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:00:45,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3111 transitions. [2022-12-13 20:00:45,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 259.25) internal successors, (3111), 12 states have internal predecessors, (3111), 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-12-13 20:00:45,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 533.0) internal successors, (6929), 13 states have internal predecessors, (6929), 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-12-13 20:00:45,432 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 533.0) internal successors, (6929), 13 states have internal predecessors, (6929), 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-12-13 20:00:45,432 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 340 flow. Second operand 12 states and 3111 transitions. [2022-12-13 20:00:45,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 199 transitions, 964 flow [2022-12-13 20:00:45,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 199 transitions, 923 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-12-13 20:00:45,438 INFO L231 Difference]: Finished difference. Result has 127 places, 115 transitions, 381 flow [2022-12-13 20:00:45,439 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=381, PETRI_PLACES=127, PETRI_TRANSITIONS=115} [2022-12-13 20:00:45,439 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, 25 predicate places. [2022-12-13 20:00:45,439 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 115 transitions, 381 flow [2022-12-13 20:00:45,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 245.05882352941177) internal successors, (4166), 17 states have internal predecessors, (4166), 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-12-13 20:00:45,440 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:00:45,440 INFO L209 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1] [2022-12-13 20:00:45,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 20:00:45,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:00:45,642 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-12-13 20:00:45,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:00:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1896423225, now seen corresponding path program 2 times [2022-12-13 20:00:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:00:45,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244813451] [2022-12-13 20:00:45,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:00:45,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:00:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:00:45,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:00:45,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244813451] [2022-12-13 20:00:45,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244813451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:00:45,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781452562] [2022-12-13 20:00:45,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:00:45,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:00:45,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:00:45,823 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:00:45,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 20:00:45,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 20:00:45,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:00:45,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 20:00:45,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:00:45,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 20:00:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 20:00:45,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:00:45,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781452562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:00:45,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:00:45,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 10 [2022-12-13 20:00:45,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056031309] [2022-12-13 20:00:45,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:00:45,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:00:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:00:45,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:00:45,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:00:46,031 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 533 [2022-12-13 20:00:46,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 115 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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-12-13 20:00:46,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:00:46,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 533 [2022-12-13 20:00:46,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:00:48,632 INFO L130 PetriNetUnfolder]: 21167/36868 cut-off events. [2022-12-13 20:00:48,633 INFO L131 PetriNetUnfolder]: For 2677/2677 co-relation queries the response was YES. [2022-12-13 20:00:48,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72829 conditions, 36868 events. 21167/36868 cut-off events. For 2677/2677 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 303190 event pairs, 19489 based on Foata normal form. 5/21651 useless extension candidates. Maximal degree in co-relation 72811. Up to 32735 conditions per place. [2022-12-13 20:00:48,786 INFO L137 encePairwiseOnDemand]: 528/533 looper letters, 97 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2022-12-13 20:00:48,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 119 transitions, 589 flow [2022-12-13 20:00:48,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:00:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:00:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2022-12-13 20:00:48,791 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.533458411507192 [2022-12-13 20:00:48,791 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 853 transitions. [2022-12-13 20:00:48,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 853 transitions. [2022-12-13 20:00:48,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:00:48,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 853 transitions. [2022-12-13 20:00:48,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-12-13 20:00:48,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 533.0) internal successors, (2132), 4 states have internal predecessors, (2132), 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-12-13 20:00:48,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 533.0) internal successors, (2132), 4 states have internal predecessors, (2132), 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-12-13 20:00:48,795 INFO L175 Difference]: Start difference. First operand has 127 places, 115 transitions, 381 flow. Second operand 3 states and 853 transitions. [2022-12-13 20:00:48,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 119 transitions, 589 flow [2022-12-13 20:00:48,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 119 transitions, 566 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-13 20:00:48,801 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 387 flow [2022-12-13 20:00:48,801 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=124, PETRI_TRANSITIONS=117} [2022-12-13 20:00:48,802 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, 22 predicate places. [2022-12-13 20:00:48,802 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 387 flow [2022-12-13 20:00:48,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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-12-13 20:00:48,802 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:00:48,802 INFO L209 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1] [2022-12-13 20:00:48,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 20:00:49,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:00:49,004 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-12-13 20:00:49,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:00:49,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1896423224, now seen corresponding path program 1 times [2022-12-13 20:00:49,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:00:49,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952030899] [2022-12-13 20:00:49,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:00:49,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:00:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 20:00:49,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:00:49,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952030899] [2022-12-13 20:00:49,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952030899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:00:49,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:00:49,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:00:49,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079019903] [2022-12-13 20:00:49,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:00:49,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:00:49,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:00:49,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:00:49,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:00:49,172 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 533 [2022-12-13 20:00:49,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 117 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-12-13 20:00:49,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:00:49,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 533 [2022-12-13 20:00:49,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:00:51,931 INFO L130 PetriNetUnfolder]: 20074/34328 cut-off events. [2022-12-13 20:00:51,931 INFO L131 PetriNetUnfolder]: For 3086/3086 co-relation queries the response was YES. [2022-12-13 20:00:52,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69563 conditions, 34328 events. 20074/34328 cut-off events. For 3086/3086 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 277881 event pairs, 12085 based on Foata normal form. 0/20471 useless extension candidates. Maximal degree in co-relation 69543. Up to 16958 conditions per place. [2022-12-13 20:00:52,117 INFO L137 encePairwiseOnDemand]: 529/533 looper letters, 137 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2022-12-13 20:00:52,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 158 transitions, 753 flow [2022-12-13 20:00:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:00:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:00:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2022-12-13 20:00:52,121 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2022-12-13 20:00:52,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 884 transitions. [2022-12-13 20:00:52,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 884 transitions. [2022-12-13 20:00:52,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:00:52,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 884 transitions. [2022-12-13 20:00:52,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 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-12-13 20:00:52,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 533.0) internal successors, (2132), 4 states have internal predecessors, (2132), 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-12-13 20:00:52,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 533.0) internal successors, (2132), 4 states have internal predecessors, (2132), 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-12-13 20:00:52,129 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 387 flow. Second operand 3 states and 884 transitions. [2022-12-13 20:00:52,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 158 transitions, 753 flow [2022-12-13 20:00:52,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 158 transitions, 750 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:00:52,139 INFO L231 Difference]: Finished difference. Result has 123 places, 115 transitions, 384 flow [2022-12-13 20:00:52,140 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=123, PETRI_TRANSITIONS=115} [2022-12-13 20:00:52,140 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2022-12-13 20:00:52,140 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 115 transitions, 384 flow [2022-12-13 20:00:52,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-12-13 20:00:52,141 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:00:52,141 INFO L209 CegarLoopForPetriNet]: trace histogram [10, 1, 1] [2022-12-13 20:00:52,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:00:52,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-12-13 20:00:52,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:00:52,142 INFO L85 PathProgramCache]: Analyzing trace with hash 392360469, now seen corresponding path program 3 times [2022-12-13 20:00:52,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:00:52,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611865378] [2022-12-13 20:00:52,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:00:52,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:00:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:00:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:00:53,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:00:53,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611865378] [2022-12-13 20:00:53,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611865378] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:00:53,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233398583] [2022-12-13 20:00:53,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:00:53,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:00:53,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:00:53,497 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:00:53,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 20:01:09,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-13 20:01:09,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:01:09,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 125 conjunts are in the unsatisfiable core [2022-12-13 20:01:09,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:01:09,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:01:09,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:01:09,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:01:09,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:01:09,084 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:01:09,084 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 11 treesize of output 11 [2022-12-13 20:01:09,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:01:09,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:01:09,114 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:01:09,114 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 11 treesize of output 11 [2022-12-13 20:01:09,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:01:09,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:01:09,149 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:01:09,149 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 11 treesize of output 11 [2022-12-13 20:01:09,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:01:09,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:01:09,191 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:01:09,191 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 11 treesize of output 11 [2022-12-13 20:01:09,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:01:09,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:01:09,228 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:01:09,229 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 11 treesize of output 11 [2022-12-13 20:01:09,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:01:09,267 INFO L321 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-12-13 20:01:09,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 20:01:09,334 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-12-13 20:01:09,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 34 [2022-12-13 20:01:09,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:01:09,503 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-12-13 20:01:09,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 56 [2022-12-13 20:01:09,515 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:01:09,516 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 11 treesize of output 11 [2022-12-13 20:01:09,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:01:09,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 18 [2022-12-13 20:01:09,649 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:01:09,649 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 11 treesize of output 11 [2022-12-13 20:01:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:01:09,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:01:10,424 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 20:01:10,425 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 13 treesize of output 12 [2022-12-13 20:01:10,520 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 20:01:10,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 20:01:10,636 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 20:01:10,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-12-13 20:01:13,152 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 20:01:13,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 20:01:13,561 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 20:01:13,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 20:01:17,822 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 20:01:17,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 20:01:20,464 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 20:01:20,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 20:01:21,145 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 20:01:21,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 20:01:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:01:25,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233398583] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:01:25,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:01:25,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-13 20:01:25,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313457393] [2022-12-13 20:01:25,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:01:25,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 20:01:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:25,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 20:01:25,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=913, Unknown=6, NotChecked=0, Total=1190 [2022-12-13 20:01:27,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:30,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:32,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:34,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:37,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:39,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:42,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:44,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:46,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:48,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:50,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:52,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:55,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:56,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:01:58,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:03,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:05,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:06,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:08,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:12,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:14,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:16,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:18,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:20,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:22,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:25,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:27,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:29,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:31,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:33,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:36,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:38,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:42,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:46,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:49,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:50,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:53,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:55,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:57,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:02:59,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:01,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:05,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:08,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:10,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:12,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:14,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:17,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:20,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:21,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:23,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:24,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:27,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:29,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:32,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:34,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:36,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:38,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:42,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:44,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:46,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:48,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:52,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:56,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:03:58,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:00,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:02,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:05,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:07,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:10,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:12,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:14,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:17,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:19,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:21,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:23,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:25,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:27,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:29,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:31,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:34,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:37,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:39,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:41,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:43,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:45,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:47,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:49,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:52,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:55,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:57,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:04:59,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:05:01,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:05:03,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:05:05,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:05:07,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:05:10,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:05:12,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:05:14,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:05:14,656 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 533 [2022-12-13 20:05:14,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 115 transitions, 384 flow. Second operand has 35 states, 35 states have (on average 175.02857142857144) internal successors, (6126), 35 states have internal predecessors, (6126), 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-12-13 20:05:14,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:05:14,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 533 [2022-12-13 20:05:14,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:05:51,108 WARN L233 SmtUtils]: Spent 34.85s on a formula simplification. DAG size of input: 274 DAG size of output: 269 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:06:26,381 WARN L233 SmtUtils]: Spent 31.54s on a formula simplification. DAG size of input: 242 DAG size of output: 237 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:06:28,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:06:30,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:06:33,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:06:35,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:06:37,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:06:39,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:06:41,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:06:43,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:06:45,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:06:47,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:06:49,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:06:51,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:06:53,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:06:55,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:06:57,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:06:58,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:07:00,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:07:28,426 WARN L233 SmtUtils]: Spent 23.21s on a formula simplification. DAG size of input: 211 DAG size of output: 206 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:07:30,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:07:32,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:08:05,997 WARN L233 SmtUtils]: Spent 21.29s on a formula simplification. DAG size of input: 181 DAG size of output: 176 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:08:08,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:08:10,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:08:33,551 WARN L233 SmtUtils]: Spent 14.24s on a formula simplification. DAG size of input: 154 DAG size of output: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:08:35,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:08:57,011 WARN L233 SmtUtils]: Spent 9.61s on a formula simplification. DAG size of input: 128 DAG size of output: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:08:58,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:00,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:02,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:05,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:07,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:09,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:11,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:13,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:15,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:17,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:19,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:33,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:34,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:09:36,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:37,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:39,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:09:41,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:03,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:05,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:10,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:19,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:21,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 20:10:23,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:33,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:34,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:36,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:37,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:40,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:44,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:47,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:50,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:53,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:10:56,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:11:01,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 20:11:21,979 INFO L130 PetriNetUnfolder]: 81350/128855 cut-off events. [2022-12-13 20:11:21,979 INFO L131 PetriNetUnfolder]: For 15567/15567 co-relation queries the response was YES. [2022-12-13 20:11:22,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268346 conditions, 128855 events. 81350/128855 cut-off events. For 15567/15567 co-relation queries the response was YES. Maximal size of possible extension queue 3337. Compared 1095628 event pairs, 54039 based on Foata normal form. 17/67828 useless extension candidates. Maximal degree in co-relation 268326. Up to 49037 conditions per place. [2022-12-13 20:11:22,632 INFO L137 encePairwiseOnDemand]: 526/533 looper letters, 429 selfloop transitions, 46 changer transitions 0/483 dead transitions. [2022-12-13 20:11:22,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 483 transitions, 2477 flow [2022-12-13 20:11:22,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 20:11:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-13 20:11:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5350 transitions. [2022-12-13 20:11:22,641 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35848298043419996 [2022-12-13 20:11:22,641 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5350 transitions. [2022-12-13 20:11:22,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5350 transitions. [2022-12-13 20:11:22,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:11:22,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5350 transitions. [2022-12-13 20:11:22,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 191.07142857142858) internal successors, (5350), 28 states have internal predecessors, (5350), 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-12-13 20:11:22,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 533.0) internal successors, (15457), 29 states have internal predecessors, (15457), 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-12-13 20:11:22,664 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 533.0) internal successors, (15457), 29 states have internal predecessors, (15457), 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-12-13 20:11:22,664 INFO L175 Difference]: Start difference. First operand has 123 places, 115 transitions, 384 flow. Second operand 28 states and 5350 transitions. [2022-12-13 20:11:22,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 483 transitions, 2477 flow [2022-12-13 20:11:22,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 483 transitions, 2413 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-13 20:11:22,698 INFO L231 Difference]: Finished difference. Result has 150 places, 151 transitions, 802 flow [2022-12-13 20:11:22,698 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=802, PETRI_PLACES=150, PETRI_TRANSITIONS=151} [2022-12-13 20:11:22,699 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, 48 predicate places. [2022-12-13 20:11:22,699 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 151 transitions, 802 flow [2022-12-13 20:11:22,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 175.02857142857144) internal successors, (6126), 35 states have internal predecessors, (6126), 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-12-13 20:11:22,700 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:11:22,700 INFO L209 CegarLoopForPetriNet]: trace histogram [11, 1, 1, 1, 1, 1, 1] [2022-12-13 20:11:22,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 20:11:22,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-13 20:11:22,901 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-12-13 20:11:22,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:11:22,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1735223745, now seen corresponding path program 1 times [2022-12-13 20:11:22,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:11:22,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335243229] [2022-12-13 20:11:22,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:11:22,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:11:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:11:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:11:23,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:11:23,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335243229] [2022-12-13 20:11:23,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335243229] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:11:23,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051086062] [2022-12-13 20:11:23,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:11:23,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:11:23,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:11:23,210 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:11:23,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 20:11:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:11:23,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 20:11:23,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:11:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:11:23,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:11:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 20:11:23,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051086062] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:11:23,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:11:23,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2022-12-13 20:11:23,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461407847] [2022-12-13 20:11:23,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:11:23,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 20:11:23,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:11:23,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 20:11:23,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-12-13 20:11:23,706 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 533 [2022-12-13 20:11:23,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 151 transitions, 802 flow. Second operand has 27 states, 27 states have (on average 259.18518518518516) internal successors, (6998), 27 states have internal predecessors, (6998), 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-12-13 20:11:23,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:11:23,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 533 [2022-12-13 20:11:23,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:11:26,989 INFO L130 PetriNetUnfolder]: 19921/34550 cut-off events. [2022-12-13 20:11:26,989 INFO L131 PetriNetUnfolder]: For 5719/5719 co-relation queries the response was YES. [2022-12-13 20:11:27,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70112 conditions, 34550 events. 19921/34550 cut-off events. For 5719/5719 co-relation queries the response was YES. Maximal size of possible extension queue 1102. Compared 282130 event pairs, 18400 based on Foata normal form. 13/20596 useless extension candidates. Maximal degree in co-relation 70090. Up to 30672 conditions per place. [2022-12-13 20:11:27,173 INFO L137 encePairwiseOnDemand]: 529/533 looper letters, 82 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2022-12-13 20:11:27,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 127 transitions, 766 flow [2022-12-13 20:11:27,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 20:11:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-13 20:11:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 6824 transitions. [2022-12-13 20:11:27,182 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49242314908356183 [2022-12-13 20:11:27,182 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 6824 transitions. [2022-12-13 20:11:27,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 6824 transitions. [2022-12-13 20:11:27,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:11:27,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 6824 transitions. [2022-12-13 20:11:27,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 262.46153846153845) internal successors, (6824), 26 states have internal predecessors, (6824), 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-12-13 20:11:27,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 533.0) internal successors, (14391), 27 states have internal predecessors, (14391), 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-12-13 20:11:27,287 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 533.0) internal successors, (14391), 27 states have internal predecessors, (14391), 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-12-13 20:11:27,287 INFO L175 Difference]: Start difference. First operand has 150 places, 151 transitions, 802 flow. Second operand 26 states and 6824 transitions. [2022-12-13 20:11:27,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 127 transitions, 766 flow [2022-12-13 20:11:27,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 127 transitions, 546 flow, removed 84 selfloop flow, removed 24 redundant places. [2022-12-13 20:11:27,292 INFO L231 Difference]: Finished difference. Result has 151 places, 126 transitions, 394 flow [2022-12-13 20:11:27,293 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=394, PETRI_PLACES=151, PETRI_TRANSITIONS=126} [2022-12-13 20:11:27,293 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, 49 predicate places. [2022-12-13 20:11:27,293 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 126 transitions, 394 flow [2022-12-13 20:11:27,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 259.18518518518516) internal successors, (6998), 27 states have internal predecessors, (6998), 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-12-13 20:11:27,294 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:11:27,294 INFO L209 CegarLoopForPetriNet]: trace histogram [22, 1, 1] [2022-12-13 20:11:27,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 20:11:27,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 20:11:27,495 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-12-13 20:11:27,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:11:27,495 INFO L85 PathProgramCache]: Analyzing trace with hash -173166443, now seen corresponding path program 4 times [2022-12-13 20:11:27,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:11:27,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927178451] [2022-12-13 20:11:27,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:11:27,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:11:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:11:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:11:32,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:11:32,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927178451] [2022-12-13 20:11:32,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927178451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:11:32,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240061446] [2022-12-13 20:11:32,476 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:11:32,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:11:32,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:11:32,477 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:11:32,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a7bcac3-32ba-4443-8338-4e12dd4c413a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 20:11:32,816 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:11:32,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:11:32,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 1648 conjuncts, 227 conjunts are in the unsatisfiable core [2022-12-13 20:11:32,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:11:32,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:32,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:32,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:32,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:32,970 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:32,971 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 11 treesize of output 11 [2022-12-13 20:11:33,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,023 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,023 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 11 treesize of output 11 [2022-12-13 20:11:33,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,075 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,076 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 11 treesize of output 11 [2022-12-13 20:11:33,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,133 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 20:11:33,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,197 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,198 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 11 treesize of output 11 [2022-12-13 20:11:33,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,246 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,246 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 11 treesize of output 11 [2022-12-13 20:11:33,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,304 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,304 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 11 treesize of output 11 [2022-12-13 20:11:33,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,380 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,381 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 11 treesize of output 11 [2022-12-13 20:11:33,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,456 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,456 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 11 treesize of output 11 [2022-12-13 20:11:33,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,529 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,529 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 11 treesize of output 11 [2022-12-13 20:11:33,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,610 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,610 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 11 treesize of output 11 [2022-12-13 20:11:33,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,683 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,683 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 11 treesize of output 11 [2022-12-13 20:11:33,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,755 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,755 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 11 treesize of output 11 [2022-12-13 20:11:33,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,832 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,832 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 11 treesize of output 11 [2022-12-13 20:11:33,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,901 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,902 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 11 treesize of output 11 [2022-12-13 20:11:33,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:33,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:33,981 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:33,981 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 11 treesize of output 11 [2022-12-13 20:11:34,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:34,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:34,057 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:34,057 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 11 treesize of output 11 [2022-12-13 20:11:34,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:34,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:34,137 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:34,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 20:11:34,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:34,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:34,220 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:34,220 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 11 treesize of output 11 [2022-12-13 20:11:34,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:34,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:34,296 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:34,296 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 11 treesize of output 11 [2022-12-13 20:11:34,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 20:11:34,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 20:11:34,357 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 20:11:34,358 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 11 treesize of output 11 [2022-12-13 20:11:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:11:34,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:11:38,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:11:38,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2022-12-13 20:11:42,712 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:11:42,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 70 [2022-12-13 20:11:48,895 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:11:48,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:11:48,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 76 [2022-12-13 20:11:55,244 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 43 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:11:55,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:11:55,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 82 [2022-12-13 20:12:03,763 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 47 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:12:03,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:12:03,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 88 [2022-12-13 20:12:12,197 WARN L233 SmtUtils]: Spent 7.88s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:12:12,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:12:12,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 169 [2022-12-13 20:12:21,944 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 82 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:12:21,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:12:21,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 100 [2022-12-13 20:12:28,862 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 59 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:12:28,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:12:28,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 106 [2022-12-13 20:12:40,212 WARN L233 SmtUtils]: Spent 10.07s on a formula simplification. DAG size of input: 63 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:12:40,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:12:40,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 112 [2022-12-13 20:12:50,411 WARN L233 SmtUtils]: Spent 9.29s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:12:50,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:12:50,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 177 treesize of output 217 [2022-12-13 20:13:01,102 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 120 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:13:01,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:13:01,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 124 [2022-12-13 20:13:13,137 WARN L233 SmtUtils]: Spent 10.10s on a formula simplification. DAG size of input: 75 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:13:13,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:13:13,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 130 [2022-12-13 20:13:15,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:13:15,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 136 [2022-12-13 20:13:22,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:13:22,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 142 [2022-12-13 20:13:32,406 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:13:32,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:13:32,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 148 [2022-12-13 20:13:33,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:13:33,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 154 [2022-12-13 20:13:42,642 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 95 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:13:42,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:13:42,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 160 [2022-12-13 20:13:56,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:13:56,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 166