./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue.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_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/config/GemCutterMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w --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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- 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 09:30:01,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:30:01,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:30:01,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:30:01,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:30:01,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:30:01,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:30:01,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:30:01,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:30:01,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:30:01,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:30:01,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:30:01,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:30:01,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:30:01,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:30:01,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:30:01,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:30:01,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:30:01,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:30:01,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:30:01,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:30:01,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:30:01,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:30:01,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:30:01,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:30:01,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:30:01,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:30:01,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:30:01,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:30:01,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:30:01,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:30:01,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:30:01,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:30:01,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:30:01,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:30:01,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:30:01,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:30:01,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:30:01,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:30:01,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:30:01,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:30:01,234 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2022-12-13 09:30:01,250 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:30:01,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:30:01,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 09:30:01,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 09:30:01,251 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 09:30:01,251 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 09:30:01,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:30:01,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:30:01,252 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:30:01,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:30:01,252 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:30:01,252 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 09:30:01,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:30:01,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:30:01,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:30:01,253 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 09:30:01,253 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 09:30:01,253 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 09:30:01,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:30:01,253 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 09:30:01,254 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:30:01,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:30:01,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:30:01,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:30:01,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:30:01,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:30:01,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:30:01,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:30:01,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:30:01,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:30:01,255 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-13 09:30:01,255 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-12-13 09:30:01,255 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-12-13 09:30:01,255 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-12-13 09:30:01,255 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-12-13 09:30:01,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/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_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w 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 -> GemCutter 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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2022-12-13 09:30:01,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:30:01,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:30:01,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:30:01,463 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:30:01,464 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:30:01,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/../../sv-benchmarks/c/pthread/queue.i [2022-12-13 09:30:04,117 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:30:04,331 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:30:04,332 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/sv-benchmarks/c/pthread/queue.i [2022-12-13 09:30:04,346 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/data/560943c15/bec6e6a9b74b414194551b232eae6c0a/FLAGdc54659ea [2022-12-13 09:30:04,359 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/data/560943c15/bec6e6a9b74b414194551b232eae6c0a [2022-12-13 09:30:04,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:30:04,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 09:30:04,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:30:04,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:30:04,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:30:04,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:30:04" (1/1) ... [2022-12-13 09:30:04,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290592de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04, skipping insertion in model container [2022-12-13 09:30:04,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:30:04" (1/1) ... [2022-12-13 09:30:04,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:30:04,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:30:04,717 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_01749605-5182-4008-bf86-913122bbf3ad/sv-benchmarks/c/pthread/queue.i[43284,43297] [2022-12-13 09:30:04,722 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_01749605-5182-4008-bf86-913122bbf3ad/sv-benchmarks/c/pthread/queue.i[43491,43504] [2022-12-13 09:30:04,725 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_01749605-5182-4008-bf86-913122bbf3ad/sv-benchmarks/c/pthread/queue.i[43772,43785] [2022-12-13 09:30:04,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:30:04,740 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:30:04,781 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_01749605-5182-4008-bf86-913122bbf3ad/sv-benchmarks/c/pthread/queue.i[43284,43297] [2022-12-13 09:30:04,783 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_01749605-5182-4008-bf86-913122bbf3ad/sv-benchmarks/c/pthread/queue.i[43491,43504] [2022-12-13 09:30:04,785 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_01749605-5182-4008-bf86-913122bbf3ad/sv-benchmarks/c/pthread/queue.i[43772,43785] [2022-12-13 09:30:04,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:30:04,828 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:30:04,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04 WrapperNode [2022-12-13 09:30:04,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:30:04,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:30:04,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:30:04,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:30:04,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04" (1/1) ... [2022-12-13 09:30:04,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04" (1/1) ... [2022-12-13 09:30:04,881 INFO L138 Inliner]: procedures = 274, calls = 68, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2022-12-13 09:30:04,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:30:04,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:30:04,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:30:04,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:30:04,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04" (1/1) ... [2022-12-13 09:30:04,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04" (1/1) ... [2022-12-13 09:30:04,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04" (1/1) ... [2022-12-13 09:30:04,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04" (1/1) ... [2022-12-13 09:30:04,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04" (1/1) ... [2022-12-13 09:30:04,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04" (1/1) ... [2022-12-13 09:30:04,921 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04" (1/1) ... [2022-12-13 09:30:04,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04" (1/1) ... [2022-12-13 09:30:04,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:30:04,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:30:04,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:30:04,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:30:04,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04" (1/1) ... [2022-12-13 09:30:04,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:30:04,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:30:04,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:30:04,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:30:04,997 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 09:30:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 09:30:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 09:30:04,998 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 09:30:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:30:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:30:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 09:30:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:30:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 09:30:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:30:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:30:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:30:04,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:30:05,000 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 09:30:05,114 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 09:30:05,116 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:30:05,528 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 09:30:05,537 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:30:05,537 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 09:30:05,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:30:05 BoogieIcfgContainer [2022-12-13 09:30:05,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:30:05,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:30:05,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:30:05,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:30:05,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:30:04" (1/3) ... [2022-12-13 09:30:05,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58db6bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:30:05, skipping insertion in model container [2022-12-13 09:30:05,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:04" (2/3) ... [2022-12-13 09:30:05,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58db6bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:30:05, skipping insertion in model container [2022-12-13 09:30:05,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:30:05" (3/3) ... [2022-12-13 09:30:05,548 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2022-12-13 09:30:05,566 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:30:05,566 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-12-13 09:30:05,566 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:30:05,669 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 09:30:05,717 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:05,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-12-13 09:30:05,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:30:05,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-12-13 09:30:05,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-12-13 09:30:05,758 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-12-13 09:30:05,767 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2022-12-13 09:30:05,771 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=PARTIAL_ORDER_FA, 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;@5911591b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:05,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-12-13 09:30:06,039 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:30:06,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:06,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1814244061, now seen corresponding path program 1 times [2022-12-13 09:30:06,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:06,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462972715] [2022-12-13 09:30:06,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:06,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:06,353 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 09:30:06,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:06,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462972715] [2022-12-13 09:30:06,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462972715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:06,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:06,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:06,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752822701] [2022-12-13 09:30:06,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:06,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:06,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:06,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:06,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:06,384 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:06,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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 09:30:06,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:06,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:30:06,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:30:06,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash -686596020, now seen corresponding path program 1 times [2022-12-13 09:30:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:06,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717610940] [2022-12-13 09:30:06,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:06,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:07,908 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 09:30:07,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:07,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717610940] [2022-12-13 09:30:07,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717610940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:07,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:07,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-13 09:30:07,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475032426] [2022-12-13 09:30:07,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:07,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 09:30:07,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:07,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 09:30:07,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-12-13 09:30:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:07,914 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:07,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 states have internal predecessors, (121), 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 09:30:07,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:07,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:08,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:30:08,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:30:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 877949765, now seen corresponding path program 1 times [2022-12-13 09:30:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:08,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041478644] [2022-12-13 09:30:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:08,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:10,430 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 09:30:10,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:10,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041478644] [2022-12-13 09:30:10,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041478644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:10,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:10,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-12-13 09:30:10,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587569449] [2022-12-13 09:30:10,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:10,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 09:30:10,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:10,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 09:30:10,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2022-12-13 09:30:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:10,434 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:10,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.62962962962963) internal successors, (125), 27 states have internal predecessors, (125), 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 09:30:10,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:10,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:10,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:12,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:30:12,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:30:12,130 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err40ASSERT_VIOLATIONMEMORY_LEAK === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:30:12,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:12,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1532506879, now seen corresponding path program 1 times [2022-12-13 09:30:12,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:12,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460484745] [2022-12-13 09:30:12,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:12,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:12,183 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 09:30:12,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:12,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460484745] [2022-12-13 09:30:12,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460484745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:12,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:12,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:12,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035209352] [2022-12-13 09:30:12,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:12,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:12,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:12,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:12,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:12,188 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:12,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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 09:30:12,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:12,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:12,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:30:12,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:12,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:12,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:12,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:12,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:12,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:30:12,560 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:30:12,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:12,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1346963415, now seen corresponding path program 1 times [2022-12-13 09:30:12,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:12,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764641478] [2022-12-13 09:30:12,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:12,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 09:30:12,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:12,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764641478] [2022-12-13 09:30:12,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764641478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:12,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:12,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:12,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12926206] [2022-12-13 09:30:12,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:12,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:12,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:12,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:12,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:12,620 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:12,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 82.0) internal successors, (164), 3 states have internal predecessors, (164), 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 09:30:12,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:12,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:12,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:12,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:12,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:12,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:12,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:30:12,715 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:30:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1346963416, now seen corresponding path program 1 times [2022-12-13 09:30:12,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:12,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587010449] [2022-12-13 09:30:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:12,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:12,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587010449] [2022-12-13 09:30:12,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587010449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:12,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:12,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:30:12,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482291157] [2022-12-13 09:30:12,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:12,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:12,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:12,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:12,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:12,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:12,812 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:12,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 09:30:12,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:12,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:12,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:12,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:12,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:12,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:30:13,303 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:30:13,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2111915773, now seen corresponding path program 1 times [2022-12-13 09:30:13,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:13,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395958536] [2022-12-13 09:30:13,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:13,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 09:30:13,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:13,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395958536] [2022-12-13 09:30:13,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395958536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:13,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:13,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:30:13,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269798065] [2022-12-13 09:30:13,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:13,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:13,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:13,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:13,510 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:13,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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 09:30:13,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:13,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:13,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:13,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:13,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:30:13,600 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:30:13,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:13,600 INFO L85 PathProgramCache]: Analyzing trace with hash 534537020, now seen corresponding path program 1 times [2022-12-13 09:30:13,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:13,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271633671] [2022-12-13 09:30:13,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:13,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 09:30:13,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:13,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271633671] [2022-12-13 09:30:13,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271633671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:13,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:13,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:13,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564236134] [2022-12-13 09:30:13,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:13,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:13,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:13,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:13,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:13,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:13,680 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:13,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 105.0) internal successors, (210), 3 states have internal predecessors, (210), 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 09:30:13,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:13,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:13,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:13,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:13,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,681 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:13,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:13,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:30:13,806 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:30:13,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash 534537021, now seen corresponding path program 1 times [2022-12-13 09:30:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:13,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065068770] [2022-12-13 09:30:13,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:13,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 09:30:15,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:15,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065068770] [2022-12-13 09:30:15,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065068770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:15,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:15,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-12-13 09:30:15,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122777108] [2022-12-13 09:30:15,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:15,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 09:30:15,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:15,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 09:30:15,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-12-13 09:30:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:15,807 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:15,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.62962962962963) internal successors, (233), 27 states have internal predecessors, (233), 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 09:30:15,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:15,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:15,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:15,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:15,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:15,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:15,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:15,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:15,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:30:17,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:30:17,525 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:30:17,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash 187430500, now seen corresponding path program 1 times [2022-12-13 09:30:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:17,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028021849] [2022-12-13 09:30:17,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:18,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:18,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028021849] [2022-12-13 09:30:18,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028021849] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:30:18,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156277521] [2022-12-13 09:30:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:18,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:30:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:30:18,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:30:18,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 09:30:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:18,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 09:30:18,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:30:18,364 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 09:30:18,364 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 09:30:18,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 09:30:18,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:30:18,384 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 09:30:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:19,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:30:24,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:30:24,199 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 48 treesize of output 52 [2022-12-13 09:30:24,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:30:24,211 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 09:30:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:24,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156277521] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:30:24,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:30:24,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2022-12-13 09:30:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024137265] [2022-12-13 09:30:24,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:30:24,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 09:30:24,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:24,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 09:30:24,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-12-13 09:30:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:24,280 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:24,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 32.61904761904762) internal successors, (685), 22 states have internal predecessors, (685), 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 09:30:24,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:24,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:24,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:24,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:24,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:24,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:24,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:24,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:24,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:30:24,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:30:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:30:25,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 09:30:25,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:30:25,271 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:30:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1227633974, now seen corresponding path program 1 times [2022-12-13 09:30:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:25,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439830135] [2022-12-13 09:30:25,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:25,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:26,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:26,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439830135] [2022-12-13 09:30:26,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439830135] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:30:26,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745087508] [2022-12-13 09:30:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:26,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:30:26,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:30:26,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:30:26,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 09:30:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:26,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 09:30:26,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:30:26,330 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 09:30:26,331 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 09:30:26,337 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 09:30:26,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:30:26,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 09:30:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:27,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:30:28,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:30:28,542 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 48 treesize of output 52 [2022-12-13 09:30:28,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:30:28,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 09:30:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:28,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745087508] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:30:28,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:30:28,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 34 [2022-12-13 09:30:28,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086935056] [2022-12-13 09:30:28,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:30:28,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 09:30:28,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:28,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 09:30:28,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2022-12-13 09:30:28,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:28,628 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:28,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 21.558823529411764) internal successors, (733), 35 states have internal predecessors, (733), 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 09:30:28,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:28,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:28,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:28,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:28,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:28,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:28,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:28,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:28,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:30:28,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:30:28,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:30:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:30:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:30:29,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 09:30:30,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:30:30,128 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:30:30,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:30,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1899428134, now seen corresponding path program 2 times [2022-12-13 09:30:30,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:30,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127867090] [2022-12-13 09:30:30,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:31,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:31,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127867090] [2022-12-13 09:30:31,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127867090] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:30:31,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751873495] [2022-12-13 09:30:31,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 09:30:31,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:30:31,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:30:31,255 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:30:31,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 09:30:31,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 09:30:31,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 09:30:31,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 09:30:31,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:30:31,604 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 09:30:31,604 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 09:30:31,608 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 09:30:31,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:30:31,617 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 09:30:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:33,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:30:40,470 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:30:40,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:30:40,634 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 48 treesize of output 52 [2022-12-13 09:30:40,646 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:30:40,646 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 09:30:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:40,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751873495] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:30:40,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:30:40,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 57 [2022-12-13 09:30:40,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968065617] [2022-12-13 09:30:40,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:30:40,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-12-13 09:30:40,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:40,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-12-13 09:30:40,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=2845, Unknown=0, NotChecked=0, Total=3306 [2022-12-13 09:30:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:40,724 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:30:40,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 14.543859649122806) internal successors, (829), 58 states have internal predecessors, (829), 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 09:30:40,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:40,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:40,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:40,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:40,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:40,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:40,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:40,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:40,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:30:40,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:30:40,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:30:40,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:30:44,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:30:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:30:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:30:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:30:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:30:44,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:30:44,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 09:30:44,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 09:30:44,795 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:30:44,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1470891486, now seen corresponding path program 3 times [2022-12-13 09:30:44,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:44,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457359568] [2022-12-13 09:30:44,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:44,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:47,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:47,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457359568] [2022-12-13 09:30:47,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457359568] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:30:47,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249957086] [2022-12-13 09:30:47,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 09:30:47,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:30:47,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:30:47,040 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:30:47,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 09:30:47,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-13 09:30:47,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 09:30:47,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 130 conjunts are in the unsatisfiable core [2022-12-13 09:30:47,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:30:47,600 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 09:30:47,600 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 09:30:47,632 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 09:30:47,633 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 09:30:47,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 09:30:47,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:30:48,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-13 09:30:48,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:30:48,708 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-12-13 09:30:48,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-12-13 09:30:48,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:30:48,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:30:48,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-12-13 09:30:49,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 27 [2022-12-13 09:30:49,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:30:49,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-12-13 09:30:49,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 09:30:49,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:30:49,883 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-12-13 09:30:49,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 41 [2022-12-13 09:30:49,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:30:49,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:30:49,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-12-13 09:30:50,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 29 [2022-12-13 09:30:50,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:30:50,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-12-13 09:30:51,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-12-13 09:30:52,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:30:52,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:30:52,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-12-13 09:30:52,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-12-13 09:30:52,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:30:52,602 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:30:52,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 27 [2022-12-13 09:30:52,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:30:52,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 09:30:52,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 09:30:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 6 proven. 121 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2022-12-13 09:30:52,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:30:55,828 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_1058 Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1052) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1058) .cse1)))))) is different from false [2022-12-13 09:30:56,514 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_1047 Int) (v_ArrVal_1058 Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1047) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1052) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1058) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 .cse1)))))) is different from false [2022-12-13 09:30:56,801 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_1045 Int) (v_ArrVal_1047 Int) (v_ArrVal_1058 Int) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1045))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1047) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1052) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 .cse3))) (not (= 20 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1058) .cse3))))))))) is different from false [2022-12-13 09:30:57,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-12-13 09:31:03,200 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_1045 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_1047 Int) (v_ArrVal_1058 Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1044))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_1045))) (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1047) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1052) |c_~#queue~0.base|)) (.cse2 (select .cse3 .cse1))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1058) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| .cse2)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 .cse1))) (= (select .cse3 (+ |c_~#queue~0.offset| 80)) .cse2)))))) is different from false [2022-12-13 09:31:03,610 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1040 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_1045 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_1047 Int) (v_ArrVal_1058 Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1040) .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1044))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse1 .cse3)) (.cse2 (select (store (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_1045))) (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1047) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1052) |c_~#queue~0.base|))) (or (= .cse0 (select .cse1 (+ |c_~#queue~0.offset| 80))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| .cse0)) (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1058) .cse3) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 .cse3)))))))) is different from false [2022-12-13 09:31:03,709 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1040 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_1045 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_1047 Int) (v_ArrVal_1058 Int) (v_ArrVal_1039 Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1039)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1040) .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1044))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select .cse0 .cse3)) (.cse2 (select (store (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_1045))) (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1047) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1052) |c_~#queue~0.base|))) (or (= (select .cse0 (+ |c_~#queue~0.offset| 80)) .cse1) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| .cse1)) (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1058) .cse3) 20))))))) is different from false [2022-12-13 09:31:03,760 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_60| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_60| (select .cse0 .cse1))) (forall ((v_ArrVal_1040 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_1045 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_1047 Int) (v_ArrVal_1058 Int) (v_ArrVal_1039 Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_60|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1039))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1040) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1044))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_1045))) (store (store .cse7 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1047) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1052) |c_~#queue~0.base|)) (.cse4 (select .cse5 .cse3))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse2 .cse3))) (= .cse4 (select .cse5 (+ |c_~#queue~0.offset| 80))) (not (= 20 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1058) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| .cse4)))))))))) is different from false [2022-12-13 09:31:03,826 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1040 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_60| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_1045 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_1047 Int) (v_ArrVal_1058 Int) (v_ArrVal_1039 Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse8 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_60|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1039))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1040) .cse5 (+ 1 (select .cse8 .cse5))))) |c_~#stored_elements~0.base| v_ArrVal_1044))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_1045))) (store (store .cse7 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1047) .cse1 (+ 1 (select .cse7 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1052) |c_~#queue~0.base|)) (.cse3 (select .cse2 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1058) .cse1))) (= (select .cse2 (+ |c_~#queue~0.offset| 80)) .cse3) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| .cse3)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_60| (select .cse4 .cse5))))))))) is different from false [2022-12-13 09:31:04,663 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_60| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1040 Int) (v_ArrVal_1045 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_1047 Int) (v_ArrVal_1058 Int) (v_ArrVal_1039 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1037))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_60|) |c_~#queue~0.offset|) v_ArrVal_1039))) (store (store .cse9 .cse7 v_ArrVal_1040) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1044))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select .cse3 .cse1)) (.cse0 (select (store (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_1045))) (store (store .cse6 .cse7 v_ArrVal_1047) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1052) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| .cse2)) (= .cse2 (select .cse3 (+ |c_~#queue~0.offset| 80))) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1058) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_60| (select .cse4 .cse1)))))))))) is different from false [2022-12-13 09:31:06,216 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_60| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int)) (v_ArrVal_1040 Int) (v_ArrVal_1035 Int) (v_ArrVal_1045 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| Int) (v_ArrVal_1047 Int) (v_ArrVal_1058 Int) (v_ArrVal_1039 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_1035)))) (let ((.cse11 (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_1037))) (let ((.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_60|) |c_~#queue~0.offset|) v_ArrVal_1039))) (store (store .cse12 .cse10 v_ArrVal_1040) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1044))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57|) |c_~#queue~0.offset|) v_ArrVal_1045))) (store (store .cse9 .cse10 v_ArrVal_1047) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1051) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1052) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80)) (.cse7 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1058) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_60| (select .cse2 .cse1))) (not (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (= (select .cse3 .cse1) (select .cse3 .cse4)))) (= (select .cse6 .cse4) .cse7) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_57| .cse7)))))))))) is different from false [2022-12-13 09:31:06,291 INFO L321 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2022-12-13 09:31:06,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1775 treesize of output 1343 [2022-12-13 09:31:06,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:06,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2367 treesize of output 2305 [2022-12-13 09:31:06,378 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 0 case distinctions, treesize of input 1547 treesize of output 1515 [2022-12-13 09:31:06,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1385 treesize of output 1345 [2022-12-13 09:31:06,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1455 treesize of output 1375 [2022-12-13 09:31:06,489 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 0 case distinctions, treesize of input 1645 treesize of output 1605 [2022-12-13 09:31:07,076 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:07,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 91 treesize of output 79 [2022-12-13 09:31:08,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:08,091 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 404 treesize of output 350 [2022-12-13 09:31:09,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:31:09,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-12-13 09:31:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 6 proven. 115 refuted. 0 times theorem prover too weak. 798 trivial. 6 not checked. [2022-12-13 09:31:09,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249957086] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:31:09,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:31:09,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 42, 49] total 126 [2022-12-13 09:31:09,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864117188] [2022-12-13 09:31:09,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:31:09,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-12-13 09:31:09,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:09,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-12-13 09:31:09,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=883, Invalid=12287, Unknown=210, NotChecked=2370, Total=15750 [2022-12-13 09:31:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:09,396 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:31:09,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 6.317460317460317) internal successors, (796), 126 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:09,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:09,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:31:09,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:31:09,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:09,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:09,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:09,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:09,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:31:09,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:31:09,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:31:09,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:31:09,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:31:09,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:31:11,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:32:06,312 WARN L233 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 178 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:33:10,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:33:23,610 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 09:33:28,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 09:33:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:33:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:33:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:33:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:33:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:33:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:33:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:33:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:33:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-12-13 09:33:39,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 09:33:39,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 09:33:39,847 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:33:39,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash 340708299, now seen corresponding path program 1 times [2022-12-13 09:33:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:39,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347610884] [2022-12-13 09:33:39,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:39,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 441 proven. 61 refuted. 0 times theorem prover too weak. 1076 trivial. 0 not checked. [2022-12-13 09:33:47,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:47,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347610884] [2022-12-13 09:33:47,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347610884] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:33:47,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661985417] [2022-12-13 09:33:47,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:47,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:33:47,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:33:47,276 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:33:47,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 09:33:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:47,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-13 09:33:47,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:33:47,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:47,643 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 09:33:47,658 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 09:33:47,659 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 09:33:47,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:33:47,671 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 09:33:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 0 proven. 1578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:33:51,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:34:00,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:00,085 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 48 treesize of output 52 [2022-12-13 09:34:00,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:00,098 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 09:34:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1578 backedges. 0 proven. 1578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:34:00,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661985417] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:34:00,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:34:00,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 41, 41] total 116 [2022-12-13 09:34:00,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091736571] [2022-12-13 09:34:00,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:34:00,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2022-12-13 09:34:00,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:34:00,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2022-12-13 09:34:00,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=858, Invalid=12482, Unknown=0, NotChecked=0, Total=13340 [2022-12-13 09:34:00,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:00,217 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:34:00,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 116 states have (on average 11.077586206896552) internal successors, (1285), 116 states have internal predecessors, (1285), 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 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2022-12-13 09:34:00,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:34:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:34:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:34:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:34:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:34:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:34:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-12-13 09:34:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-12-13 09:34:17,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 09:34:17,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 09:34:17,970 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:34:17,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:34:17,971 INFO L85 PathProgramCache]: Analyzing trace with hash -511114433, now seen corresponding path program 1 times [2022-12-13 09:34:17,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:34:17,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046025838] [2022-12-13 09:34:17,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:34:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1835 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:34:19,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:34:19,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046025838] [2022-12-13 09:34:19,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046025838] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:34:19,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753095187] [2022-12-13 09:34:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:19,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:34:19,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:34:19,629 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:34:19,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 09:34:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:19,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 1540 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 09:34:19,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:34:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1841 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2022-12-13 09:34:20,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 09:34:20,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753095187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:34:20,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 09:34:20,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [45] total 47 [2022-12-13 09:34:20,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086443609] [2022-12-13 09:34:20,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:34:20,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 09:34:20,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:34:20,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 09:34:20,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=1628, Unknown=0, NotChecked=0, Total=2162 [2022-12-13 09:34:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:20,035 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:34:20,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 10.073170731707316) internal successors, (413), 41 states have internal predecessors, (413), 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 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-12-13 09:34:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:34:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:34:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:34:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:34:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:34:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:34:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-12-13 09:34:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-12-13 09:34:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-13 09:34:22,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 09:34:23,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 09:34:23,026 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:34:23,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:34:23,027 INFO L85 PathProgramCache]: Analyzing trace with hash -424037674, now seen corresponding path program 1 times [2022-12-13 09:34:23,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:34:23,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482011285] [2022-12-13 09:34:23,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:23,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:34:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1319 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2022-12-13 09:34:23,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:34:23,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482011285] [2022-12-13 09:34:23,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482011285] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:34:23,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105541042] [2022-12-13 09:34:23,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:23,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:34:23,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:34:23,306 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:34:23,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 09:34:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:23,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:34:23,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:34:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1319 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2022-12-13 09:34:23,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 09:34:23,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105541042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:34:23,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 09:34:23,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-12-13 09:34:23,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719589486] [2022-12-13 09:34:23,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:34:23,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:34:23,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:34:23,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:34:23,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:34:23,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:23,540 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:34:23,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 116.0) internal successors, (232), 3 states have internal predecessors, (232), 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 09:34:23,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:23,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:34:23,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:34:23,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:23,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:23,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:23,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:23,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:23,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:34:23,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:34:23,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:34:23,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:34:23,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2022-12-13 09:34:23,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-12-13 09:34:23,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-12-13 09:34:23,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:34:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:34:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:34:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:34:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:34:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:34:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-12-13 09:34:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-12-13 09:34:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-13 09:34:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:23,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 09:34:23,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:34:23,882 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:34:23,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:34:23,882 INFO L85 PathProgramCache]: Analyzing trace with hash 388122827, now seen corresponding path program 1 times [2022-12-13 09:34:23,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:34:23,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887102248] [2022-12-13 09:34:23,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:23,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:34:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2022-12-13 09:34:24,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:34:24,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887102248] [2022-12-13 09:34:24,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887102248] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:34:24,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938238427] [2022-12-13 09:34:24,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:24,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:34:24,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:34:24,084 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:34:24,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 09:34:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:24,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:34:24,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:34:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1309 trivial. 0 not checked. [2022-12-13 09:34:24,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 09:34:24,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938238427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:34:24,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 09:34:24,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-12-13 09:34:24,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555512190] [2022-12-13 09:34:24,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:34:24,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:34:24,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:34:24,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:34:24,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:34:24,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:24,312 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:34:24,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 110.5) internal successors, (221), 3 states have internal predecessors, (221), 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 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:24,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-13 09:34:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:24,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:24,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 09:34:24,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:34:24,655 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:34:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:34:24,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1426100586, now seen corresponding path program 1 times [2022-12-13 09:34:24,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:34:24,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13713889] [2022-12-13 09:34:24,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:24,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:34:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2022-12-13 09:34:25,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:34:25,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13713889] [2022-12-13 09:34:25,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13713889] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:34:25,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684732897] [2022-12-13 09:34:25,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:25,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:34:25,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:34:25,296 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:34:25,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 09:34:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:25,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 09:34:25,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:34:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2022-12-13 09:34:26,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:34:27,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:34:27,754 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 16 treesize of output 20 [2022-12-13 09:34:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2022-12-13 09:34:27,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684732897] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:34:27,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:34:27,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2022-12-13 09:34:27,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51954339] [2022-12-13 09:34:27,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:34:27,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 09:34:27,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:34:27,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 09:34:27,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-12-13 09:34:27,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:27,818 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:34:27,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 28.40909090909091) internal successors, (625), 23 states have internal predecessors, (625), 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 09:34:27,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:27,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:34:27,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:34:27,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:27,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:27,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:27,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:27,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:27,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:34:27,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:34:27,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:34:27,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:34:27,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2022-12-13 09:34:27,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-12-13 09:34:27,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-12-13 09:34:27,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:27,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:27,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:34:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:34:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:34:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:34:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:34:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:34:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:34:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-12-13 09:34:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-12-13 09:34:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-13 09:34:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:34:28,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 09:34:28,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 09:34:28,558 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:34:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:34:28,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1781754295, now seen corresponding path program 1 times [2022-12-13 09:34:28,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:34:28,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901198237] [2022-12-13 09:34:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:28,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:34:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1307 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2022-12-13 09:34:36,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:34:36,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901198237] [2022-12-13 09:34:36,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901198237] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:34:36,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186536433] [2022-12-13 09:34:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:36,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:34:36,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:34:36,053 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:34:36,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 09:34:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:36,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 115 conjunts are in the unsatisfiable core [2022-12-13 09:34:36,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:34:36,544 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 09:34:36,544 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 09:34:36,610 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 09:34:36,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 09:34:36,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:34:37,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:34:37,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:37,944 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 09:34:37,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:34:38,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:34:38,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:34:38,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 09:34:38,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:34:38,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:34:39,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:39,261 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:34:39,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 44 treesize of output 34 [2022-12-13 09:34:39,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:34:39,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-12-13 09:34:39,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-12-13 09:34:40,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:34:40,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 09:34:42,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:34:42,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-12-13 09:34:43,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:34:43,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-12-13 09:34:43,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-12-13 09:34:44,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:34:44,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2022-12-13 09:34:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1307 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2022-12-13 09:34:44,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:34:46,249 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 09:34:46,995 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-12-13 09:34:47,265 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2716 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse1)) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse1))))))) is different from false [2022-12-13 09:34:47,278 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-12-13 09:35:08,920 WARN L233 SmtUtils]: Spent 10.18s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:35:10,050 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_2708 (Array Int Int))) (let ((.cse0 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)))) (or (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* 4 (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_2709))) (store (store .cse1 .cse2 v_ArrVal_2711) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse5))))))) (forall ((v_ArrVal_2708 (Array Int Int))) (let ((.cse8 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2709))) (store (store .cse9 .cse2 v_ArrVal_2711) .cse3 (+ (select .cse9 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|)))))))))) is different from false [2022-12-13 09:36:36,316 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2701 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2701))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| (select .cse0 .cse1))) (forall ((v_ArrVal_2702 Int)) (let ((.cse8 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_2702))) (let ((.cse9 (select .cse8 .cse1))) (or (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse3 (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_2704) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (+ (* 4 (select .cse6 .cse1)) |c_~#queue~0.offset|))) (or (not (<= 0 .cse2)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse6 .cse2 v_ArrVal_2709))) (store (store .cse4 .cse5 v_ArrVal_2711) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|)))))))) (= .cse9 20))))))))) (forall ((v_ArrVal_2701 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2701))) (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2702 Int)) (let ((.cse16 (store .cse17 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_2702))) (let ((.cse10 (select .cse16 .cse1))) (or (= .cse10 20) (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse5 v_ArrVal_2704) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (+ (* 4 (select .cse14 .cse1)) |c_~#queue~0.offset|))) (or (not (<= 0 .cse11)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* 4 (select (select (store (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse14 .cse11 v_ArrVal_2709))) (store (store .cse13 .cse5 v_ArrVal_2711) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| (select .cse17 .cse1))))))))) is different from false [2022-12-13 09:36:38,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:36:38,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1422 treesize of output 872 [2022-12-13 09:36:38,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:36:38,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2618 treesize of output 2588 [2022-12-13 09:36:38,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2681 treesize of output 2633 [2022-12-13 09:36:38,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2633 treesize of output 2553 [2022-12-13 09:36:38,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:36:38,909 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 2662 treesize of output 2626 [2022-12-13 09:36:38,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2605 treesize of output 2565 [2022-12-13 09:36:38,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2649 treesize of output 2585 [2022-12-13 09:36:39,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2585 treesize of output 2557 [2022-12-13 09:36:39,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2608 treesize of output 2584 [2022-12-13 09:36:39,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2584 treesize of output 2528 [2022-12-13 09:36:39,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2604 treesize of output 2548 [2022-12-13 09:36:39,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-12-13 09:36:50,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:36:50,189 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 2442 treesize of output 2078 [2022-12-13 09:36:52,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-12-13 09:36:52,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:36:52,652 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 25 treesize of output 43 [2022-12-13 09:36:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1307 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1173 trivial. 120 not checked. [2022-12-13 09:36:53,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186536433] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:36:53,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:36:53,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34, 38] total 107 [2022-12-13 09:36:53,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567018288] [2022-12-13 09:36:53,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:36:53,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-12-13 09:36:53,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:36:53,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-12-13 09:36:53,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=815, Invalid=9408, Unknown=103, NotChecked=1230, Total=11556 [2022-12-13 09:36:53,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:36:53,092 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:36:53,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 107 states have (on average 6.158878504672897) internal successors, (659), 108 states have internal predecessors, (659), 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 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-12-13 09:36:53,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-12-13 09:36:53,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:36:53,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:36:53,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:36:53,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:37:59,300 WARN L233 SmtUtils]: Spent 13.17s on a formula simplification. DAG size of input: 195 DAG size of output: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:39:02,084 WARN L233 SmtUtils]: Spent 11.76s on a formula simplification. DAG size of input: 415 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:39:04,125 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse30 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse40 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse59 (select .cse40 84)) (.cse86 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse39 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse22 (select .cse31 .cse30))) (let ((.cse50 (select (select |c_#memory_int| 5) 84)) (.cse21 (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_#in~q#1.base|) 84)) (.cse35 (* .cse22 4)) (.cse64 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse31 .cse30 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse38 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse43 (select .cse40 .cse39)) (.cse58 (select .cse86 .cse6)) (.cse57 (* .cse59 4)) (.cse36 (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse29 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse66 (+ .cse22 1)) (.cse65 (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) 84)) (.cse85 (select .cse86 84)) (.cse0 (select |c_#length| |c_~#queue~0.base|))) (and (<= (+ 92 |c_~#queue~0.offset|) .cse0) (or (not (<= (+ 92 |c_ULTIMATE.start_init_~q#1.offset|) (select |c_#length| |c_ULTIMATE.start_init_~q#1.base|))) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse12 (+ 88 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((v_ArrVal_2701 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_2699 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse11 .cse12 v_ArrVal_2699)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2701))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2702 Int)) (let ((.cse9 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_2702))) (let ((.cse1 (select .cse9 .cse6))) (or (= .cse1 20) (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2704) .cse6 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (+ (* (select .cse7 .cse6) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse2)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse7 .cse2 v_ArrVal_2709))) (store (store .cse4 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse4 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) .cse0))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| (select .cse10 .cse6))))))) (forall ((v_ArrVal_2701 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_2699 Int)) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse11 .cse12 v_ArrVal_2699)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2701))) (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2702 Int)) (let ((.cse19 (store .cse20 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_2702))) (let ((.cse13 (select .cse19 .cse6))) (or (= .cse13 20) (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse5 v_ArrVal_2704) .cse6 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (let ((.cse14 (+ (* (select .cse17 .cse6) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse14)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse15 |c_~#queue~0.base| (let ((.cse16 (store .cse17 .cse14 v_ArrVal_2709))) (store (store .cse16 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse16 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|)))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| (select .cse20 .cse6)))))))))) (<= 2 .cse21) (not (= 5 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= |c_~#stored_elements~0.base| 4) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| .cse22)) (forall ((v_ArrVal_2702 Int)) (let ((.cse28 (store .cse31 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2702))) (let ((.cse23 (select .cse28 .cse30))) (or (= .cse23 20) (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse24 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse28 .cse29 v_ArrVal_2704) .cse30 (+ .cse23 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (let ((.cse27 (+ (* (select .cse26 .cse6) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse24 |c_~#queue~0.base| (let ((.cse25 (store .cse26 .cse27 v_ArrVal_2709))) (store (store .cse25 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse25 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse27))))))))))))) (let ((.cse32 (+ .cse35 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (not (<= 0 .cse32)) (and (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse33 (store .cse31 .cse32 v_ArrVal_2709))) (store (store .cse33 .cse29 v_ArrVal_2711) .cse30 (+ (select .cse33 .cse30) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6))) .cse0)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse34 (store .cse31 .cse32 v_ArrVal_2709))) (store (store .cse34 .cse29 v_ArrVal_2711) .cse30 (+ (select .cse34 .cse30) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6)))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 2 .cse22) (<= 92 .cse36) (let ((.cse41 (+ (* .cse43 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (and (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse37 (store .cse40 .cse41 v_ArrVal_2709))) (store (store .cse37 .cse38 v_ArrVal_2711) .cse39 (+ (select .cse37 .cse39) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse42 (store .cse40 .cse41 v_ArrVal_2709))) (store (store .cse42 .cse38 v_ArrVal_2711) .cse39 (+ (select .cse42 .cse39) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) .cse0))) (not (<= 0 .cse41)))) (= |c_t2Thread1of1ForFork1_dequeue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 0) (= |c_~#stored_elements~0.base| 4) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| .cse43)) (forall ((v_ArrVal_2702 Int)) (let ((.cse48 (store .cse40 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2702))) (let ((.cse49 (select .cse48 .cse39))) (or (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse44 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse48 .cse38 v_ArrVal_2704) .cse39 (+ .cse49 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse46 (select .cse44 |c_~#queue~0.base|))) (let ((.cse47 (+ |c_~#queue~0.offset| (* (select .cse46 .cse6) 4)))) (or (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse44 |c_~#queue~0.base| (let ((.cse45 (store .cse46 .cse47 v_ArrVal_2709))) (store (store .cse45 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse45 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse47))))))) (= .cse49 20))))))) (<= 4 (* .cse50 4)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int)) (or (forall ((v_ArrVal_2702 Int)) (let ((.cse55 (store .cse31 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2702))) (let ((.cse56 (select .cse55 .cse30))) (or (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse52 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse55 .cse29 v_ArrVal_2704) .cse30 (+ .cse56 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse54 (select .cse52 |c_~#queue~0.base|))) (let ((.cse51 (+ (* (select .cse54 .cse6) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse51)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse52 |c_~#queue~0.base| (let ((.cse53 (store .cse54 .cse51 v_ArrVal_2709))) (store (store .cse53 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse53 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) .cse0))))))) (= .cse56 20))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| .cse22)))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| 5) (= |c_~#queue~0.offset| 0) (<= 4 .cse57) (<= .cse58 2) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| |c_~#queue~0.offset|) (<= .cse50 2) (= 5 |c_~#queue~0.base|) (= (select |c_#valid| 5) 1) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (<= 2 .cse59) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((v_ArrVal_2708 (Array Int Int))) (let ((.cse60 (store .cse64 |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse62 (select .cse60 |c_~#queue~0.base|))) (let ((.cse63 (+ |c_~#queue~0.offset| (* (select .cse62 .cse6) 4)))) (or (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse60 |c_~#queue~0.base| (let ((.cse61 (store .cse62 .cse63 v_ArrVal_2709))) (store (store .cse61 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse61 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) .cse0)) (not (<= 0 .cse63))))))) (= 5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= 2 .cse65) (exists ((|ULTIMATE.start_main_~#id2~0#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_main_~#id2~0#1.base|) 4)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse31 .cse29 v_ArrVal_2711) .cse30 .cse66)) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4)) .cse0)) (<= (+ (* .cse21 4) 84) .cse0) (<= (+ .cse35 84) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (= |c_t2Thread1of1ForFork1_dequeue_~q#1.base| |c_~#queue~0.base|) (= |c_t2Thread1of1ForFork1_dequeue_#in~q#1.offset| 0) (forall ((v_ArrVal_2708 (Array Int Int))) (let ((.cse67 (store .cse64 |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse69 (select .cse67 |c_~#queue~0.base|))) (let ((.cse70 (+ |c_~#queue~0.offset| (* (select .cse69 .cse6) 4)))) (or (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse67 |c_~#queue~0.base| (let ((.cse68 (store .cse69 .cse70 v_ArrVal_2709))) (store (store .cse68 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse68 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse70))))))) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= |c_~#queue~0.base| |c_t2Thread1of1ForFork1_dequeue_#in~q#1.base|) (or (and (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse71 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse31 .cse29 v_ArrVal_2704) .cse30 .cse66)) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse73 (select .cse71 |c_~#queue~0.base|))) (let ((.cse74 (+ (* (select .cse73 .cse6) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse71 |c_~#queue~0.base| (let ((.cse72 (store .cse73 .cse74 v_ArrVal_2709))) (store (store .cse72 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse72 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse74))))))) (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse75 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse31 .cse29 v_ArrVal_2704) .cse30 .cse66)) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse77 (select .cse75 |c_~#queue~0.base|))) (let ((.cse78 (+ (* (select .cse77 .cse6) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse75 |c_~#queue~0.base| (let ((.cse76 (store .cse77 .cse78 v_ArrVal_2709))) (store (store .cse76 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse76 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) .cse0)) (not (<= 0 .cse78)))))))) (= .cse22 20)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int)) (or (forall ((v_ArrVal_2702 Int)) (let ((.cse84 (store .cse40 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2702))) (let ((.cse79 (select .cse84 .cse39))) (or (= .cse79 20) (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse81 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse84 .cse38 v_ArrVal_2704) .cse39 (+ .cse79 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse83 (select .cse81 |c_~#queue~0.base|))) (let ((.cse80 (+ |c_~#queue~0.offset| (* (select .cse83 .cse6) 4)))) (or (not (<= 0 .cse80)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse81 |c_~#queue~0.base| (let ((.cse82 (store .cse83 .cse80 v_ArrVal_2709))) (store (store .cse82 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse82 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) .cse0))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| .cse43)))) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id2~0#1.base|) 4) (<= 2 .cse85) (<= 4 (+ (* .cse58 4) |c_~#queue~0.offset|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= 92 (select |c_#length| 5)) (<= (+ .cse57 84) .cse36) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse31 .cse29 v_ArrVal_2711) .cse30 .cse66)) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4)))) (<= (+ (* 4 .cse65) 84) .cse0) (<= (+ 84 (* .cse85 4)) .cse0) (<= .cse59 2))))) is different from true [2022-12-13 09:39:06,236 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse30 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse41 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse60 (select .cse41 84)) (.cse87 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse40 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse22 (select .cse31 .cse30))) (let ((.cse51 (select (select |c_#memory_int| 5) 84)) (.cse21 (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_#in~q#1.base|) 84)) (.cse35 (* .cse22 4)) (.cse65 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse31 .cse30 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse39 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse44 (select .cse41 .cse40)) (.cse36 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse31 .cse30 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) (.cse59 (select .cse87 .cse6)) (.cse58 (* .cse60 4)) (.cse37 (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse29 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse67 (+ .cse22 1)) (.cse66 (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) 84)) (.cse86 (select .cse87 84)) (.cse0 (select |c_#length| |c_~#queue~0.base|))) (and (<= (+ 92 |c_~#queue~0.offset|) .cse0) (or (not (<= (+ 92 |c_ULTIMATE.start_init_~q#1.offset|) (select |c_#length| |c_ULTIMATE.start_init_~q#1.base|))) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse12 (+ 88 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((v_ArrVal_2701 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_2699 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse11 .cse12 v_ArrVal_2699)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2701))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2702 Int)) (let ((.cse9 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_2702))) (let ((.cse1 (select .cse9 .cse6))) (or (= .cse1 20) (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2704) .cse6 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (+ (* (select .cse7 .cse6) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse2)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse7 .cse2 v_ArrVal_2709))) (store (store .cse4 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse4 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) .cse0))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| (select .cse10 .cse6))))))) (forall ((v_ArrVal_2701 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int) (v_ArrVal_2699 Int)) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse11 .cse12 v_ArrVal_2699)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2701))) (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2702 Int)) (let ((.cse19 (store .cse20 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_~#queue~0.offset|) v_ArrVal_2702))) (let ((.cse13 (select .cse19 .cse6))) (or (= .cse13 20) (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse5 v_ArrVal_2704) .cse6 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (let ((.cse14 (+ (* (select .cse17 .cse6) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse14)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse15 |c_~#queue~0.base| (let ((.cse16 (store .cse17 .cse14 v_ArrVal_2709))) (store (store .cse16 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse16 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|)))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| (select .cse20 .cse6)))))))))) (<= 2 .cse21) (not (= 5 |c_ULTIMATE.start_main_~#id1~0#1.base|)) (<= |c_~#stored_elements~0.base| 4) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| .cse22)) (forall ((v_ArrVal_2702 Int)) (let ((.cse28 (store .cse31 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2702))) (let ((.cse23 (select .cse28 .cse30))) (or (= .cse23 20) (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse24 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse28 .cse29 v_ArrVal_2704) .cse30 (+ .cse23 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (let ((.cse27 (+ (* (select .cse26 .cse6) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse24 |c_~#queue~0.base| (let ((.cse25 (store .cse26 .cse27 v_ArrVal_2709))) (store (store .cse25 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse25 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse27))))))))))))) (let ((.cse32 (+ .cse35 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (not (<= 0 .cse32)) (and (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse33 (store .cse31 .cse32 v_ArrVal_2709))) (store (store .cse33 .cse29 v_ArrVal_2711) .cse30 (+ (select .cse33 .cse30) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6))) .cse0)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse34 (store .cse31 .cse32 v_ArrVal_2709))) (store (store .cse34 .cse29 v_ArrVal_2711) .cse30 (+ (select .cse34 .cse30) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6)))))))) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2716 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse36 |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4)) .cse0)) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= 2 .cse22) (<= 92 .cse37) (let ((.cse42 (+ (* .cse44 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (and (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse38 (store .cse41 .cse42 v_ArrVal_2709))) (store (store .cse38 .cse39 v_ArrVal_2711) .cse40 (+ (select .cse38 .cse40) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse43 (store .cse41 .cse42 v_ArrVal_2709))) (store (store .cse43 .cse39 v_ArrVal_2711) .cse40 (+ (select .cse43 .cse40) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) .cse0))) (not (<= 0 .cse42)))) (= |c_t2Thread1of1ForFork1_dequeue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 0) (= |c_~#stored_elements~0.base| 4) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| .cse44)) (forall ((v_ArrVal_2702 Int)) (let ((.cse49 (store .cse41 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2702))) (let ((.cse50 (select .cse49 .cse40))) (or (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse45 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse49 .cse39 v_ArrVal_2704) .cse40 (+ .cse50 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse47 (select .cse45 |c_~#queue~0.base|))) (let ((.cse48 (+ |c_~#queue~0.offset| (* (select .cse47 .cse6) 4)))) (or (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse45 |c_~#queue~0.base| (let ((.cse46 (store .cse47 .cse48 v_ArrVal_2709))) (store (store .cse46 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse46 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse48))))))) (= .cse50 20))))))) (<= 4 (* .cse51 4)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int)) (or (forall ((v_ArrVal_2702 Int)) (let ((.cse56 (store .cse31 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2702))) (let ((.cse57 (select .cse56 .cse30))) (or (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse53 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse56 .cse29 v_ArrVal_2704) .cse30 (+ .cse57 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse55 (select .cse53 |c_~#queue~0.base|))) (let ((.cse52 (+ (* (select .cse55 .cse6) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse52)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse53 |c_~#queue~0.base| (let ((.cse54 (store .cse55 .cse52 v_ArrVal_2709))) (store (store .cse54 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse54 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) .cse0))))))) (= .cse57 20))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| .cse22)))) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| 5) (= |c_~#queue~0.offset| 0) (<= 4 .cse58) (<= .cse59 2) (= |c_~#queue~0.offset| |c_ULTIMATE.start_init_#in~q#1.offset|) (= |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| |c_~#queue~0.offset|) (<= .cse51 2) (= 5 |c_~#queue~0.base|) (= (select |c_#valid| 5) 1) (= |c_ULTIMATE.start_init_~q#1.offset| |c_~#queue~0.offset|) (<= 2 .cse60) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|)) (forall ((v_ArrVal_2708 (Array Int Int))) (let ((.cse61 (store .cse65 |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse63 (select .cse61 |c_~#queue~0.base|))) (let ((.cse64 (+ |c_~#queue~0.offset| (* (select .cse63 .cse6) 4)))) (or (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse61 |c_~#queue~0.base| (let ((.cse62 (store .cse63 .cse64 v_ArrVal_2709))) (store (store .cse62 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse62 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) .cse0)) (not (<= 0 .cse64))))))) (= 5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= 2 .cse66) (exists ((|ULTIMATE.start_main_~#id2~0#1.base| Int)) (<= (select |c_#length| |ULTIMATE.start_main_~#id2~0#1.base|) 4)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse31 .cse29 v_ArrVal_2711) .cse30 .cse67)) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4)) .cse0)) (<= (+ (* .cse21 4) 84) .cse0) (<= (+ .cse35 84) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (= |c_t2Thread1of1ForFork1_dequeue_~q#1.base| |c_~#queue~0.base|) (= |c_t2Thread1of1ForFork1_dequeue_#in~q#1.offset| 0) (forall ((v_ArrVal_2708 (Array Int Int))) (let ((.cse68 (store .cse65 |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse70 (select .cse68 |c_~#queue~0.base|))) (let ((.cse71 (+ |c_~#queue~0.offset| (* (select .cse70 .cse6) 4)))) (or (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse68 |c_~#queue~0.base| (let ((.cse69 (store .cse70 .cse71 v_ArrVal_2709))) (store (store .cse69 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse69 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse71))))))) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|) (= |c_~#queue~0.base| |c_t2Thread1of1ForFork1_dequeue_#in~q#1.base|) (or (and (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse72 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse31 .cse29 v_ArrVal_2704) .cse30 .cse67)) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse74 (select .cse72 |c_~#queue~0.base|))) (let ((.cse75 (+ (* (select .cse74 .cse6) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store .cse72 |c_~#queue~0.base| (let ((.cse73 (store .cse74 .cse75 v_ArrVal_2709))) (store (store .cse73 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse73 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse75))))))) (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse76 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse31 .cse29 v_ArrVal_2704) .cse30 .cse67)) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse78 (select .cse76 |c_~#queue~0.base|))) (let ((.cse79 (+ (* (select .cse78 .cse6) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse76 |c_~#queue~0.base| (let ((.cse77 (store .cse78 .cse79 v_ArrVal_2709))) (store (store .cse77 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse77 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) .cse0)) (not (<= 0 .cse79)))))))) (= .cse22 20)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| Int)) (or (forall ((v_ArrVal_2702 Int)) (let ((.cse85 (store .cse41 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2702))) (let ((.cse80 (select .cse85 .cse40))) (or (= .cse80 20) (forall ((v_ArrVal_2708 (Array Int Int)) (v_ArrVal_2704 Int)) (let ((.cse82 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse85 .cse39 v_ArrVal_2704) .cse40 (+ .cse80 1))) |c_~#stored_elements~0.base| v_ArrVal_2708))) (let ((.cse84 (select .cse82 |c_~#queue~0.base|))) (let ((.cse81 (+ |c_~#queue~0.offset| (* (select .cse84 .cse6) 4)))) (or (not (<= 0 .cse81)) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= (+ (* (select (select (store (store (store .cse82 |c_~#queue~0.base| (let ((.cse83 (store .cse84 .cse81 v_ArrVal_2709))) (store (store .cse83 .cse5 v_ArrVal_2711) .cse6 (+ (select .cse83 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) .cse0))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_95| .cse44)))) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse36 |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4)))) (<= (select |c_#length| |c_ULTIMATE.start_main_~#id2~0#1.base|) 4) (<= 2 .cse86) (<= 4 (+ (* .cse59 4) |c_~#queue~0.offset|)) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_#in~q#1.base|) (<= 92 (select |c_#length| 5)) (<= (+ .cse58 84) .cse37) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2711 Int) (v_ArrVal_2716 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse31 .cse29 v_ArrVal_2711) .cse30 .cse67)) |c_~#stored_elements~0.base| v_ArrVal_2715) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2716) |c_~#queue~0.base|) .cse6) 4)))) (<= (+ (* 4 .cse66) 84) .cse0) (<= (+ 84 (* .cse86 4)) .cse0) (<= .cse60 2))))) is different from true [2022-12-13 09:39:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:39:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:39:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:39:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:39:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:39:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:39:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:39:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:39:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-12-13 09:39:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-12-13 09:39:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-13 09:39:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:39:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:39:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-13 09:39:20,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 09:39:20,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:39:20,289 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-12-13 09:39:20,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:39:20,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1316776162, now seen corresponding path program 1 times [2022-12-13 09:39:20,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:39:20,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839391782] [2022-12-13 09:39:20,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:39:20,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:39:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:39:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 87 proven. 257 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2022-12-13 09:39:32,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:39:32,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839391782] [2022-12-13 09:39:32,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839391782] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:39:32,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059705490] [2022-12-13 09:39:32,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:39:32,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:39:32,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:39:32,181 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:39:32,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01749605-5182-4008-bf86-913122bbf3ad/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 09:39:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:39:32,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 127 conjunts are in the unsatisfiable core [2022-12-13 09:39:32,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:39:32,795 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 09:39:32,795 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 09:39:32,900 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 09:39:33,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 09:39:33,598 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 09:39:33,599 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 13 [2022-12-13 09:39:33,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:39:35,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-13 09:39:36,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:39:36,333 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-12-13 09:39:36,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2022-12-13 09:39:36,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:39:36,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:39:36,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-12-13 09:39:37,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2022-12-13 09:39:37,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:39:37,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 09:39:39,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:39:39,680 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-12-13 09:39:39,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-12-13 09:39:40,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:39:40,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:39:40,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 09:39:41,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-12-13 09:39:41,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:39:41,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 09:39:44,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-13 09:39:46,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:39:46,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:39:46,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 09:39:46,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-12-13 09:39:48,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:39:48,276 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-12-13 09:39:48,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-12-13 09:39:48,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:39:48,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:39:48,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 09:39:48,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-12-13 09:39:49,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:39:49,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 09:39:49,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 09:39:49,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 09:39:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 87 proven. 257 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2022-12-13 09:39:50,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:39:50,708 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3024 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) is different from false [2022-12-13 09:41:26,496 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3012 (Array Int Int)) (v_ArrVal_3013 (Array Int Int)) (v_ArrVal_3019 Int) (v_ArrVal_3024 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (v_ArrVal_3017 Int) (v_ArrVal_3015 Int) (v_ArrVal_3023 Int) (v_ArrVal_3021 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3013))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 80))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| (select .cse0 .cse1))) (< (+ (select .cse0 .cse2) 1) v_ArrVal_3017) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (let ((.cse4 (+ 88 |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse4 v_ArrVal_3015) .cse2 v_ArrVal_3017) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_3019) .cse4 v_ArrVal_3021)) .cse1 v_ArrVal_3023)) |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) .cse2) 20))))) is different from false [2022-12-13 09:41:28,367 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3012 (Array Int Int)) (v_ArrVal_3008 Int) (v_ArrVal_3013 (Array Int Int)) (v_ArrVal_3019 Int) (v_ArrVal_3024 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (v_ArrVal_3017 Int) (v_ArrVal_3015 Int) (v_ArrVal_3023 Int) (v_ArrVal_3010 Int) (v_ArrVal_3021 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3008) .cse6 v_ArrVal_3010)) |c_~#stored_elements~0.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3013))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (let ((.cse2 (+ 88 |c_~#queue~0.offset|))) (store (store (store (store .cse1 .cse2 v_ArrVal_3015) .cse3 v_ArrVal_3017) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_3019) .cse2 v_ArrVal_3021)) .cse4 v_ArrVal_3023)) |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) .cse3) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| (select .cse1 .cse4))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_3017) (< (+ (select .cse5 .cse6) 1) v_ArrVal_3010)))))) is different from false [2022-12-13 09:41:28,545 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3007 Int) (v_ArrVal_3008 Int) (v_ArrVal_3019 Int) (v_ArrVal_3017 Int) (v_ArrVal_3015 Int) (v_ArrVal_3023 Int) (v_ArrVal_3010 Int) (v_ArrVal_3021 Int) (v_ArrVal_3012 (Array Int Int)) (v_ArrVal_3013 (Array Int Int)) (v_ArrVal_3024 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3007)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3008) .cse1 v_ArrVal_3010)) |c_~#stored_elements~0.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3013))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3010) (< (+ (select .cse2 .cse3) 1) v_ArrVal_3017) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| (select .cse2 .cse4))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (let ((.cse6 (+ 88 |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse6 v_ArrVal_3015) .cse3 v_ArrVal_3017) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_3019) .cse6 v_ArrVal_3021)) .cse4 v_ArrVal_3023)) |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) .cse3) 20)))))) is different from false [2022-12-13 09:41:28,658 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_3007 Int) (v_ArrVal_3008 Int) (v_ArrVal_3019 Int) (v_ArrVal_3017 Int) (v_ArrVal_3015 Int) (v_ArrVal_3023 Int) (v_ArrVal_3010 Int) (v_ArrVal_3021 Int) (v_ArrVal_3012 (Array Int Int)) (v_ArrVal_3013 (Array Int Int)) (v_ArrVal_3024 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int)) (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3007))) (let ((.cse2 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3008) .cse6 v_ArrVal_3010)) |c_~#stored_elements~0.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3013))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (let ((.cse3 (+ 88 |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 v_ArrVal_3015) .cse4 v_ArrVal_3017) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_3019) .cse3 v_ArrVal_3021)) .cse1 v_ArrVal_3023)) |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) .cse4) 20) (< (+ (select .cse5 .cse6) 1) v_ArrVal_3010) (< (+ (select .cse0 .cse4) 1) v_ArrVal_3017)))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| (select .cse7 .cse6)))))) is different from false [2022-12-13 09:41:42,834 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3007 Int) (v_ArrVal_3008 Int) (v_ArrVal_3019 Int) (v_ArrVal_3017 Int) (v_ArrVal_3015 Int) (v_ArrVal_3023 Int) (v_ArrVal_3010 Int) (v_ArrVal_3021 Int) (v_ArrVal_3012 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_3013 (Array Int Int)) (v_ArrVal_3024 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (v_ArrVal_3005 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3005))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_3007)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_3008) .cse1 v_ArrVal_3010)) |c_~#stored_elements~0.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3013))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_3010) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| (select .cse3 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_3017) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse6 v_ArrVal_3015) .cse4 v_ArrVal_3017) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_3019) .cse6 v_ArrVal_3021) .cse1 v_ArrVal_3023)) |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) .cse4) 20)))))))) is different from false [2022-12-13 09:41:43,203 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3007 Int) (v_ArrVal_3008 Int) (v_ArrVal_3019 Int) (v_ArrVal_3017 Int) (v_ArrVal_3004 Int) (v_ArrVal_3015 Int) (v_ArrVal_3023 Int) (v_ArrVal_3010 Int) (v_ArrVal_3021 Int) (v_ArrVal_3012 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_3013 (Array Int Int)) (v_ArrVal_3024 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (v_ArrVal_3005 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3004)) |c_~#stored_elements~0.base| v_ArrVal_3005))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_3007)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_3008) .cse4 v_ArrVal_3010)) |c_~#stored_elements~0.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3013))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store (store .cse1 .cse2 v_ArrVal_3015) .cse3 v_ArrVal_3017) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_3019) .cse2 v_ArrVal_3021) .cse4 v_ArrVal_3023)) |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) .cse3) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| (select .cse1 .cse4))) (< (+ (select .cse5 .cse4) 1) v_ArrVal_3010) (not (<= v_ArrVal_3004 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| (select .cse6 .cse4))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_3017)))))))) is different from false [2022-12-13 09:41:43,266 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3007 Int) (v_ArrVal_3008 Int) (v_ArrVal_3019 Int) (v_ArrVal_3017 Int) (v_ArrVal_3004 Int) (v_ArrVal_3015 Int) (v_ArrVal_3023 Int) (v_ArrVal_3010 Int) (v_ArrVal_3021 Int) (v_ArrVal_3012 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_3013 (Array Int Int)) (v_ArrVal_3024 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (v_ArrVal_3005 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3004)) |c_~#stored_elements~0.base| v_ArrVal_3005))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_3007)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_3008) .cse4 v_ArrVal_3010)) |c_~#stored_elements~0.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3013))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store (store .cse1 .cse2 v_ArrVal_3015) .cse3 v_ArrVal_3017) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_3019) .cse2 v_ArrVal_3021) .cse4 v_ArrVal_3023)) |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) .cse3) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| (select .cse1 .cse4))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_3004) (< (+ (select .cse5 .cse4) 1) v_ArrVal_3010) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| (select .cse6 .cse4))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_3017)))))))) is different from false [2022-12-13 09:41:43,333 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3007 Int) (v_ArrVal_3008 Int) (v_ArrVal_3019 Int) (v_ArrVal_3017 Int) (v_ArrVal_3004 Int) (v_ArrVal_3015 Int) (v_ArrVal_3023 Int) (v_ArrVal_3010 Int) (v_ArrVal_3021 Int) (v_ArrVal_3012 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_3013 (Array Int Int)) (v_ArrVal_3024 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (v_ArrVal_3005 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_3004)) |c_~#stored_elements~0.base| v_ArrVal_3005))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_3007)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_3008) .cse6 v_ArrVal_3010)) |c_~#stored_elements~0.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3013))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 80))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3004) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_3015) .cse5 v_ArrVal_3017) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_3019) .cse4 v_ArrVal_3021) .cse6 v_ArrVal_3023)) |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) .cse5) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| (select .cse3 .cse6))) (< (+ (select .cse7 .cse6) 1) v_ArrVal_3010) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| (select .cse8 .cse6))) (< (+ (select .cse3 .cse5) 1) v_ArrVal_3017))))))))) is different from false [2022-12-13 09:41:43,677 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3007 Int) (v_ArrVal_3008 Int) (v_ArrVal_3019 Int) (v_ArrVal_3017 Int) (v_ArrVal_3004 Int) (v_ArrVal_3015 Int) (v_ArrVal_3023 Int) (v_ArrVal_3002 Int) (v_ArrVal_3010 Int) (v_ArrVal_3021 Int) (v_ArrVal_3012 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_3013 (Array Int Int)) (v_ArrVal_3024 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (v_ArrVal_3005 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3002) .cse6 v_ArrVal_3004)) |c_~#stored_elements~0.base| v_ArrVal_3005))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_3007)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_3008) .cse4 v_ArrVal_3010)) |c_~#stored_elements~0.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3013))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 80))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store (store .cse1 .cse2 v_ArrVal_3015) .cse3 v_ArrVal_3017) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_3019) .cse2 v_ArrVal_3021) .cse4 v_ArrVal_3023)) |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse5 .cse6) 1) v_ArrVal_3004) (< (+ (select .cse7 .cse4) 1) v_ArrVal_3010) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| (select .cse1 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| (select .cse8 .cse4))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_3017))))))))) is different from false [2022-12-13 09:41:43,934 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3007 Int) (v_ArrVal_3008 Int) (v_ArrVal_3019 Int) (v_ArrVal_3017 Int) (v_ArrVal_3004 Int) (v_ArrVal_3015 Int) (v_ArrVal_3023 Int) (v_ArrVal_3002 Int) (v_ArrVal_3010 Int) (v_ArrVal_3021 Int) (v_ArrVal_3000 Int) (v_ArrVal_3012 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_3013 (Array Int Int)) (v_ArrVal_3024 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (v_ArrVal_3005 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3000)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3002) .cse4 v_ArrVal_3004)) |c_~#stored_elements~0.base| v_ArrVal_3005))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_3007)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_3008) .cse2 v_ArrVal_3010)) |c_~#stored_elements~0.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3013))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3017) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| (select .cse0 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_3004) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| (select .cse5 .cse2))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store (store .cse0 .cse7 v_ArrVal_3015) .cse1 v_ArrVal_3017) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_3019) .cse7 v_ArrVal_3021) .cse2 v_ArrVal_3023)) |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) .cse1) 20) (< (+ (select .cse8 .cse2) 1) v_ArrVal_3010))))))))) is different from false [2022-12-13 09:41:44,034 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_107| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_107| (select .cse0 .cse1))) (forall ((v_ArrVal_3007 Int) (v_ArrVal_3008 Int) (v_ArrVal_3019 Int) (v_ArrVal_3017 Int) (v_ArrVal_3004 Int) (v_ArrVal_3015 Int) (v_ArrVal_3023 Int) (v_ArrVal_3002 Int) (v_ArrVal_3010 Int) (v_ArrVal_3021 Int) (v_ArrVal_3000 Int) (v_ArrVal_3012 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_3013 (Array Int Int)) (v_ArrVal_3024 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (v_ArrVal_3005 (Array Int Int))) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_107| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3000))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_3002) .cse1 v_ArrVal_3004)) |c_~#stored_elements~0.base| v_ArrVal_3005))) (let ((.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_3007)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (store (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_3008) .cse3 v_ArrVal_3010)) |c_~#stored_elements~0.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3013))) (let ((.cse5 (select .cse4 |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 80))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store (store .cse5 .cse6 v_ArrVal_3015) .cse7 v_ArrVal_3017) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_3019) .cse6 v_ArrVal_3021) .cse3 v_ArrVal_3023)) |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) .cse7) 20) (< (+ (select .cse8 .cse1) 1) v_ArrVal_3004) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| (select .cse5 .cse3))) (< (+ (select .cse9 .cse3) 1) v_ArrVal_3010) (< (+ (select .cse5 .cse7) 1) v_ArrVal_3017)))))))))))) is different from false [2022-12-13 09:41:44,193 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3007 Int) (v_ArrVal_3008 Int) (v_ArrVal_3019 Int) (v_ArrVal_3017 Int) (v_ArrVal_3004 Int) (v_ArrVal_3015 Int) (v_ArrVal_3023 Int) (v_ArrVal_3002 Int) (v_ArrVal_3010 Int) (v_ArrVal_3021 Int) (v_ArrVal_3000 Int) (v_ArrVal_3012 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_3013 (Array Int Int)) (v_ArrVal_3024 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_107| Int) (v_ArrVal_3005 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_107| 4)) v_ArrVal_3000)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_3002) .cse5 v_ArrVal_3004)) |c_~#stored_elements~0.base| v_ArrVal_3005))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_3007)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (store (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_3008) .cse3 v_ArrVal_3010)) |c_~#stored_elements~0.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3013))) (let ((.cse1 (+ |c_~#queue~0.offset| 80)) (.cse0 (select .cse6 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3017) (< (+ (select .cse2 .cse3) 1) v_ArrVal_3010) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_107| (select .cse4 .cse5))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store (store .cse0 .cse7 v_ArrVal_3015) .cse1 v_ArrVal_3017) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_3019) .cse7 v_ArrVal_3021) .cse3 v_ArrVal_3023)) |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| (select .cse0 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| (select .cse8 .cse3))) (< (+ (select .cse9 .cse5) 1) v_ArrVal_3004)))))))))) is different from false [2022-12-13 09:41:56,023 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_3007 Int) (v_ArrVal_3008 Int) (v_ArrVal_3019 Int) (v_ArrVal_3017 Int) (v_ArrVal_3004 Int) (v_ArrVal_3015 Int) (v_ArrVal_3023 Int) (v_ArrVal_3002 Int) (v_ArrVal_3010 Int) (v_ArrVal_3021 Int) (v_ArrVal_3000 Int) (v_ArrVal_3012 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| Int) (v_ArrVal_3013 (Array Int Int)) (v_ArrVal_3024 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_107| Int) (v_ArrVal_3005 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2998))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_107| 4)) v_ArrVal_3000)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_3002) .cse1 v_ArrVal_3004)) |c_~#stored_elements~0.base| v_ArrVal_3005))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| 4) |c_~#queue~0.offset|) v_ArrVal_3007))) (let ((.cse4 (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_3008) .cse1 v_ArrVal_3010)) |c_~#stored_elements~0.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3013))) (let ((.cse3 (+ |c_~#queue~0.offset| 80)) (.cse2 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_107| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_3017) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store (store .cse2 .cse5 v_ArrVal_3015) .cse3 v_ArrVal_3017) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| 4) |c_~#queue~0.offset|) v_ArrVal_3019) .cse5 v_ArrVal_3021) .cse1 v_ArrVal_3023)) |c_~#stored_elements~0.base| v_ArrVal_3024) |c_~#queue~0.base|) .cse3) 20) (< (+ (select .cse6 .cse1) 1) v_ArrVal_3004) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_104| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_101| (select .cse2 .cse1))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_3010))))))))))) is different from false [2022-12-13 09:42:00,344 INFO L321 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2022-12-13 09:42:00,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1535 treesize of output 1193 [2022-12-13 09:42:00,463 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:42:00,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2799 treesize of output 2747 [2022-12-13 09:42:00,523 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 0 case distinctions, treesize of input 1071 treesize of output 1055 [2022-12-13 09:42:00,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1070 treesize of output 990 [2022-12-13 09:42:00,620 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 0 case distinctions, treesize of input 1793 treesize of output 1713 [2022-12-13 09:42:00,662 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 0 case distinctions, treesize of input 1693 treesize of output 1653 [2022-12-13 09:42:00,707 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 0 case distinctions, treesize of input 1561 treesize of output 1537 [2022-12-13 09:42:02,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 09:42:02,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:42:02,865 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 716 treesize of output 706 [2022-12-13 09:42:06,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-12-13 09:42:07,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:42:07,120 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 37 treesize of output 77 [2022-12-13 09:42:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1384 backedges. 87 proven. 177 refuted. 65 times theorem prover too weak. 1040 trivial. 15 not checked. [2022-12-13 09:42:07,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059705490] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:42:07,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:42:07,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 44, 52] total 139 [2022-12-13 09:42:07,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768670054] [2022-12-13 09:42:07,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:42:07,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-12-13 09:42:07,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:42:07,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-12-13 09:42:07,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1475, Invalid=13873, Unknown=208, NotChecked=3626, Total=19182 [2022-12-13 09:42:07,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:42:07,607 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:42:07,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 6.057553956834532) internal successors, (842), 139 states have internal predecessors, (842), 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 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-12-13 09:42:07,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:43:35,333 WARN L233 SmtUtils]: Spent 56.66s on a formula simplification. DAG size of input: 437 DAG size of output: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:44:13,943 WARN L233 SmtUtils]: Spent 38.10s on a formula simplification. DAG size of input: 435 DAG size of output: 127 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:44:20,115 WARN L233 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 430 DAG size of output: 246 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)