./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/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_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/config/GemCutterMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/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_c219ead7-2fbf-4b1e-ad96-a2e5654437de/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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- 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:10:48,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:10:48,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:10:48,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:10:48,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:10:48,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:10:48,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:10:48,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:10:48,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:10:48,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:10:48,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:10:48,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:10:48,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:10:48,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:10:48,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:10:48,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:10:48,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:10:48,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:10:48,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:10:48,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:10:48,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:10:48,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:10:48,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:10:48,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:10:48,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:10:48,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:10:48,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:10:48,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:10:48,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:10:48,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:10:48,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:10:48,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:10:48,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:10:48,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:10:48,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:10:48,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:10:48,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:10:48,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:10:48,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:10:48,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:10:48,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:10:48,741 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2022-12-13 09:10:48,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:10:48,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:10:48,769 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 09:10:48,769 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 09:10:48,769 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 09:10:48,770 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 09:10:48,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:10:48,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:10:48,771 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:10:48,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:10:48,776 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:10:48,776 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 09:10:48,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:10:48,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:10:48,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:10:48,777 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 09:10:48,777 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 09:10:48,777 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 09:10:48,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:10:48,778 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 09:10:48,778 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:10:48,778 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:10:48,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:10:48,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:10:48,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:10:48,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:10:48,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:10:48,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:10:48,779 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:10:48,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:10:48,779 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-13 09:10:48,779 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-12-13 09:10:48,780 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-12-13 09:10:48,780 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-12-13 09:10:48,780 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-12-13 09:10:48,780 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_c219ead7-2fbf-4b1e-ad96-a2e5654437de/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_c219ead7-2fbf-4b1e-ad96-a2e5654437de/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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-12-13 09:10:48,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:10:48,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:10:48,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:10:48,984 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:10:48,984 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:10:48,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-12-13 09:10:51,640 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:10:51,881 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:10:51,881 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-12-13 09:10:51,893 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/data/e8a0df952/5b4b0e690f6b49128b30ebc54f837c4d/FLAGb2c2eda09 [2022-12-13 09:10:51,907 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/data/e8a0df952/5b4b0e690f6b49128b30ebc54f837c4d [2022-12-13 09:10:51,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:10:51,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 09:10:51,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:10:51,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:10:51,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:10:51,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:10:51" (1/1) ... [2022-12-13 09:10:51,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ac898a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:51, skipping insertion in model container [2022-12-13 09:10:51,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:10:51" (1/1) ... [2022-12-13 09:10:51,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:10:51,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:10:52,256 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_c219ead7-2fbf-4b1e-ad96-a2e5654437de/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-12-13 09:10:52,260 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_c219ead7-2fbf-4b1e-ad96-a2e5654437de/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-12-13 09:10:52,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:10:52,271 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:10:52,303 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_c219ead7-2fbf-4b1e-ad96-a2e5654437de/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-12-13 09:10:52,305 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_c219ead7-2fbf-4b1e-ad96-a2e5654437de/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-12-13 09:10:52,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:10:52,339 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:10:52,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:52 WrapperNode [2022-12-13 09:10:52,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:10:52,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:10:52,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:10:52,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:10:52,345 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:10:52" (1/1) ... [2022-12-13 09:10:52,356 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:10:52" (1/1) ... [2022-12-13 09:10:52,374 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-13 09:10:52,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:10:52,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:10:52,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:10:52,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:10:52,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:52" (1/1) ... [2022-12-13 09:10:52,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:52" (1/1) ... [2022-12-13 09:10:52,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:52" (1/1) ... [2022-12-13 09:10:52,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:52" (1/1) ... [2022-12-13 09:10:52,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:52" (1/1) ... [2022-12-13 09:10:52,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:52" (1/1) ... [2022-12-13 09:10:52,394 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:52" (1/1) ... [2022-12-13 09:10:52,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:52" (1/1) ... [2022-12-13 09:10:52,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:10:52,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:10:52,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:10:52,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:10:52,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:52" (1/1) ... [2022-12-13 09:10:52,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:10:52,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:10:52,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:10:52,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:10:52,455 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 09:10:52,456 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 09:10:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 09:10:52,456 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 09:10:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:10:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:10:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 09:10:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:10:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 09:10:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:10:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:10:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:10:52,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:10:52,459 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:10:52,569 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 09:10:52,571 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:10:52,942 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 09:10:52,950 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:10:52,950 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 09:10:52,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:10:52 BoogieIcfgContainer [2022-12-13 09:10:52,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:10:52,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:10:52,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:10:52,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:10:52,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:10:51" (1/3) ... [2022-12-13 09:10:52,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603e51d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:10:52, skipping insertion in model container [2022-12-13 09:10:52,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:10:52" (2/3) ... [2022-12-13 09:10:52,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603e51d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:10:52, skipping insertion in model container [2022-12-13 09:10:52,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:10:52" (3/3) ... [2022-12-13 09:10:52,958 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-12-13 09:10:52,972 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:10:52,973 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-12-13 09:10:52,973 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:10:53,079 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 09:10:53,115 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:10:53,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-12-13 09:10:53,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:10:53,117 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-12-13 09:10:53,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-12-13 09:10:53,150 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-12-13 09:10:53,159 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2022-12-13 09:10:53,164 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;@4ed5970f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:10:53,164 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-12-13 09:10:53,462 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:10:53,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:10:53,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1604496347, now seen corresponding path program 1 times [2022-12-13 09:10:53,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:10:53,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709135346] [2022-12-13 09:10:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:10:53,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:10:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:10:53,646 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:10:53,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:10:53,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709135346] [2022-12-13 09:10:53,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709135346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:10:53,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:10:53,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:10:53,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000674157] [2022-12-13 09:10:53,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:10:53,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 09:10:53,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:10:53,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 09:10:53,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 09:10:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:53,675 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:10:53,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 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:10:53,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:53,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:53,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:10:53,719 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:10:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:10:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1668741918, now seen corresponding path program 1 times [2022-12-13 09:10:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:10:53,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603953263] [2022-12-13 09:10:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:10:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:10:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:10:55,111 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:10:55,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:10:55,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603953263] [2022-12-13 09:10:55,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603953263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:10:55,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:10:55,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-13 09:10:55,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603205794] [2022-12-13 09:10:55,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:10:55,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 09:10:55,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:10:55,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 09:10:55,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-12-13 09:10:55,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:55,116 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:10:55,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 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:10:55,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:55,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:10:56,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:10:56,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:10:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:10:56,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1434799636, now seen corresponding path program 1 times [2022-12-13 09:10:56,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:10:56,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912136336] [2022-12-13 09:10:56,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:10:56,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:10:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:10:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 09:10:56,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:10:56,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912136336] [2022-12-13 09:10:56,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912136336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:10:56,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:10:56,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:10:56,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409451937] [2022-12-13 09:10:56,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:10:56,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:10:56,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:10:56,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:10:56,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:10:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:56,297 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:10:56,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 58.0) internal successors, (116), 3 states have internal predecessors, (116), 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:10:56,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:56,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:10:56,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:10:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:56,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:10:56,431 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:10:56,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:10:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1434799637, now seen corresponding path program 1 times [2022-12-13 09:10:56,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:10:56,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354459367] [2022-12-13 09:10:56,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:10:56,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:10:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:10:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 09:10:56,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:10:56,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354459367] [2022-12-13 09:10:56,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354459367] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:10:56,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559688503] [2022-12-13 09:10:56,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:10:56,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:10:56,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:10:56,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:10:56,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 09:10:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:10:56,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:10:56,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:10:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 09:10:56,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 09:10:56,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559688503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:10:56,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 09:10:56,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-12-13 09:10:56,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670938113] [2022-12-13 09:10:56,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:10:56,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:10:56,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:10:56,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:10:56,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:10:56,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:56,751 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:10:56,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 58.0) internal successors, (116), 3 states have internal predecessors, (116), 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:10:56,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:56,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:10:56,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:56,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:10:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:57,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 09:10:57,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:10:57,458 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:10:57,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:10:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash -583036108, now seen corresponding path program 1 times [2022-12-13 09:10:57,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:10:57,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045335021] [2022-12-13 09:10:57,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:10:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:10:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:10:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-12-13 09:10:57,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:10:57,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045335021] [2022-12-13 09:10:57,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045335021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:10:57,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:10:57,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:10:57,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354433123] [2022-12-13 09:10:57,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:10:57,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:10:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:10:57,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:10:57,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:10:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:57,793 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:10:57,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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:10:57,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:57,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:10:57,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:57,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:57,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:57,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:57,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:10:57,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:57,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:57,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:10:57,853 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:10:57,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:10:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1407361867, now seen corresponding path program 1 times [2022-12-13 09:10:57,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:10:57,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484782592] [2022-12-13 09:10:57,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:10:57,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:10:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:10:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 09:10:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:10:58,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484782592] [2022-12-13 09:10:58,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484782592] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:10:58,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915746634] [2022-12-13 09:10:58,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:10:58,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:10:58,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:10:58,011 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:10:58,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 09:10:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:10:58,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 09:10:58,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:10:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-12-13 09:10:58,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 09:10:58,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915746634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:10:58,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 09:10:58,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-12-13 09:10:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995224644] [2022-12-13 09:10:58,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:10:58,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:10:58,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:10:58,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:10:58,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:10:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:58,138 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:10:58,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 57.5) internal successors, (115), 3 states have internal predecessors, (115), 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:10:58,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:58,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:10:58,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:58,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:58,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:58,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:10:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:58,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 09:10:58,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 09:10:58,416 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:10:58,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:10:58,417 INFO L85 PathProgramCache]: Analyzing trace with hash 586938666, now seen corresponding path program 1 times [2022-12-13 09:10:58,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:10:58,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797971550] [2022-12-13 09:10:58,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:10:58,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:10:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:10:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 09:10:58,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:10:58,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797971550] [2022-12-13 09:10:58,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797971550] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:10:58,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887661520] [2022-12-13 09:10:58,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:10:58,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:10:58,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:10:58,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:10:58,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 09:10:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:10:58,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 09:10:58,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:10:59,381 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 09:10:59,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:10:59,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:10:59,848 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:10:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 09:10:59,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887661520] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:10:59,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:10:59,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2022-12-13 09:10:59,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136210293] [2022-12-13 09:10:59,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:10:59,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 09:10:59,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:10:59,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 09:10:59,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-12-13 09:10:59,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:59,945 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:10:59,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 14.681818181818182) internal successors, (323), 23 states have internal predecessors, (323), 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:10:59,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:10:59,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:10:59,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:59,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:59,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:59,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:10:59,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:00,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 09:11:00,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:11:00,584 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:11:00,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:11:00,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1189436233, now seen corresponding path program 1 times [2022-12-13 09:11:00,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:11:00,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118536174] [2022-12-13 09:11:00,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:11:00,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:11:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:11:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 09:11:01,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:11:01,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118536174] [2022-12-13 09:11:01,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118536174] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:11:01,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803068408] [2022-12-13 09:11:01,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:11:01,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:11:01,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:11:01,336 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:11:01,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 09:11:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:11:01,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 09:11:01,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:11:02,275 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:11:02,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:11:02,337 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:11:02,464 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 19 treesize of output 7 [2022-12-13 09:11:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 09:11:02,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:11:02,620 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_437 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_437) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_437 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_437) |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:11:02,660 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:02,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-13 09:11:02,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:02,669 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 44 treesize of output 43 [2022-12-13 09:11:02,683 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 11 treesize of output 7 [2022-12-13 09:11:02,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:02,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-13 09:11:02,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:11:02,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:11:02,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-13 09:11:03,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:03,178 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 26 treesize of output 30 [2022-12-13 09:11:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 6 not checked. [2022-12-13 09:11:03,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803068408] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:11:03,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:11:03,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2022-12-13 09:11:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404408887] [2022-12-13 09:11:03,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:11:03,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 09:11:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:11:03,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 09:11:03,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1244, Unknown=1, NotChecked=72, Total=1482 [2022-12-13 09:11:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:03,337 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:11:03,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 10.68421052631579) internal successors, (406), 39 states have internal predecessors, (406), 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:11:03,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:03,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:03,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:03,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:03,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:03,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:03,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:03,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:11:04,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 09:11:04,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:11:04,970 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:11:04,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:11:04,971 INFO L85 PathProgramCache]: Analyzing trace with hash -237801014, now seen corresponding path program 2 times [2022-12-13 09:11:04,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:11:04,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736488805] [2022-12-13 09:11:04,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:11:04,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:11:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:11:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 160 proven. 43 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 09:11:06,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:11:06,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736488805] [2022-12-13 09:11:06,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736488805] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:11:06,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75616101] [2022-12-13 09:11:06,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 09:11:06,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:11:06,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:11:06,153 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:11:06,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 09:11:06,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 09:11:06,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 09:11:06,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 09:11:06,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:11:06,729 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:11:06,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:11:06,775 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:11:06,891 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:11:06,891 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:11:06,920 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:11:06,930 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:11:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 160 proven. 43 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-13 09:11:06,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:11:07,175 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_546 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_544) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) v_ArrVal_546) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| (select .cse0 .cse1)))))) is different from false [2022-12-13 09:11:07,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:07,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2022-12-13 09:11:07,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:07,224 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 81 treesize of output 83 [2022-12-13 09:11:07,229 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 78 treesize of output 70 [2022-12-13 09:11:07,236 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:11:07,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:07,277 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 52 treesize of output 48 [2022-12-13 09:11:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 154 proven. 43 refuted. 0 times theorem prover too weak. 27 trivial. 6 not checked. [2022-12-13 09:11:07,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75616101] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:11:07,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:11:07,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 37 [2022-12-13 09:11:07,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814618061] [2022-12-13 09:11:07,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:11:07,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-13 09:11:07,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:11:07,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-13 09:11:07,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1107, Unknown=1, NotChecked=68, Total=1332 [2022-12-13 09:11:07,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:07,496 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:11:07,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 12.378378378378379) internal successors, (458), 37 states have internal predecessors, (458), 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:11:07,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:07,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:07,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:07,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:07,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:07,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:07,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:07,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:11:07,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:11:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:11:08,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 09:11:08,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:11:08,669 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:11:08,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:11:08,670 INFO L85 PathProgramCache]: Analyzing trace with hash 423876573, now seen corresponding path program 1 times [2022-12-13 09:11:08,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:11:08,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941543711] [2022-12-13 09:11:08,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:11:08,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:11:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:11:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-12-13 09:11:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:11:08,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941543711] [2022-12-13 09:11:08,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941543711] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:11:08,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102634778] [2022-12-13 09:11:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:11:08,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:11:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:11:08,859 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:11:08,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 09:11:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:11:08,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 09:11:08,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:11:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-12-13 09:11:09,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:11:09,544 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 09:11:09,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 09:11:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-12-13 09:11:09,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102634778] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:11:09,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:11:09,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-12-13 09:11:09,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303648641] [2022-12-13 09:11:09,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:11:09,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 09:11:09,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:11:09,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 09:11:09,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-13 09:11:09,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:09,553 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:11:09,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 16.846153846153847) internal successors, (219), 14 states have internal predecessors, (219), 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:11:09,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:09,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:09,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:09,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:09,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:09,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:09,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:09,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:11:09,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:11:09,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:09,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:09,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:09,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:11:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:11:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:11:09,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 09:11:09,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 09:11:09,897 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:11:09,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:11:09,898 INFO L85 PathProgramCache]: Analyzing trace with hash 753619954, now seen corresponding path program 1 times [2022-12-13 09:11:09,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:11:09,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405090236] [2022-12-13 09:11:09,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:11:09,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:11:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:11:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-13 09:11:09,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:11:09,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405090236] [2022-12-13 09:11:09,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405090236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:11:09,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:11:09,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:11:09,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801225304] [2022-12-13 09:11:09,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:11:09,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:11:09,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:11:09,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:11:09,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:11:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:09,988 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:11:09,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 72.5) internal successors, (145), 3 states have internal predecessors, (145), 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:11:09,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:09,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:09,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:09,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:09,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:09,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:09,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:09,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:11:09,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:11:09,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:11:09,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:11:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:11:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:11:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:10,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:11:10,045 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:11:10,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:11:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash -187764115, now seen corresponding path program 1 times [2022-12-13 09:11:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:11:10,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628003390] [2022-12-13 09:11:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:11:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:11:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:11:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 61 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 09:11:11,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:11:11,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628003390] [2022-12-13 09:11:11,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628003390] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:11:11,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909833395] [2022-12-13 09:11:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:11:11,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:11:11,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:11:11,474 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:11:11,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 09:11:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:11:11,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 09:11:11,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:11:11,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:11:11,693 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:11:11,705 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 09:11:11,705 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:11:11,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:11:11,718 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:11:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:11:12,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:11:12,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:12,962 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:11:12,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:12,975 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:11:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:11:13,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909833395] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:11:13,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:11:13,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 9, 9] total 42 [2022-12-13 09:11:13,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795796104] [2022-12-13 09:11:13,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:11:13,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-13 09:11:13,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:11:13,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-13 09:11:13,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1527, Unknown=0, NotChecked=0, Total=1722 [2022-12-13 09:11:13,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:13,046 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:11:13,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 11.095238095238095) internal successors, (466), 42 states have internal predecessors, (466), 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:11:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:13,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:11:13,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:11:13,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:11:13,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:13,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:11:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:11:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:11:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 09:11:15,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 09:11:15,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:11:15,562 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:11:15,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:11:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash 955656561, now seen corresponding path program 2 times [2022-12-13 09:11:15,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:11:15,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812096685] [2022-12-13 09:11:15,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:11:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:11:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:11:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 350 proven. 131 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-12-13 09:11:17,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:11:17,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812096685] [2022-12-13 09:11:17,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812096685] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:11:17,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637656847] [2022-12-13 09:11:17,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 09:11:17,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:11:17,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:11:17,904 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:11:17,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 09:11:18,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 09:11:18,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 09:11:18,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 09:11:18,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:11:18,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:11:18,173 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:11:18,185 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 09:11:18,185 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:11:18,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:11:18,196 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:11:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:11:19,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 09:11:19,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637656847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:11:19,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 09:11:19,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [20] total 37 [2022-12-13 09:11:19,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366849379] [2022-12-13 09:11:19,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:11:19,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 09:11:19,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:11:19,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 09:11:19,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 09:11:19,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:19,409 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:11:19,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 16.61111111111111) internal successors, (299), 19 states have internal predecessors, (299), 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:11:19,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:19,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:19,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:19,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:19,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:19,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:19,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:19,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:11:19,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:11:19,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:11:19,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:19,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-12-13 09:11:19,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:11:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:11:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:11:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:20,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 09:11:20,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:11:20,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 09:11:20,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 09:11:20,240 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:11:20,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:11:20,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1302616781, now seen corresponding path program 3 times [2022-12-13 09:11:20,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:11:20,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265642076] [2022-12-13 09:11:20,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:11:20,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:11:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:11:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 638 proven. 99 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-12-13 09:11:22,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:11:22,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265642076] [2022-12-13 09:11:22,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265642076] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:11:22,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959854322] [2022-12-13 09:11:22,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 09:11:22,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:11:22,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:11:22,135 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:11:22,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 09:11:22,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 09:11:22,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 09:11:22,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 09:11:22,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:11:22,467 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 09:11:22,467 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:11:22,478 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 09:11:22,479 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:11:23,975 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:11:24,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:11:24,061 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:11:24,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:11:24,364 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 09:11:24,364 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:11:24,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:11:24,435 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:11:24,653 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:11:24,768 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:11:24,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:11:24,803 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:11:24,935 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 19 treesize of output 7 [2022-12-13 09:11:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 336 proven. 129 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2022-12-13 09:11:24,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:11:25,002 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 39 treesize of output 35 [2022-12-13 09:11:25,092 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1112 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1112) |c_~#queue~0.base|) .cse0) 4) 3205)) (forall ((v_ArrVal_1112 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1112) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-12-13 09:11:44,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:44,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 87 [2022-12-13 09:11:44,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:44,205 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 281 treesize of output 281 [2022-12-13 09:11:44,214 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 116 treesize of output 108 [2022-12-13 09:11:44,220 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 247 treesize of output 223 [2022-12-13 09:11:44,227 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 223 treesize of output 211 [2022-12-13 09:11:44,244 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:11:44,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:44,331 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 58 treesize of output 54 [2022-12-13 09:11:44,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:44,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 89 [2022-12-13 09:11:44,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:11:44,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:11:44,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-12-13 09:11:44,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:11:44,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2022-12-13 09:11:46,264 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:11:46,264 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:11:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 88 proven. 365 refuted. 5 times theorem prover too weak. 509 trivial. 7 not checked. [2022-12-13 09:11:46,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959854322] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:11:46,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:11:46,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 22] total 58 [2022-12-13 09:11:46,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026807570] [2022-12-13 09:11:46,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:11:46,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-12-13 09:11:46,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:11:46,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-12-13 09:11:46,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=2722, Unknown=103, NotChecked=110, Total=3306 [2022-12-13 09:11:46,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:46,546 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:11:46,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 9.758620689655173) internal successors, (566), 58 states have internal predecessors, (566), 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:11:46,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:46,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:46,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:46,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:46,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:46,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:46,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:46,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:11:46,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:11:46,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:11:46,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:46,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-12-13 09:11:46,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:11:46,547 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:11:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:11:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:11:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:11:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:11:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:11:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:11:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 09:11:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:11:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 09:11:59,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 09:12:00,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:12:00,154 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:12:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:12:00,156 INFO L85 PathProgramCache]: Analyzing trace with hash -787585431, now seen corresponding path program 4 times [2022-12-13 09:12:00,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:12:00,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269234697] [2022-12-13 09:12:00,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:12:00,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:12:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:12:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1503 proven. 107 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2022-12-13 09:12:05,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:12:05,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269234697] [2022-12-13 09:12:05,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269234697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:12:05,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920295293] [2022-12-13 09:12:05,584 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 09:12:05,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:12:05,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:12:05,585 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:12:05,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 09:12:06,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 09:12:06,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 09:12:06,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 1438 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-13 09:12:06,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:12:07,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 09:12:07,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:12:07,726 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:12:07,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:12:08,006 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 09:12:08,006 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:12:08,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:12:08,052 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:12:08,243 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:12:08,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:12:08,332 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:12:08,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:12:08,618 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 09:12:08,618 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:12:08,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:12:08,670 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:12:08,879 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:12:08,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:12:08,966 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:12:09,143 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:12:09,143 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:12:09,182 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:12:09,191 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:12:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1454 proven. 159 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2022-12-13 09:12:09,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:12:09,935 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1362 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| Int) (v_ArrVal_1357 Int) (v_ArrVal_1361 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1357) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1361) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse0 .cse1)))))) is different from false [2022-12-13 09:12:09,987 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1362 Int) (v_ArrVal_1356 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| Int) (v_ArrVal_1357 Int) (v_ArrVal_1361 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1356)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1357) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1361) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse1) 800))))) is different from false [2022-12-13 09:12:10,014 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| (select .cse0 .cse1))) (forall ((v_ArrVal_1362 Int) (v_ArrVal_1356 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| Int) (v_ArrVal_1357 Int) (v_ArrVal_1361 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1356))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1357) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1361) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse2 .cse3))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse3) 800)))))))) is different from false [2022-12-13 09:12:10,054 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| Int) (v_ArrVal_1362 Int) (v_ArrVal_1356 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| Int) (v_ArrVal_1357 Int) (v_ArrVal_1361 (Array Int Int))) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| 4)) v_ArrVal_1356))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1357) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1361) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse0 .cse1))))))) is different from false [2022-12-13 09:12:13,130 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| Int) (v_ArrVal_1362 Int) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| Int) (v_ArrVal_1357 Int) (v_ArrVal_1361 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1350) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1354))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| 4) |c_~#queue~0.offset|) v_ArrVal_1356))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1357) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1361) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| (select .cse2 .cse1)))))))) is different from false [2022-12-13 09:12:13,225 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| Int) (v_ArrVal_1362 Int) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| Int) (v_ArrVal_1357 Int) (v_ArrVal_1361 (Array Int Int)) (v_ArrVal_1348 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1348)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1350) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1354))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| 4) |c_~#queue~0.offset|) v_ArrVal_1356))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1357) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1361) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| (select .cse2 .cse1)))))))) is different from false [2022-12-13 09:12:13,262 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_125| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_125| (select .cse0 .cse1))) (forall ((v_ArrVal_1350 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| Int) (v_ArrVal_1362 Int) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| Int) (v_ArrVal_1357 Int) (v_ArrVal_1361 (Array Int Int)) (v_ArrVal_1348 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_125| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1348))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1350) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1354))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| 4) |c_~#queue~0.offset|) v_ArrVal_1356))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1357) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1361) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| (select .cse4 .cse3))) (not (= 800 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse3))))))))))) is different from false [2022-12-13 09:12:13,329 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_125| Int) (v_ArrVal_1362 Int) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| Int) (v_ArrVal_1357 Int) (v_ArrVal_1361 (Array Int Int)) (v_ArrVal_1348 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse7 (store .cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_125| 4)) v_ArrVal_1348))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1350) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1354))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| 4) |c_~#queue~0.offset|) v_ArrVal_1356))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1357) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1361) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_125| (select .cse0 .cse1))) (not (= 800 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse2 .cse3))))))))) is different from false [2022-12-13 09:12:13,845 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1350 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| Int) (v_ArrVal_1347 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_125| Int) (v_ArrVal_1362 Int) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| Int) (v_ArrVal_1357 Int) (v_ArrVal_1361 (Array Int Int)) (v_ArrVal_1348 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1347))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_125| 4)) v_ArrVal_1348))) (store (store .cse8 .cse6 v_ArrVal_1350) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1354))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| 4) |c_~#queue~0.offset|) v_ArrVal_1356))) (store (store .cse5 .cse6 v_ArrVal_1357) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1361) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_125| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse0 .cse1)))))))))) is different from false [2022-12-13 09:12:13,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:12:13,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 694 treesize of output 484 [2022-12-13 09:12:14,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:12:14,016 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 793 treesize of output 783 [2022-12-13 09:12:14,027 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 740 treesize of output 724 [2022-12-13 09:12:14,040 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 657 treesize of output 625 [2022-12-13 09:12:14,054 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 738 treesize of output 714 [2022-12-13 09:12:14,079 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:12:14,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:12:14,226 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 198 treesize of output 186 [2022-12-13 09:12:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1371 proven. 115 refuted. 10 times theorem prover too weak. 670 trivial. 114 not checked. [2022-12-13 09:12:14,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920295293] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:12:14,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:12:14,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 31] total 79 [2022-12-13 09:12:14,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701366993] [2022-12-13 09:12:14,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:12:14,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-12-13 09:12:14,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:12:14,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-12-13 09:12:14,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=4089, Unknown=58, NotChecked=1296, Total=6162 [2022-12-13 09:12:14,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:12:14,786 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:12:14,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 8.518987341772151) internal successors, (673), 79 states have internal predecessors, (673), 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:12:14,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-12-13 09:12:14,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:12:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:12:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:12:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:12:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:12:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:12:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:12:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:12:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:12:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:12:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:12:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:12:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 09:12:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:12:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 09:12:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-13 09:12:28,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 09:12:28,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:12:28,843 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:12:28,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:12:28,844 INFO L85 PathProgramCache]: Analyzing trace with hash 818829600, now seen corresponding path program 5 times [2022-12-13 09:12:28,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:12:28,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420623328] [2022-12-13 09:12:28,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:12:28,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:12:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:12:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 1290 proven. 75 refuted. 0 times theorem prover too weak. 3335 trivial. 0 not checked. [2022-12-13 09:12:36,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:12:36,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420623328] [2022-12-13 09:12:36,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420623328] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:12:36,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501776480] [2022-12-13 09:12:36,594 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 09:12:36,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:12:36,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:12:36,595 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:12:36,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 09:15:01,118 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-12-13 09:15:01,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 09:15:01,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 1943 conjuncts, 146 conjunts are in the unsatisfiable core [2022-12-13 09:15:01,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:15:01,742 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:15:01,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:15:01,797 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:15:01,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:15:02,008 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 09:15:02,008 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:15:02,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:15:02,049 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:15:02,264 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:15:02,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:15:02,334 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:15:02,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:15:02,560 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:15:02,560 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 31 treesize of output 27 [2022-12-13 09:15:02,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:15:02,606 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:15:02,779 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 34 treesize of output 18 [2022-12-13 09:15:02,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:15:02,838 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:15:03,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:15:03,007 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:15:03,008 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 31 treesize of output 27 [2022-12-13 09:15:03,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:15:03,041 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:15:03,224 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 34 treesize of output 18 [2022-12-13 09:15:03,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:15:03,295 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:15:03,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:15:03,508 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 09:15:03,509 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:15:03,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:15:03,553 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:15:03,770 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 34 treesize of output 18 [2022-12-13 09:15:03,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:15:03,839 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:15:04,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:15:04,046 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-13 09:15:04,046 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:15:04,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:15:04,089 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:15:04,260 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 34 treesize of output 18 [2022-12-13 09:15:04,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:15:04,329 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:15:04,484 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:15:04,484 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 1 case distinctions, treesize of input 34 treesize of output 27 [2022-12-13 09:15:04,502 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 23 treesize of output 22 [2022-12-13 09:15:04,514 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 19 treesize of output 7 [2022-12-13 09:15:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 2984 proven. 561 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2022-12-13 09:15:04,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:15:04,787 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1715 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) is different from false [2022-12-13 09:16:24,550 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1706 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1704) .cse6 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select .cse7 .cse6)) (.cse3 (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< (+ .cse0 1) v_ArrVal_1706) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse1 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1714) (= .cse0 800) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1712) .cse2 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse2) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse5 .cse6)))))))))) is different from false [2022-12-13 09:16:41,146 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_1704) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse6 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse5 (select .cse7 .cse3))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 800) (not (<= v_ArrVal_1699 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1714) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse4 .cse3))) (< (+ .cse5 1) v_ArrVal_1706) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse6 .cse3))) (= .cse5 800))))))))) is different from false [2022-12-13 09:16:41,459 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse2 v_ArrVal_1704) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse8 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse7 (select .cse9 .cse3))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1699) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1714) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse6 .cse3))) (< (+ .cse7 1) v_ArrVal_1706) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse8 .cse3))) (= .cse7 800)))))))))) is different from false [2022-12-13 09:16:53,356 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse10 .cse11))) (or (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1697 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1697) .cse11 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_1704) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse7 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (select .cse8 .cse3)) (.cse1 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 800) (< (+ .cse4 1) v_ArrVal_1699) (= 800 .cse5) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse6 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse7 .cse3))) (< (+ .cse5 1) v_ArrVal_1706) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1714))))))))) (= .cse4 800)))) is different from false [2022-12-13 09:16:54,073 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse12 (+ (* (select .cse12 .cse10) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1695)))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1697) .cse10 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse1 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_1704) .cse2 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select .cse9 .cse10)) (.cse3 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse4 (select .cse8 .cse2))) (or (= 800 .cse0) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse1 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1714) (< (+ .cse0 1) v_ArrVal_1699) (< (+ .cse4 1) v_ArrVal_1706) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_1712) .cse2 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse2) 800) (= 800 .cse4) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse7 .cse2))))))))))))) is different from false [2022-12-13 09:16:54,214 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse9 (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse12 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse12 .cse10) 4)) v_ArrVal_1695)))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1697) .cse10 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_1704) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse1 (select .cse9 .cse10)) (.cse0 (select .cse8 .cse3))) (or (= 800 .cse0) (= 800 .cse1) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1714) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse6 v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse7 .cse3))) (< (+ .cse1 1) v_ArrVal_1699) (< (+ .cse0 1) v_ArrVal_1706))))))))))) is different from false [2022-12-13 09:17:18,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse8 (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1695))) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_1697) .cse3 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse5 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_1704) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select .cse9 .cse3)) (.cse1 (select .cse8 .cse3)) (.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (< (+ .cse0 1) v_ArrVal_1706) (< (+ 1 .cse1) v_ArrVal_1699) (= .cse0 800) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1714) (= 800 .cse1) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse4 .cse3))) (not (<= v_ArrVal_1693 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse7 .cse3))))))))))))) is different from false [2022-12-13 09:17:18,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse8 (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1695))) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_1697) .cse3 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse5 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_1704) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select .cse9 .cse3)) (.cse1 (select .cse8 .cse3)) (.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (< (+ .cse0 1) v_ArrVal_1706) (< (+ 1 .cse1) v_ArrVal_1699) (= .cse0 800) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_1693) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1714) (= 800 .cse1) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse4 .cse3))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse7 .cse3))))))))))))) is different from false [2022-12-13 09:17:18,290 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse10 (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (store .cse14 (+ (* 4 (select .cse14 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1695))) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_1697) .cse3 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse5 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_1704) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select .cse11 .cse3)) (.cse1 (select .cse10 .cse3)) (.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (< (+ .cse0 1) v_ArrVal_1706) (< (+ 1 .cse1) v_ArrVal_1699) (= .cse0 800) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1714) (= 800 .cse1) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse4 .cse3))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse7 .cse3))) (< (+ (select .cse8 .cse9) 1) v_ArrVal_1693)))))))))))) is different from false [2022-12-13 09:17:18,761 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1690) .cse9 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse11 (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1695))) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse11 .cse2 v_ArrVal_1697) .cse3 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse0 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse2 v_ArrVal_1704) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse7 (select .cse0 |c_~#queue~0.base|))) (let ((.cse6 (select .cse11 .cse3)) (.cse5 (select .cse10 .cse3)) (.cse1 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse4 .cse3))) (< (+ .cse5 1) v_ArrVal_1706) (< (+ .cse6 1) v_ArrVal_1699) (= .cse6 800) (= .cse5 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse7 .cse3))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1714) (< (+ (select .cse8 .cse9) 1) v_ArrVal_1693)))))))))))) is different from false [2022-12-13 09:17:19,124 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1688 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1688)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1690) .cse2 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse11 (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse4) 4)) v_ArrVal_1695))) (.cse8 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse11 .cse8 v_ArrVal_1697) .cse4 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse6 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse8 v_ArrVal_1704) .cse4 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse7 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse0 (select .cse11 .cse4)) (.cse5 (select .cse10 .cse4))) (or (< (+ .cse0 1) v_ArrVal_1699) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1693) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse3 .cse4))) (= 800 .cse5) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_1712) .cse4 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse4) 800) (< (+ (select .cse7 .cse4) 1) v_ArrVal_1714) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse9 .cse4))) (= .cse0 800) (< (+ .cse5 1) v_ArrVal_1706)))))))))))) is different from false [2022-12-13 09:17:19,227 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1688 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse15 (+ (* (select .cse15 .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1688)))) (let ((.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1690) .cse3 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse11 (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* 4 (select .cse14 .cse5))) v_ArrVal_1695))) (.cse9 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse11 .cse9 v_ArrVal_1697) .cse5 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse6 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse8 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse9 v_ArrVal_1704) .cse5 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (select .cse11 .cse5)) (.cse1 (select .cse10 .cse5)) (.cse4 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (< (+ .cse0 1) v_ArrVal_1699) (< (+ .cse1 1) v_ArrVal_1706) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1693) (= .cse0 800) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1714) (= .cse1 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse6 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse7 .cse5))) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_1712) .cse5 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse5) 800))))))))))))) is different from false [2022-12-13 09:17:19,429 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1688 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse5 (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse15 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse15 .cse6) 4)) v_ArrVal_1688)))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1690) .cse6 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse11 (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1695))) (.cse9 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse11 .cse9 v_ArrVal_1697) .cse1 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse7 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse9 v_ArrVal_1704) .cse1 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse2 (select .cse11 .cse1)) (.cse3 (select .cse10 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_1699) (= .cse3 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1693) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_1712) .cse1 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse1) 800) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1714) (= .cse2 800) (< (+ .cse3 1) v_ArrVal_1706))))))))))))) is different from false [2022-12-13 09:17:50,025 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1688 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse14 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1687))) (let ((.cse6 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1688))) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1690) .cse1 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse10 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse1) 4)) v_ArrVal_1695)))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_1697) .cse1 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse3 (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_1704) .cse1 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse2 (select .cse10 .cse1)) (.cse7 (select .cse9 .cse1))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1714) (< (+ .cse2 1) v_ArrVal_1699) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_1712) .cse1 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse1) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1693) (= .cse7 800) (= .cse2 800) (< (+ .cse7 1) v_ArrVal_1706) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse8 .cse1))))))))))))))) is different from false [2022-12-13 09:17:51,262 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1688 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1687))) (let ((.cse2 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1688))) (.cse7 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1690) .cse3 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse10 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse3))) v_ArrVal_1695)))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_1697) .cse3 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_1704) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (select .cse10 .cse3)) (.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse1 (select .cse9 .cse3))) (or (< (+ .cse0 1) v_ArrVal_1699) (= 800 .cse0) (< (+ .cse1 1) v_ArrVal_1706) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1693) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse4 .cse3))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1714) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse7 v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 800) (= 800 .cse1) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse8 .cse3))))))))))))))) is different from false [2022-12-13 09:18:01,075 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse17 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse18 (select .cse16 .cse17))) (or (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1688 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse16 .cse17 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_1687))) (let ((.cse1 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1688))) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse1 .cse5 v_ArrVal_1690) .cse2 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse10 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse2) 4)) v_ArrVal_1695)))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_1697) .cse2 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse6 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse3 (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_1704) .cse2 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse8 (select .cse3 |c_~#queue~0.base|))) (let ((.cse7 (select .cse10 .cse2)) (.cse4 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse0 (select .cse9 .cse2))) (or (< (+ .cse0 1) v_ArrVal_1706) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1693) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1712) .cse2 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse2) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse6 .cse2))) (= 800 .cse7) (< (+ 1 .cse7) v_ArrVal_1699) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1714) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse8 .cse2))) (= 800 .cse0))))))))))))) (= .cse18 800)))) is different from false [2022-12-13 09:18:01,408 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse17 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse18 (select .cse16 .cse17))) (or (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1693 Int) (v_ArrVal_1684 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1688 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse16 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1684) .cse17 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_1687))) (let ((.cse8 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)) v_ArrVal_1688))) (.cse7 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_1690) .cse1 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse10 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1695)))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_1697) .cse1 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse5 (store (store .cse11 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_1704) .cse1 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select .cse10 .cse1)) (.cse4 (select .cse9 .cse1)) (.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse2 .cse1))) (< (+ .cse3 1) v_ArrVal_1699) (= 800 .cse4) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1712) .cse1 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse1) 800) (= .cse3 800) (< (+ .cse4 1) v_ArrVal_1706) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1714) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1693))))))))))))) (= .cse18 800)))) is different from false [2022-12-13 09:18:01,895 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1682 Int) (v_ArrVal_1693 Int) (v_ArrVal_1684 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1688 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse17 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1682)) (.cse18 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (select .cse17 .cse18))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse17 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1684) .cse18 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1687))) (let ((.cse6 (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse2))) v_ArrVal_1688))) (.cse9 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse13 (store (store .cse15 |c_~#queue~0.base| (store (store .cse6 .cse9 v_ArrVal_1690) .cse2 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse10 (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse2) 4)) v_ArrVal_1695)))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse10 .cse9 v_ArrVal_1697) .cse2 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse1 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse8 (store (store .cse12 |c_~#queue~0.base| (store (store .cse11 .cse9 v_ArrVal_1704) .cse2 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (select .cse11 .cse2)) (.cse4 (select .cse10 .cse2)) (.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (= .cse0 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse1 .cse2))) (= 800 .cse3) (< (+ 1 .cse4) v_ArrVal_1699) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse5 .cse2))) (< (+ 1 (select .cse6 .cse2)) v_ArrVal_1693) (< (+ .cse0 1) v_ArrVal_1706) (= 800 .cse4) (< (+ (select .cse7 .cse2) 1) v_ArrVal_1714) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_1712) .cse2 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse2) 800))))))))))))))) is different from false [2022-12-13 09:18:02,069 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_179| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_179| (select .cse0 .cse1))) (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1682 Int) (v_ArrVal_1693 Int) (v_ArrVal_1684 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1688 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse19 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_179| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1682))) (let ((.cse8 (select .cse19 .cse1))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse19 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1684) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1687))) (let ((.cse2 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1688))) (.cse7 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse17 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1690) .cse3 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse13 (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1695)))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_1697) .cse3 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse11 (select .cse14 |c_~#queue~0.base|))) (let ((.cse12 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse5 (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse7 v_ArrVal_1704) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse10 (select .cse5 |c_~#queue~0.base|))) (let ((.cse6 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse9 (select .cse13 .cse3)) (.cse4 (select .cse12 .cse3))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_1693) (< (+ .cse4 1) v_ArrVal_1706) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 800) (= 800 .cse8) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1714) (= 800 .cse9) (< (+ .cse9 1) v_ArrVal_1699) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse10 .cse3))) (= 800 .cse4) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse11 .cse3)))))))))))))))))))) is different from false [2022-12-13 09:18:02,377 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_179| Int) (v_ArrVal_1682 Int) (v_ArrVal_1693 Int) (v_ArrVal_1684 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1688 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse19 (store .cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_179| 4)) v_ArrVal_1682)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select .cse19 .cse7))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse19 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1684) .cse7 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1687))) (let ((.cse5 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1688))) (.cse10 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse17 |c_~#queue~0.base| (store (store .cse5 .cse10 v_ArrVal_1690) .cse3 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse13 (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (store .cse16 (+ (* 4 (select .cse16 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1695)))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse13 .cse10 v_ArrVal_1697) .cse3 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse8 (select .cse14 |c_~#queue~0.base|))) (let ((.cse12 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse9 (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse10 v_ArrVal_1704) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (select .cse13 .cse3)) (.cse2 (store .cse11 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse1 (select .cse12 .cse3))) (or (= 800 .cse0) (< (+ .cse1 1) v_ArrVal_1706) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1714) (= .cse4 800) (< (+ .cse4 1) v_ArrVal_1699) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1693) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_179| (select .cse6 .cse7))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse8 .cse3))) (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 800) (= 800 .cse1) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse11 .cse3)))))))))))))))))) is different from false [2022-12-13 09:18:13,455 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1701 (Array Int Int)) (v_ArrVal_1706 Int) (v_ArrVal_1709 Int) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (v_ArrVal_1680 (Array Int Int)) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_179| Int) (v_ArrVal_1682 Int) (v_ArrVal_1693 Int) (v_ArrVal_1684 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1688 Int) (v_ArrVal_1699 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1712 Int) (v_ArrVal_1703 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1680))) (let ((.cse6 (select .cse18 |c_~#queue~0.base|))) (let ((.cse19 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_179| 4)) v_ArrVal_1682)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse19 .cse2))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse5 v_ArrVal_1684) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1687))) (let ((.cse9 (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* 4 (select .cse17 .cse2))) v_ArrVal_1688)))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_1690) .cse2 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse11 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1695)))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse11 .cse5 v_ArrVal_1697) .cse2 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse1 (select .cse13 |c_~#queue~0.base|))) (let ((.cse12 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse4 (store (store .cse13 |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_1704) .cse2 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse10 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse7 (select .cse12 .cse2)) (.cse0 (select .cse11 .cse2))) (or (< (+ .cse0 1) v_ArrVal_1699) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse1 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1714) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_1712) .cse2 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse2) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_179| (select .cse6 .cse2))) (= .cse7 800) (= .cse8 800) (< (+ (select .cse9 .cse2) 1) v_ArrVal_1693) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse10 .cse2))) (< (+ .cse7 1) v_ArrVal_1706) (= 800 .cse0))))))))))))))))) is different from false [2022-12-13 09:18:14,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:18:14,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 10744 treesize of output 7344 [2022-12-13 09:18:14,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:18:14,262 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 5533 treesize of output 5499 [2022-12-13 09:18:14,312 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 2100 treesize of output 1972 [2022-12-13 09:18:14,382 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 1776 treesize of output 1756 [2022-12-13 09:18:14,438 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 3101 treesize of output 3005 [2022-12-13 09:18:14,493 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 3377 treesize of output 3281 [2022-12-13 09:18:14,547 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 3228 treesize of output 3204 [2022-12-13 09:18:14,603 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 950 treesize of output 822 [2022-12-13 09:18:14,681 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:18:14,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:18:14,873 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 1458 treesize of output 1438 [2022-12-13 09:18:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 2576 proven. 318 refuted. 205 times theorem prover too weak. 1155 trivial. 446 not checked. [2022-12-13 09:18:53,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501776480] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:18:53,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:18:53,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 46, 63] total 132 [2022-12-13 09:18:53,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186450913] [2022-12-13 09:18:53,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:18:53,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-12-13 09:18:53,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:18:53,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-12-13 09:18:53,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1908, Invalid=9681, Unknown=489, NotChecked=5214, Total=17292 [2022-12-13 09:18:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:18:53,190 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:18:53,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 6.159090909090909) internal successors, (813), 132 states have internal predecessors, (813), 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:18:53,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:18:53,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:18:53,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:18:53,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:18:53,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:18:53,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:18:53,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:18:53,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:18:53,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:18:53,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:18:53,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:18:53,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-12-13 09:18:53,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:18:53,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-12-13 09:18:53,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-12-13 09:18:53,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:20:24,190 WARN L233 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 522 DAG size of output: 116 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 09:23:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:23:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:23:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:23:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:23:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:23:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:23:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:23:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:23:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:23:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:23:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:23:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 09:23:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:23:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 09:23:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-13 09:23:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-12-13 09:23:04,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 09:23:04,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 09:23:04,809 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-12-13 09:23:04,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:23:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1207636807, now seen corresponding path program 6 times [2022-12-13 09:23:04,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:23:04,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203856121] [2022-12-13 09:23:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:23:04,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:23:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:23:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14230 backedges. 6802 proven. 2067 refuted. 0 times theorem prover too weak. 5361 trivial. 0 not checked. [2022-12-13 09:23:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:23:43,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203856121] [2022-12-13 09:23:43,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203856121] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 09:23:43,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196551425] [2022-12-13 09:23:43,648 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 09:23:43,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 09:23:43,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 09:23:43,649 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 09:23:43,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c219ead7-2fbf-4b1e-ad96-a2e5654437de/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 09:23:45,458 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-12-13 09:23:45,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 09:23:45,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 117 conjunts are in the unsatisfiable core [2022-12-13 09:23:45,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 09:23:45,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:23:45,693 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:23:45,709 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 09:23:45,709 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:23:45,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:23:45,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 09:23:57,446 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 32 treesize of output 16 [2022-12-13 09:23:57,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:23:57,602 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 17 treesize of output 19 [2022-12-13 09:23:58,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:23:58,139 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:23:58,139 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 32 treesize of output 28 [2022-12-13 09:23:58,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:23:58,226 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 24 treesize of output 23 [2022-12-13 09:23:59,053 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 42 treesize of output 20 [2022-12-13 09:23:59,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:23:59,334 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 27 treesize of output 27 [2022-12-13 09:24:00,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 09:24:00,198 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 09:24:00,198 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 71 treesize of output 49 [2022-12-13 09:24:00,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:24:00,563 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 63 treesize of output 44 [2022-12-13 09:24:01,698 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 81 treesize of output 41 [2022-12-13 09:24:02,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 09:24:02,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 65 treesize of output 59 [2022-12-13 09:24:02,864 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 68 treesize of output 32 [2022-12-13 09:24:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 14230 backedges. 2559 proven. 432 refuted. 0 times theorem prover too weak. 11239 trivial. 0 not checked. [2022-12-13 09:24:03,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 09:24:04,758 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse3 .cse4)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (or (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse5 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2243 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2243) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2243 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2243) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) .cse2)))) (= .cse5 800) (not (<= (+ 3208 |c_~#queue~0.offset|) .cse2))))) is different from false [2022-12-13 09:24:47,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:24:47,986 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 3206 treesize of output 1520 [2022-12-13 09:24:48,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:24:48,018 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 1635 treesize of output 1569 [2022-12-13 09:24:48,029 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 1553 treesize of output 1537 [2022-12-13 09:24:48,042 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 1693 treesize of output 1585 [2022-12-13 09:24:48,074 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 1642 treesize of output 1566 [2022-12-13 09:24:48,097 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 1566 treesize of output 1550 [2022-12-13 09:24:48,114 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 1616 treesize of output 1552 [2022-12-13 09:24:48,134 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 1622 treesize of output 1558 [2022-12-13 09:24:48,191 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 7 treesize of output 3 [2022-12-13 09:24:50,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:24:50,346 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 2297 treesize of output 1725 [2022-12-13 09:25:16,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:25:16,250 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 149 treesize of output 147 [2022-12-13 09:25:16,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 09:25:16,274 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 141 treesize of output 159 [2022-12-13 09:25:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14230 backedges. 338 proven. 2551 refuted. 18 times theorem prover too weak. 11239 trivial. 84 not checked. [2022-12-13 09:25:16,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196551425] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 09:25:16,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 09:25:16,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 35, 38] total 146 [2022-12-13 09:25:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630541932] [2022-12-13 09:25:16,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 09:25:16,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2022-12-13 09:25:16,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:25:16,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2022-12-13 09:25:16,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1781, Invalid=19223, Unknown=170, NotChecked=288, Total=21462 [2022-12-13 09:25:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:25:16,872 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 09:25:16,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 147 states, 146 states have (on average 6.2534246575342465) internal successors, (913), 147 states have internal predecessors, (913), 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:25:16,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2022-12-13 09:25:16,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.