./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/config/GemCutterMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH --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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- 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-38b53e6 [2022-11-25 18:42:56,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:42:56,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:42:56,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:42:56,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:42:56,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:42:56,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:42:56,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:42:56,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:42:56,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:42:56,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:42:56,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:42:56,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:42:56,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:42:56,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:42:56,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:42:56,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:42:56,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:42:56,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:42:56,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:42:56,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:42:56,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:42:56,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:42:56,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:42:56,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:42:56,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:42:56,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:42:56,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:42:56,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:42:56,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:42:56,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:42:56,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:42:56,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:42:56,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:42:56,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:42:56,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:42:56,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:42:56,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:42:56,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:42:56,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:42:56,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:42:56,289 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/config/svcomp-DerefFreeMemtrack-32bit-GemCutter_Default.epf [2022-11-25 18:42:56,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:42:56,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:42:56,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:42:56,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:42:56,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:42:56,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:42:56,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:42:56,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:42:56,337 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:42:56,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:42:56,338 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:42:56,338 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:42:56,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:42:56,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:42:56,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:42:56,339 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:42:56,340 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:42:56,340 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:42:56,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:42:56,340 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:42:56,341 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:42:56,341 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:42:56,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:42:56,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:42:56,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:42:56,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:42:56,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:42:56,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:42:56,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:42:56,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:42:56,343 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-25 18:42:56,344 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-25 18:42:56,344 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-25 18:42:56,344 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-25 18:42:56,345 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-25 18:42:56,345 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_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/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_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-25 18:42:56,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:42:56,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:42:56,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:42:56,683 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:42:56,684 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:42:56,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-25 18:42:59,848 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:43:00,147 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:43:00,148 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-25 18:43:00,174 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/data/acf996dd7/e722b888024e40b3a72d4742cf503e9c/FLAGfa9fd868a [2022-11-25 18:43:00,197 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/data/acf996dd7/e722b888024e40b3a72d4742cf503e9c [2022-11-25 18:43:00,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:43:00,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:43:00,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:43:00,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:43:00,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:43:00,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:00,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ec37f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00, skipping insertion in model container [2022-11-25 18:43:00,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:00,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:43:00,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:43:00,833 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_ea47c29c-9410-4743-88ca-726c23808978/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-25 18:43:00,839 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_ea47c29c-9410-4743-88ca-726c23808978/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-25 18:43:00,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:43:00,856 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:43:00,903 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_ea47c29c-9410-4743-88ca-726c23808978/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-25 18:43:00,906 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_ea47c29c-9410-4743-88ca-726c23808978/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-25 18:43:00,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:43:00,992 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:43:00,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00 WrapperNode [2022-11-25 18:43:00,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:43:00,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:43:00,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:43:00,995 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:43:01,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:01,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:01,071 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-25 18:43:01,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:43:01,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:43:01,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:43:01,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:43:01,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:01,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:01,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:01,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:01,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:01,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:01,125 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:01,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:01,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:43:01,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:43:01,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:43:01,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:43:01,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (1/1) ... [2022-11-25 18:43:01,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:43:01,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:01,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:43:01,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:43:01,207 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-25 18:43:01,207 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-25 18:43:01,207 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-25 18:43:01,208 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-25 18:43:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:43:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:43:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:43:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:43:01,208 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 18:43:01,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:43:01,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:43:01,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:43:01,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:43:01,212 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:43:01,415 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:43:01,417 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:43:02,001 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:43:02,026 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:43:02,026 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 18:43:02,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:43:02 BoogieIcfgContainer [2022-11-25 18:43:02,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:43:02,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:43:02,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:43:02,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:43:02,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:43:00" (1/3) ... [2022-11-25 18:43:02,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec5b8c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:43:02, skipping insertion in model container [2022-11-25 18:43:02,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:43:00" (2/3) ... [2022-11-25 18:43:02,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec5b8c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:43:02, skipping insertion in model container [2022-11-25 18:43:02,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:43:02" (3/3) ... [2022-11-25 18:43:02,038 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-25 18:43:02,069 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:43:02,069 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-11-25 18:43:02,070 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:43:02,183 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 18:43:02,235 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:43:02,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-25 18:43:02,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:02,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-25 18:43:02,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-25 18:43:02,286 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-25 18:43:02,299 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2022-11-25 18:43:02,306 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;@5f66dd49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:43:02,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-25 18:43:02,822 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:02,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash 894477464, now seen corresponding path program 1 times [2022-11-25 18:43:02,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:02,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326518054] [2022-11-25 18:43:02,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:02,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:43:03,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:03,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326518054] [2022-11-25 18:43:03,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326518054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:43:03,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:43:03,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:43:03,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730840807] [2022-11-25 18:43:03,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:43:03,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:43:03,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:03,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:43:03,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:43:03,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:03,266 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:03,267 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-11-25 18:43:03,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:03,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:43:03,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:03,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:03,428 INFO L85 PathProgramCache]: Analyzing trace with hash 679014707, now seen corresponding path program 1 times [2022-11-25 18:43:03,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:03,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598005821] [2022-11-25 18:43:03,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:03,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:43:05,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:05,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598005821] [2022-11-25 18:43:05,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598005821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:43:05,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:43:05,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 18:43:05,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379170929] [2022-11-25 18:43:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:43:05,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 18:43:05,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:05,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 18:43:05,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:43:05,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:05,700 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:05,700 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-11-25 18:43:05,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:05,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:07,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:07,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:07,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:43:07,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:07,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:07,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1484746045, now seen corresponding path program 1 times [2022-11-25 18:43:07,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:07,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486211908] [2022-11-25 18:43:07,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:07,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 18:43:07,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:07,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486211908] [2022-11-25 18:43:07,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486211908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:43:07,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:43:07,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:43:07,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489274947] [2022-11-25 18:43:07,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:43:07,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:43:07,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:07,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:43:07,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:43:07,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:07,416 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:07,417 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-11-25 18:43:07,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:07,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:07,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:07,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:07,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:07,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:07,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:43:07,624 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:07,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:07,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1484746046, now seen corresponding path program 1 times [2022-11-25 18:43:07,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:07,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377214226] [2022-11-25 18:43:07,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:07,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 18:43:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:07,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377214226] [2022-11-25 18:43:07,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377214226] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:43:07,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495596853] [2022-11-25 18:43:07,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:07,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:07,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:07,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:43:07,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:43:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:08,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:43:08,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:43:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 18:43:08,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:43:08,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495596853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:43:08,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:43:08,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-25 18:43:08,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783151539] [2022-11-25 18:43:08,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:43:08,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:43:08,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:08,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:43:08,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:43:08,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:08,181 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:08,182 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-11-25 18:43:08,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:08,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:08,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:08,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:08,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:08,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:08,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:08,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:08,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 18:43:09,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:09,176 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:09,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:09,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1191554454, now seen corresponding path program 1 times [2022-11-25 18:43:09,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:09,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12054845] [2022-11-25 18:43:09,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:09,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-11-25 18:43:09,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:09,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12054845] [2022-11-25 18:43:09,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12054845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:43:09,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:43:09,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:43:09,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652184712] [2022-11-25 18:43:09,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:43:09,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:43:09,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:09,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:43:09,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:43:09,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:09,765 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:09,765 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-11-25 18:43:09,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:09,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:09,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:09,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:09,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:09,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:09,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:09,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:09,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:09,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:43:09,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:09,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:09,835 INFO L85 PathProgramCache]: Analyzing trace with hash -477363659, now seen corresponding path program 1 times [2022-11-25 18:43:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:09,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900577601] [2022-11-25 18:43:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:09,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-25 18:43:10,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:10,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900577601] [2022-11-25 18:43:10,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900577601] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:43:10,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828104135] [2022-11-25 18:43:10,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:10,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:10,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:10,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:43:10,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:43:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:10,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:43:10,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:43:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-25 18:43:10,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:43:10,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828104135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:43:10,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:43:10,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-25 18:43:10,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186622233] [2022-11-25 18:43:10,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:43:10,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:43:10,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:10,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:43:10,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:43:10,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:10,326 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:10,329 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-11-25 18:43:10,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:10,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:10,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:10,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:10,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:10,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:10,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:10,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:10,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:10,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:43:10,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:10,700 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:10,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:10,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1818495636, now seen corresponding path program 1 times [2022-11-25 18:43:10,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:10,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126490381] [2022-11-25 18:43:10,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:10,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-25 18:43:11,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:11,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126490381] [2022-11-25 18:43:11,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126490381] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:43:11,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317705826] [2022-11-25 18:43:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:11,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:11,410 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:43:11,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:43:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:11,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 18:43:11,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:43:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-25 18:43:12,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:43:12,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:12,957 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-11-25 18:43:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-25 18:43:13,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317705826] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:43:13,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:43:13,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2022-11-25 18:43:13,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094244098] [2022-11-25 18:43:13,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:43:13,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 18:43:13,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:13,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 18:43:13,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-11-25 18:43:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:13,091 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:13,091 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-11-25 18:43:13,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:13,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:13,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:13,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:13,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:13,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:13,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:13,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:13,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:43:13,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:43:13,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:13,927 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:13,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash -686375117, now seen corresponding path program 1 times [2022-11-25 18:43:13,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:13,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405422781] [2022-11-25 18:43:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 18:43:15,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:15,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405422781] [2022-11-25 18:43:15,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405422781] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:43:15,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003498704] [2022-11-25 18:43:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:15,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:15,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:15,415 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:43:15,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:43:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:15,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 18:43:15,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:43:16,894 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-11-25 18:43:17,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:43:17,014 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-11-25 18:43:17,284 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-11-25 18:43:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 18:43:17,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:43:17,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:17,744 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-11-25 18:43:17,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:17,755 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-11-25 18:43:17,775 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-11-25 18:43:17,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:17,784 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-11-25 18:43:17,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:43:17,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:43:17,802 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-11-25 18:43:18,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:18,710 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-11-25 18:43:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 33 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 18:43:19,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003498704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:43:19,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:43:19,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2022-11-25 18:43:19,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456127719] [2022-11-25 18:43:19,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:43:19,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-25 18:43:19,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:19,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 18:43:19,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1306, Unknown=9, NotChecked=0, Total=1482 [2022-11-25 18:43:19,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:19,023 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:19,024 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-11-25 18:43:19,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:19,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:19,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:19,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:19,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:19,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:19,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:43:19,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:43:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:43:21,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:43:21,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:21,794 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:21,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:21,794 INFO L85 PathProgramCache]: Analyzing trace with hash 723641874, now seen corresponding path program 2 times [2022-11-25 18:43:21,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:21,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928980574] [2022-11-25 18:43:21,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:21,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 160 proven. 43 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 18:43:24,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:24,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928980574] [2022-11-25 18:43:24,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928980574] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:43:24,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610987550] [2022-11-25 18:43:24,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:43:24,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:24,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:24,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:43:24,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:43:24,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:43:24,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:43:24,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 18:43:24,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:43:25,186 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-11-25 18:43:25,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:43:25,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:43:25,547 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:43:25,547 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-11-25 18:43:25,608 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-11-25 18:43:25,630 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-11-25 18:43:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 160 proven. 43 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 18:43:25,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:43:26,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:26,191 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-11-25 18:43:26,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:26,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 83 [2022-11-25 18:43:26,210 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-11-25 18:43:26,226 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-11-25 18:43:26,279 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:26,279 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-11-25 18:43:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 160 proven. 43 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 18:43:26,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610987550] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:43:26,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:43:26,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 37 [2022-11-25 18:43:26,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678568826] [2022-11-25 18:43:26,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:43:26,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-25 18:43:26,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:26,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-25 18:43:26,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1169, Unknown=4, NotChecked=0, Total=1332 [2022-11-25 18:43:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:26,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:26,642 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-11-25 18:43:26,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:26,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:26,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:26,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:26,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:26,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:26,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:43:26,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:43:26,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:28,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:43:28,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:43:28,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:43:28,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 18:43:28,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:28,426 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:28,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:28,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1971894699, now seen corresponding path program 1 times [2022-11-25 18:43:28,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:28,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789893889] [2022-11-25 18:43:28,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:28,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-11-25 18:43:28,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:28,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789893889] [2022-11-25 18:43:28,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789893889] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:43:28,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029229281] [2022-11-25 18:43:28,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:28,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:28,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:28,823 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:43:28,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:43:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:29,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 18:43:29,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:43:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-11-25 18:43:29,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:43:30,172 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:43:30,173 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-11-25 18:43:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-11-25 18:43:30,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029229281] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:43:30,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:43:30,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2022-11-25 18:43:30,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748133231] [2022-11-25 18:43:30,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:43:30,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:43:30,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:30,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:43:30,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:43:30,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:30,193 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:30,194 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-11-25 18:43:30,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:30,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:30,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:43:30,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:43:30,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:43:30,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:43:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:43:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:43:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:43:30,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:43:30,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 18:43:30,666 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:30,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1029829816, now seen corresponding path program 1 times [2022-11-25 18:43:30,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:30,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077364058] [2022-11-25 18:43:30,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:30,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-11-25 18:43:30,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:30,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077364058] [2022-11-25 18:43:30,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077364058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:43:30,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:43:30,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:43:30,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563984610] [2022-11-25 18:43:30,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:43:30,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:43:30,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:30,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:43:30,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:43:30,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:30,775 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:30,776 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-11-25 18:43:30,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:30,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:30,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:43:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:43:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:43:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:43:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:43:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:43:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:43:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:43:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:30,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:43:30,872 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:30,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:30,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1448138494, now seen corresponding path program 1 times [2022-11-25 18:43:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:30,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978616588] [2022-11-25 18:43:30,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:30,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 61 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 18:43:33,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:33,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978616588] [2022-11-25 18:43:33,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978616588] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:43:33,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742364938] [2022-11-25 18:43:33,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:33,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:33,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:33,899 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:43:33,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:43:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:34,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 18:43:34,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:43:34,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:43:34,280 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-11-25 18:43:34,298 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:43:34,299 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-11-25 18:43:34,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:43:34,316 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-11-25 18:43:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:43:35,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:43:40,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:40,825 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-11-25 18:43:40,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:43:40,842 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-11-25 18:43:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:43:40,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742364938] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:43:40,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:43:40,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 9, 9] total 42 [2022-11-25 18:43:40,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004096712] [2022-11-25 18:43:40,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:43:40,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-25 18:43:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:40,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-25 18:43:40,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1527, Unknown=0, NotChecked=0, Total=1722 [2022-11-25 18:43:40,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:40,958 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:40,959 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-11-25 18:43:40,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:40,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:40,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:40,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:40,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:40,959 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:43:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:43:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:43:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:43:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:40,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:43:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:43:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:43:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:43:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-25 18:43:45,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:43:45,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 18:43:45,771 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:45,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1509489914, now seen corresponding path program 2 times [2022-11-25 18:43:45,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:45,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476815427] [2022-11-25 18:43:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:45,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 350 proven. 131 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-25 18:43:50,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:50,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476815427] [2022-11-25 18:43:50,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476815427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:43:50,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901133542] [2022-11-25 18:43:50,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:43:50,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:50,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:50,363 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:43:50,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 18:43:50,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:43:50,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:43:50,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 18:43:50,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:43:50,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:43:50,806 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-11-25 18:43:50,823 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:43:50,823 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-11-25 18:43:50,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:43:50,844 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-11-25 18:43:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:43:53,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:43:53,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901133542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:43:53,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:43:53,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [21] total 38 [2022-11-25 18:43:53,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361045053] [2022-11-25 18:43:53,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:43:53,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 18:43:53,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:43:53,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 18:43:53,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 18:43:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:53,841 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:43:53,841 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-11-25 18:43:53,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:53,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:53,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:53,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:53,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:53,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:53,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:43:53,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:43:53,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:43:53,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:43:53,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:53,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-25 18:43:53,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:55,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:43:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:43:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:43:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:43:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:43:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:43:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:43:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-25 18:43:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:43:55,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 18:43:55,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 18:43:55,423 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:43:55,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:43:55,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1671033463, now seen corresponding path program 3 times [2022-11-25 18:43:55,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:43:55,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541652514] [2022-11-25 18:43:55,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:43:55,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:43:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:43:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 638 proven. 99 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-11-25 18:43:58,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:43:58,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541652514] [2022-11-25 18:43:58,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541652514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:43:58,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810754014] [2022-11-25 18:43:58,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:43:58,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:43:58,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:43:58,595 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:43:58,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 18:43:58,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 18:43:58,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:43:58,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-25 18:43:58,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:43:59,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:44:02,811 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-11-25 18:44:02,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:44:02,967 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-11-25 18:44:03,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:44:03,472 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:44:03,472 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-11-25 18:44:03,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-25 18:44:04,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-25 18:44:04,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:44:04,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 18:44:04,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:44:04,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-25 18:44:04,989 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 32 treesize of output 14 [2022-11-25 18:44:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 336 proven. 129 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2022-11-25 18:44:05,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:44:05,329 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1112 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1112) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1112 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1112) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-25 18:44:05,579 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1111) |c_~#stored_elements~0.base| v_ArrVal_1112) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1111) |c_~#stored_elements~0.base| v_ArrVal_1112) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-25 18:44:05,746 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1111) |c_~#stored_elements~0.base| v_ArrVal_1112) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1111) |c_~#stored_elements~0.base| v_ArrVal_1112) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2022-11-25 18:44:05,820 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int)) (v_ArrVal_1107 Int)) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1107) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1111) |c_~#stored_elements~0.base| v_ArrVal_1112) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int)) (v_ArrVal_1107 Int)) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1107) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1111) |c_~#stored_elements~0.base| v_ArrVal_1112) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-25 18:44:19,669 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1104 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1104))) (let ((.cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4))) (.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int)) (v_ArrVal_1107 Int) (v_ArrVal_1106 Int)) (<= 0 (+ (* (select (select (store (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_1106))) (store (store .cse1 .cse2 v_ArrVal_1107) .cse3 (+ (select .cse1 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1111) |c_~#stored_elements~0.base| v_ArrVal_1112) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse5)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse4 .cse3))))))) (forall ((v_ArrVal_1104 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| Int)) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1104))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| 4)))) (or (not (<= 0 .cse6)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_74| (select .cse7 .cse3))) (forall ((v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int)) (v_ArrVal_1107 Int) (v_ArrVal_1106 Int)) (<= (+ (* (select (select (store (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse7 .cse6 v_ArrVal_1106))) (store (store .cse9 .cse2 v_ArrVal_1107) .cse3 (+ (select .cse9 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1111) |c_~#stored_elements~0.base| v_ArrVal_1112) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))) is different from false [2022-11-25 18:44:19,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:44:19,912 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 258 treesize of output 189 [2022-11-25 18:44:19,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:44:19,939 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 852 treesize of output 846 [2022-11-25 18:44:19,957 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 829 treesize of output 797 [2022-11-25 18:44:19,969 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 831 treesize of output 819 [2022-11-25 18:44:19,981 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 819 treesize of output 803 [2022-11-25 18:44:19,994 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 803 treesize of output 787 [2022-11-25 18:44:20,007 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 787 treesize of output 755 [2022-11-25 18:44:20,021 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 785 treesize of output 773 [2022-11-25 18:44:20,067 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-11-25 18:44:20,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:44:20,298 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 136 treesize of output 120 [2022-11-25 18:44:26,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-25 18:44:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 88 proven. 219 refuted. 42 times theorem prover too weak. 509 trivial. 116 not checked. [2022-11-25 18:44:26,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810754014] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:44:26,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:44:26,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 24] total 62 [2022-11-25 18:44:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127279593] [2022-11-25 18:44:26,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:44:26,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-25 18:44:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:44:26,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-25 18:44:26,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=2742, Unknown=37, NotChecked=570, Total=3782 [2022-11-25 18:44:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:44:26,876 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:44:26,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 9.129032258064516) internal successors, (566), 62 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-11-25 18:44:26,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:44:26,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:44:26,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:44:26,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:44:26,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:44:26,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:44:26,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:44:26,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:44:26,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:44:26,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:44:26,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:44:26,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-25 18:44:26,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:44:26,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:44:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:44:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:44:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:44:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:44:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:44:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:44:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:44:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:44:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:44:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:44:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:44:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-25 18:44:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:44:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:44:47,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:44:47,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 18:44:47,459 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:44:47,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:44:47,459 INFO L85 PathProgramCache]: Analyzing trace with hash 402579633, now seen corresponding path program 4 times [2022-11-25 18:44:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:44:47,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852541169] [2022-11-25 18:44:47,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:44:47,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:44:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:44:55,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1503 proven. 107 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2022-11-25 18:44:55,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:44:55,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852541169] [2022-11-25 18:44:55,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852541169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:44:55,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455659371] [2022-11-25 18:44:55,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:44:55,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:44:55,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:44:55,972 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:44:55,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 18:44:57,884 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:44:57,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:44:57,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 1438 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-25 18:44:57,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:44:59,466 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-11-25 18:44:59,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:44:59,589 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-11-25 18:45:00,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:45:00,059 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:45:00,059 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-11-25 18:45:00,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:45:00,207 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-11-25 18:45:00,534 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-11-25 18:45:00,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:45:00,704 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-11-25 18:45:01,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:45:01,224 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:45:01,224 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-11-25 18:45:01,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:45:01,396 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-11-25 18:45:01,765 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-11-25 18:45:01,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:45:01,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-11-25 18:45:02,377 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:45:02,378 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-11-25 18:45:02,465 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-11-25 18:45:02,494 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-11-25 18:45:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1454 proven. 159 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2022-11-25 18:45:02,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:45:03,151 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1362 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| Int) (v_ArrVal_1361 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1361) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse1)))))) is different from false [2022-11-25 18:45:03,247 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1362 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| Int) (v_ArrVal_1361 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1361) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse1)))))) is different from false [2022-11-25 18:45:03,267 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1362 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| Int) (v_ArrVal_1361 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1361) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (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-11-25 18:45:03,286 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1362 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1361) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse1)))))) is different from false [2022-11-25 18:45:03,376 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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |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| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse1)))))) is different from false [2022-11-25 18:45:03,449 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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |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| 1604))) (or (not (= 400 (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-11-25 18:45:03,485 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.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 (+ 1608 |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| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse2 .cse3))) (not (= 400 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse3))))))))) is different from false [2022-11-25 18:45:03,541 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| 1604)) (.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 (+ 1608 |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| 1604))) (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) 400)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| (select .cse2 .cse3))))))) is different from false [2022-11-25 18:45:03,937 WARN L837 $PredicateComparison]: unable to prove that (forall ((|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 |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1354))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| 4) |c_~#queue~0.offset|) v_ArrVal_1356))) (store (store .cse4 (+ 1608 |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_122| (select .cse0 .cse1))) (not (= 400 (select (store .cse2 (+ (* |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 .cse2 .cse1)))))))) is different from false [2022-11-25 18:45:04,138 WARN L837 $PredicateComparison]: unable to prove that (forall ((|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| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1354))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.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 (+ 1608 |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 (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| (select .cse2 .cse1))) (not (= 400 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse1)))))))) is different from false [2022-11-25 18:45:04,764 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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |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| 1604)) (.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 (+ 1608 |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 (= 400 (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-11-25 18:45:04,909 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 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |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| 1604)) (.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 (+ 1608 |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) 400)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| (select .cse2 .cse1)))))))) is different from false [2022-11-25 18:45:04,965 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_125| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.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 (+ 1608 |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| 1604)) (.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| 4) |c_~#queue~0.offset|) v_ArrVal_1356))) (store (store .cse6 (+ 1608 |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_122| (select .cse2 .cse3))) (not (= 400 (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| 4) |c_~#queue~0.offset|) v_ArrVal_1362) .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_119| (select .cse4 .cse3))))))))))) is different from false [2022-11-25 18:45:05,055 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| 1604)) (.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 (+ 1608 |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| 1604)) (.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 (+ 1608 |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 (= 400 (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-11-25 18:45:06,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:45:06,097 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-11-25 18:45:06,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:45:06,126 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-11-25 18:45:06,139 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-11-25 18:45:06,157 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-11-25 18:45:06,177 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 774 treesize of output 750 [2022-11-25 18:45:06,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-25 18:45:06,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:45:06,416 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 234 treesize of output 222 [2022-11-25 18:45:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1333 proven. 101 refuted. 0 times theorem prover too weak. 670 trivial. 176 not checked. [2022-11-25 18:45:07,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455659371] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:45:07,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:45:07,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 31] total 79 [2022-11-25 18:45:07,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721134443] [2022-11-25 18:45:07,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:45:07,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-25 18:45:07,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:45:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-25 18:45:07,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=653, Invalid=3536, Unknown=27, NotChecked=1946, Total=6162 [2022-11-25 18:45:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:45:07,427 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:45:07,427 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-11-25 18:45:07,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:45:07,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:45:07,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:45:07,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:45:07,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:45:07,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:45:07,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:45:07,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:45:07,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:45:07,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:45:07,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:45:07,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-25 18:45:07,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:45:07,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:45:07,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:45:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:45:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:45:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:45:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:45:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:45:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:45:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:45:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:45:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:45:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:45:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:45:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-25 18:45:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:45:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:45:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-25 18:45:25,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:45:25,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 18:45:25,762 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-11-25 18:45:25,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:45:25,763 INFO L85 PathProgramCache]: Analyzing trace with hash -970678316, now seen corresponding path program 5 times [2022-11-25 18:45:25,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:45:25,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482751558] [2022-11-25 18:45:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:45:25,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:45:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:45:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 1290 proven. 75 refuted. 0 times theorem prover too weak. 3335 trivial. 0 not checked. [2022-11-25 18:45:36,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:45:36,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482751558] [2022-11-25 18:45:36,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482751558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:45:36,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043150982] [2022-11-25 18:45:36,187 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:45:36,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:45:36,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 [2022-11-25 18:45:36,188 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:45:36,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea47c29c-9410-4743-88ca-726c23808978/bin/ugemcutter-syNpU3ikLH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 18:47:11,047 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-11-25 18:47:11,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:47:11,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 1943 conjuncts, 142 conjunts are in the unsatisfiable core [2022-11-25 18:47:11,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:47:12,118 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-11-25 18:47:12,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:12,208 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-11-25 18:47:12,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:12,521 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:47:12,522 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-11-25 18:47:12,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:12,612 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-11-25 18:47:12,932 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-11-25 18:47:13,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:13,054 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-11-25 18:47:13,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:13,421 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:47:13,421 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-11-25 18:47:13,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:13,545 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-11-25 18:47:13,841 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-11-25 18:47:13,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:13,960 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-11-25 18:47:14,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:14,370 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:47:14,370 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-11-25 18:47:14,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:14,481 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-11-25 18:47:14,783 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-11-25 18:47:14,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:14,925 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-11-25 18:47:15,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:15,338 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:47:15,338 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-11-25 18:47:15,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:15,466 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-11-25 18:47:15,788 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-11-25 18:47:15,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:15,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:47:16,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:47:16,375 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 18:47:16,375 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-11-25 18:47:16,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:16,504 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-11-25 18:47:16,849 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-11-25 18:47:17,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:47:17,012 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-11-25 18:47:17,356 INFO L321 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-11-25 18:47:17,357 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 3 case distinctions, treesize of input 34 treesize of output 30 [2022-11-25 18:47:17,407 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-11-25 18:47:17,440 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-11-25 18:47:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 2984 proven. 561 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2022-11-25 18:47:17,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:47:17,875 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| 1604)) 400)) is different from false [2022-11-25 18:48:53,369 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 ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1704) .cse1 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1706) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1714) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse6 .cse1)))))))))) is different from false [2022-11-25 18:49:35,703 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_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 ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1697) .cse1 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse6 v_ArrVal_1704) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1699) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1714) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1706) (< (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) 400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse7 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse8 .cse3)))))))))))) is different from false [2022-11-25 18:49:41,277 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (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_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 ((.cse0 (store .cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1695))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1697) .cse1 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse8 v_ArrVal_1704) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1699) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1714) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse5 .cse3))) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1706) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse8 v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 400)))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse10 .cse1)))))) is different from false [2022-11-25 18:49:41,444 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_173| 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 ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse9 (store .cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1695)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1697) .cse7 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_1704) .cse1 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1714) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1706) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse3 .cse1))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_1712) .cse1 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse1) 400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse6 .cse7))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse8 .cse1))) (< (+ (select .cse9 .cse7) 1) v_ArrVal_1699))))))))))) is different from false [2022-11-25 18:50:06,781 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_173| 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 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1695)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1697) .cse1 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_1704) .cse1 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (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))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1699) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1714) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse5 .cse1))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_1712) .cse1 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse1) 400) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1706)))))))))))) is different from false [2022-11-25 18:50:19,677 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_173| 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 ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1690) .cse7 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse10 (select .cse12 |c_~#queue~0.base|))) (let ((.cse3 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1695)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse3 .cse9 v_ArrVal_1697) .cse1 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse0 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_1704) .cse1 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1706) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1699) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1714) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse5 .cse1))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1693) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_1712) .cse1 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse1) 400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse10 .cse1))))))))))))))) is different from false [2022-11-25 18:50:21,434 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| (select .cse0 .cse1))) (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_173| 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 ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1688))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1690) .cse1 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse11 (select .cse13 |c_~#queue~0.base|))) (let ((.cse5 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1695)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_1697) .cse3 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) .cse3 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* |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 .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1693) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1699) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse6 .cse3))) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1714) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_1712) .cse3 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse3) 400) (< (+ 1 (select .cse10 .cse3)) v_ArrVal_1706) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse11 .cse3)))))))))))))))))) is different from false [2022-11-25 18:50:21,748 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_173| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| 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 ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse11 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1688)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1690) .cse9 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse2 (select .cse13 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1695)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_1697) .cse1 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse10 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse10 (+ |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 .cse7 .cse6 v_ArrVal_1704) .cse1 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (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_173| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1699) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1714) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse6 v_ArrVal_1712) .cse1 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse1) 400) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1706) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| (select .cse8 .cse9))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse10 .cse1))) (< (+ (select .cse11 .cse9) 1) v_ArrVal_1693)))))))))))))) is different from false [2022-11-25 18:51:08,578 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_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| Int) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1686 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 ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1686)) |c_~#stored_elements~0.base| v_ArrVal_1687))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| 4) |c_~#queue~0.offset|) v_ArrVal_1688)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1690) .cse1 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 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 ((.cse5 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse2 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_1704) .cse1 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (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))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1712) .cse1 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse1) 400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse5 .cse1))) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_1686) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1693) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| (select .cse7 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1714) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1706) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse9 .cse1))) (< (+ (select .cse10 .cse1) 1) v_ArrVal_1699))))))))))))))) is different from false [2022-11-25 18:51:16,712 WARN L837 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1|) (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_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| Int) (v_ArrVal_1690 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1686 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 ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 v_ArrVal_1686)) |c_~#stored_elements~0.base| v_ArrVal_1687))) (let ((.cse7 (select .cse15 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| 4) |c_~#queue~0.offset|) v_ArrVal_1688)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1690) .cse1 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse11 (select .cse14 |c_~#queue~0.base|))) (let ((.cse12 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1695))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_1697) .cse1 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse5 (select .cse13 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse2 (store (store .cse13 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_1704) .cse1 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (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))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1712) .cse1 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse1) 400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1693) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| (select .cse7 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1714) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1706) (< (+ (select .cse9 .cse10) 1) v_ArrVal_1686) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse11 .cse1))) (< (+ (select .cse12 .cse1) 1) v_ArrVal_1699))))))))))))))))) is different from false [2022-11-25 18:51:26,728 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse16 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse7 (select .cse15 .cse16))) (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_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| 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_1686 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 ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1684) .cse16 v_ArrVal_1686)) |c_~#stored_elements~0.base| v_ArrVal_1687))) (let ((.cse6 (select .cse14 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| 4) |c_~#queue~0.offset|) v_ArrVal_1688)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse5 .cse10 v_ArrVal_1690) .cse1 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse2 (select .cse13 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1695))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse3 .cse10 v_ArrVal_1697) .cse1 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse8 .cse10 v_ArrVal_1704) .cse1 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse11 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1699) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1714) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1693) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| (select .cse6 .cse1))) (< (+ .cse7 1) v_ArrVal_1686) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1706) (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_1712) .cse1 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse1) 400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse11 .cse1))))))))))))))))) (= 400 .cse7)))) is different from false [2022-11-25 18:51:27,289 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1682 Int) (v_ArrVal_1684 Int) (v_ArrVal_1686 Int) (v_ArrVal_1688 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1703 Int) (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_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| Int) (v_ArrVal_1690 Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1699 Int) (v_ArrVal_1712 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse12 (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)) (.cse13 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1684) .cse13 v_ArrVal_1686)) |c_~#stored_elements~0.base| v_ArrVal_1687))) (let ((.cse3 (select .cse16 |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| 4) |c_~#queue~0.offset|) v_ArrVal_1688)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_1690) .cse1 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse2 (select .cse15 |c_~#queue~0.base|))) (let ((.cse11 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1695))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse11 .cse9 v_ArrVal_1697) .cse1 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse6 (select .cse14 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse8 (store (store .cse14 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_1704) .cse1 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709)) (.cse10 (select .cse12 .cse13))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1693) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1706) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1714) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_1712) .cse1 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse1) 400) (< (+ .cse10 1) v_ArrVal_1686) (= 400 .cse10) (< (+ (select .cse11 .cse1) 1) v_ArrVal_1699)))))))))))))))) is different from false [2022-11-25 18:51:31,221 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1694 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1682 Int) (v_ArrVal_1684 Int) (v_ArrVal_1686 Int) (v_ArrVal_1688 Int) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1703 Int) (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_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| Int) (v_ArrVal_1690 Int) (v_ArrVal_1693 Int) (v_ArrVal_1695 Int) (v_ArrVal_1697 Int) (v_ArrVal_1699 Int) (v_ArrVal_1712 Int) (v_ArrVal_1714 Int) (v_ArrVal_1715 (Array Int Int))) (let ((.cse13 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse12 (let ((.cse17 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse17 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse17 .cse13) 4)) v_ArrVal_1682)))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse12 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_1684) .cse13 v_ArrVal_1686)) |c_~#stored_elements~0.base| v_ArrVal_1687))) (let ((.cse2 (select .cse16 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| 4) |c_~#queue~0.offset|) v_ArrVal_1688)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse8 .cse11 v_ArrVal_1690) .cse1 v_ArrVal_1693)) |c_~#stored_elements~0.base| v_ArrVal_1694))) (let ((.cse0 (select .cse15 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1695))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse4 .cse11 v_ArrVal_1697) .cse1 v_ArrVal_1699)) |c_~#stored_elements~0.base| v_ArrVal_1701))) (let ((.cse5 (select .cse14 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1703))) (let ((.cse10 (store (store .cse14 |c_~#queue~0.base| (store (store .cse7 .cse11 v_ArrVal_1704) .cse1 v_ArrVal_1706)) |c_~#stored_elements~0.base| v_ArrVal_1708))) (let ((.cse3 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (select .cse12 .cse13)) (.cse9 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1709))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_176| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1699) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| (select .cse5 .cse1))) (< (+ .cse6 1) v_ArrVal_1686) (= 400 .cse6) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1706) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1693) (< (+ (select .cse9 .cse1) 1) v_ArrVal_1714) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse11 v_ArrVal_1712) .cse1 v_ArrVal_1714)) |c_~#stored_elements~0.base| v_ArrVal_1715) |c_~#queue~0.base|) .cse1) 400))))))))))))))))) is different from false [2022-11-25 18:51:58,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:58,045 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 4365 treesize of output 2955 [2022-11-25 18:51:58,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:51:58,443 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 4430 treesize of output 4412 [2022-11-25 18:51:58,507 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 2034 treesize of output 1906 [2022-11-25 18:51:58,559 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 2389 treesize of output 2325 [2022-11-25 18:51:58,619 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 1197 treesize of output 1173 [2022-11-25 18:51:58,682 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 2303 treesize of output 2271 [2022-11-25 18:51:58,739 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 2213 treesize of output 2197 [2022-11-25 18:51:58,790 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-11-25 18:51:58,869 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-11-25 18:52:00,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:52:00,037 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 991 treesize of output 971 [2022-11-25 18:52:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 2582 proven. 345 refuted. 304 times theorem prover too weak. 1155 trivial. 314 not checked. [2022-11-25 18:52:58,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043150982] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:52:58,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:52:58,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 44, 59] total 127 [2022-11-25 18:52:58,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714860042] [2022-11-25 18:52:58,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:52:58,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2022-11-25 18:52:58,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:52:58,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2022-11-25 18:52:58,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1873, Invalid=10179, Unknown=660, NotChecked=3290, Total=16002 [2022-11-25 18:52:58,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:58,480 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-25 18:52:58,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 127 states have (on average 6.440944881889764) internal successors, (818), 127 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-25 18:52:58,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:56:02,742 WARN L233 SmtUtils]: Spent 7.56s on a formula simplification. DAG size of input: 468 DAG size of output: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)