./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/config/svcomp-Overflow-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 06:52:11,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 06:52:11,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 06:52:11,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 06:52:11,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 06:52:11,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 06:52:11,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 06:52:11,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 06:52:11,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 06:52:11,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 06:52:11,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 06:52:11,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 06:52:11,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 06:52:11,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 06:52:11,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 06:52:11,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 06:52:11,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 06:52:11,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 06:52:11,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 06:52:11,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 06:52:11,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 06:52:11,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 06:52:11,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 06:52:11,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 06:52:11,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 06:52:11,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 06:52:11,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 06:52:11,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 06:52:11,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 06:52:11,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 06:52:11,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 06:52:11,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 06:52:11,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 06:52:11,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 06:52:11,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 06:52:11,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 06:52:11,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 06:52:11,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 06:52:11,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 06:52:11,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 06:52:11,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 06:52:11,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2022-11-23 06:52:11,466 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 06:52:11,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 06:52:11,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 06:52:11,468 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 06:52:11,469 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 06:52:11,469 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 06:52:11,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 06:52:11,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 06:52:11,470 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 06:52:11,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 06:52:11,472 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 06:52:11,472 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 06:52:11,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 06:52:11,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 06:52:11,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 06:52:11,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 06:52:11,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 06:52:11,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 06:52:11,473 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-23 06:52:11,474 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 06:52:11,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 06:52:11,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 06:52:11,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 06:52:11,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 06:52:11,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 06:52:11,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 06:52:11,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 06:52:11,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 06:52:11,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 06:52:11,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 06:52:11,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 06:52:11,476 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-23 06:52:11,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 06:52:11,477 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-23 06:52:11,477 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-23 06:52:11,477 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-23 06:52:11,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 06:52:11,478 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-23 06:52:11,478 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-23 06:52:11,478 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_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/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_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-11-23 06:52:11,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 06:52:11,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 06:52:11,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 06:52:11,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 06:52:11,811 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 06:52:11,812 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-23 06:52:14,879 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 06:52:15,231 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 06:52:15,232 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-23 06:52:15,247 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/data/64db07310/c95943e5203e413b8e38166219199732/FLAG231188b8a [2022-11-23 06:52:15,264 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/data/64db07310/c95943e5203e413b8e38166219199732 [2022-11-23 06:52:15,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 06:52:15,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 06:52:15,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 06:52:15,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 06:52:15,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 06:52:15,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:52:15" (1/1) ... [2022-11-23 06:52:15,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7b01d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:15, skipping insertion in model container [2022-11-23 06:52:15,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:52:15" (1/1) ... [2022-11-23 06:52:15,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 06:52:15,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 06:52:15,931 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_00a9550f-378d-4910-a677-bfee98a0711f/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-23 06:52:15,937 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_00a9550f-378d-4910-a677-bfee98a0711f/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-23 06:52:15,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 06:52:15,966 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 06:52:16,046 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_00a9550f-378d-4910-a677-bfee98a0711f/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-23 06:52:16,054 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_00a9550f-378d-4910-a677-bfee98a0711f/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-23 06:52:16,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 06:52:16,125 INFO L208 MainTranslator]: Completed translation [2022-11-23 06:52:16,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:16 WrapperNode [2022-11-23 06:52:16,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 06:52:16,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 06:52:16,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 06:52:16,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 06:52:16,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:16" (1/1) ... [2022-11-23 06:52:16,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:16" (1/1) ... [2022-11-23 06:52:16,228 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-23 06:52:16,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 06:52:16,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 06:52:16,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 06:52:16,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 06:52:16,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:16" (1/1) ... [2022-11-23 06:52:16,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:16" (1/1) ... [2022-11-23 06:52:16,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:16" (1/1) ... [2022-11-23 06:52:16,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:16" (1/1) ... [2022-11-23 06:52:16,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:16" (1/1) ... [2022-11-23 06:52:16,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:16" (1/1) ... [2022-11-23 06:52:16,297 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:16" (1/1) ... [2022-11-23 06:52:16,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:16" (1/1) ... [2022-11-23 06:52:16,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 06:52:16,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 06:52:16,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 06:52:16,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 06:52:16,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:16" (1/1) ... [2022-11-23 06:52:16,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 06:52:16,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:52:16,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 06:52:16,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 06:52:16,403 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-23 06:52:16,403 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-23 06:52:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-23 06:52:16,404 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-23 06:52:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 06:52:16,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 06:52:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 06:52:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 06:52:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-23 06:52:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 06:52:16,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 06:52:16,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 06:52:16,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 06:52:16,408 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 06:52:16,561 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 06:52:16,563 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 06:52:17,006 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 06:52:17,016 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 06:52:17,016 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-23 06:52:17,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:52:17 BoogieIcfgContainer [2022-11-23 06:52:17,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 06:52:17,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 06:52:17,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 06:52:17,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 06:52:17,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:52:15" (1/3) ... [2022-11-23 06:52:17,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a5738f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:52:17, skipping insertion in model container [2022-11-23 06:52:17,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:52:16" (2/3) ... [2022-11-23 06:52:17,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a5738f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:52:17, skipping insertion in model container [2022-11-23 06:52:17,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:52:17" (3/3) ... [2022-11-23 06:52:17,054 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-23 06:52:17,063 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 06:52:17,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 06:52:17,078 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-23 06:52:17,079 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 06:52:17,283 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 06:52:17,335 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:52:17,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-23 06:52:17,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:52:17,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-23 06:52:17,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-23 06:52:17,411 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-23 06:52:17,425 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2022-11-23 06:52:17,432 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23d8e04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:52:17,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 06:52:17,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:52:17,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:52:17,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1319727467, now seen corresponding path program 1 times [2022-11-23 06:52:17,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:52:17,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540919379] [2022-11-23 06:52:17,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:52:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:52:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:52:18,266 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-23 06:52:18,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:52:18,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540919379] [2022-11-23 06:52:18,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540919379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:52:18,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:52:18,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 06:52:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030657309] [2022-11-23 06:52:18,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:52:18,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 06:52:18,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:52:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 06:52:18,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 06:52:18,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:18,313 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:52:18,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 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-23 06:52:18,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:18,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:18,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 06:52:18,423 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:52:18,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:52:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1423842390, now seen corresponding path program 1 times [2022-11-23 06:52:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:52:18,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252083107] [2022-11-23 06:52:18,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:52:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:52:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:52:18,802 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-23 06:52:18,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:52:18,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252083107] [2022-11-23 06:52:18,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252083107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:52:18,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:52:18,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 06:52:18,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102388924] [2022-11-23 06:52:18,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:52:18,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:52:18,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:52:18,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:52:18,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 06:52:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:18,808 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:52:18,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-23 06:52:18,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:18,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:18,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 06:52:18,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:52:18,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:52:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1119853959, now seen corresponding path program 1 times [2022-11-23 06:52:18,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:52:18,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223258758] [2022-11-23 06:52:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:52:18,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:52:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:52:21,765 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-23 06:52:21,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:52:21,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223258758] [2022-11-23 06:52:21,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223258758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:52:21,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:52:21,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-23 06:52:21,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805460542] [2022-11-23 06:52:21,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:52:21,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 06:52:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:52:21,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 06:52:21,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-11-23 06:52:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:21,769 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:52:21,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.523809523809524) internal successors, (95), 22 states have internal predecessors, (95), 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-23 06:52:21,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:21,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:21,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:23,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:23,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:23,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 06:52:23,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:52:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:52:23,641 INFO L85 PathProgramCache]: Analyzing trace with hash -355733740, now seen corresponding path program 1 times [2022-11-23 06:52:23,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:52:23,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401834925] [2022-11-23 06:52:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:52:23,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:52:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:52:26,169 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-23 06:52:26,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:52:26,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401834925] [2022-11-23 06:52:26,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401834925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:52:26,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:52:26,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-23 06:52:26,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983172354] [2022-11-23 06:52:26,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:52:26,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 06:52:26,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:52:26,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 06:52:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-11-23 06:52:26,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:26,173 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:52:26,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.052631578947368) internal successors, (96), 20 states have internal predecessors, (96), 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-23 06:52:26,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:26,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:26,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:26,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:27,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 06:52:27,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:52:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:52:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash -828858809, now seen corresponding path program 1 times [2022-11-23 06:52:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:52:27,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309719395] [2022-11-23 06:52:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:52:27,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:52:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:52:27,715 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-23 06:52:27,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:52:27,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309719395] [2022-11-23 06:52:27,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309719395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:52:27,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:52:27,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 06:52:27,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277506938] [2022-11-23 06:52:27,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:52:27,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 06:52:27,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:52:27,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 06:52:27,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 06:52:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:27,719 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:52:27,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 37.0) internal successors, (111), 4 states have internal predecessors, (111), 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-23 06:52:27,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:27,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:27,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:27,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:27,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:27,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:27,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:27,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:52:27,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 06:52:27,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:52:27,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:52:27,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1017669425, now seen corresponding path program 1 times [2022-11-23 06:52:27,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:52:27,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574938141] [2022-11-23 06:52:27,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:52:27,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:52:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:52:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:52:29,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:52:29,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574938141] [2022-11-23 06:52:29,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574938141] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:52:29,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777590820] [2022-11-23 06:52:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:52:29,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:52:29,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:52:29,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:52:29,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 06:52:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:52:29,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-23 06:52:29,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:52:30,074 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-23 06:52:30,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-23 06:52:30,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:52:30,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-23 06:52:30,709 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-23 06:52:30,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 41 [2022-11-23 06:52:30,772 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-23 06:52:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:52:30,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:52:31,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:52:31,725 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 2 case distinctions, treesize of input 65 treesize of output 55 [2022-11-23 06:52:31,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:52:31,739 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 94 treesize of output 94 [2022-11-23 06:52:31,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-11-23 06:52:31,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 06:52:31,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:52:31,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 89 [2022-11-23 06:52:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:52:32,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777590820] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:52:32,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:52:32,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 41 [2022-11-23 06:52:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809858225] [2022-11-23 06:52:32,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:52:32,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-23 06:52:32,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:52:32,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-23 06:52:32,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1512, Unknown=15, NotChecked=0, Total=1722 [2022-11-23 06:52:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:32,604 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:52:32,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 8.609756097560975) internal successors, (353), 42 states have internal predecessors, (353), 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-23 06:52:32,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:32,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:32,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:32,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:32,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:52:32,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:52:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:52:34,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 06:52:34,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:52:34,294 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:52:34,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:52:34,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1482980482, now seen corresponding path program 1 times [2022-11-23 06:52:34,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:52:34,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430081897] [2022-11-23 06:52:34,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:52:34,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:52:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:52:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:52:36,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:52:36,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430081897] [2022-11-23 06:52:36,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430081897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:52:36,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:52:36,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-23 06:52:36,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238859353] [2022-11-23 06:52:36,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:52:36,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 06:52:36,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:52:36,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 06:52:36,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-23 06:52:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:36,311 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:52:36,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.894736842105263) internal successors, (131), 19 states have internal predecessors, (131), 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-23 06:52:36,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:36,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:36,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:36,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:36,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:52:36,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:52:36,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:37,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:37,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:37,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:37,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:37,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:52:37,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:52:37,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:52:37,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 06:52:37,378 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:52:37,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:52:37,378 INFO L85 PathProgramCache]: Analyzing trace with hash -91224222, now seen corresponding path program 1 times [2022-11-23 06:52:37,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:52:37,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599526434] [2022-11-23 06:52:37,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:52:37,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:52:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:52:43,350 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-23 06:52:43,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:52:43,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599526434] [2022-11-23 06:52:43,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599526434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:52:43,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:52:43,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-23 06:52:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011706333] [2022-11-23 06:52:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:52:43,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 06:52:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:52:43,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 06:52:43,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2022-11-23 06:52:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:43,354 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:52:43,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.565217391304348) internal successors, (105), 24 states have internal predecessors, (105), 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-23 06:52:43,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:43,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:43,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:43,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:43,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:52:43,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:52:43,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:52:43,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:52:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:52:46,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:52:46,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:46,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 06:52:46,003 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:52:46,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:52:46,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1467017053, now seen corresponding path program 1 times [2022-11-23 06:52:46,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:52:46,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562360410] [2022-11-23 06:52:46,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:52:46,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:52:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:52:51,657 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-23 06:52:51,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:52:51,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562360410] [2022-11-23 06:52:51,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562360410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:52:51,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:52:51,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-23 06:52:51,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457475853] [2022-11-23 06:52:51,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:52:51,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 06:52:51,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:52:51,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 06:52:51,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-11-23 06:52:51,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:51,660 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:52:51,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 20 states have internal predecessors, (106), 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-23 06:52:51,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:51,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:51,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:51,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:51,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:52:51,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:52:51,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:52:51,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:51,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:53,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:53,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:53,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:52:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:52:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:52:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 06:52:53,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:53,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 06:52:53,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:52:53,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:52:53,521 INFO L85 PathProgramCache]: Analyzing trace with hash 217716167, now seen corresponding path program 1 times [2022-11-23 06:52:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:52:53,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532840523] [2022-11-23 06:52:53,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:52:53,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:52:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:52:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:52:54,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:52:54,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532840523] [2022-11-23 06:52:54,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532840523] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:52:54,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716628991] [2022-11-23 06:52:54,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:52:54,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:52:54,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:52:54,932 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:52:54,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 06:52:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:52:55,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-23 06:52:55,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:52:55,763 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-23 06:52:55,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-23 06:52:56,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:52:56,081 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 18 treesize of output 20 [2022-11-23 06:52:56,443 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-23 06:52:56,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-23 06:52:56,513 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 17 treesize of output 9 [2022-11-23 06:52:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:52:56,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:52:57,095 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_331 Int) (v_ArrVal_330 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_330) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_331) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_331 2147483648) 0))) is different from false [2022-11-23 06:52:57,382 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:52:57,383 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 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-23 06:52:57,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:52:57,394 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 56 treesize of output 60 [2022-11-23 06:52:57,409 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 32 treesize of output 28 [2022-11-23 06:52:57,431 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 10 treesize of output 6 [2022-11-23 06:52:57,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:52:57,440 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 48 [2022-11-23 06:52:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:52:57,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716628991] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:52:57,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:52:57,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 51 [2022-11-23 06:52:57,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348711108] [2022-11-23 06:52:57,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:52:57,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-23 06:52:57,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:52:57,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-23 06:52:57,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2289, Unknown=11, NotChecked=98, Total=2652 [2022-11-23 06:52:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:57,871 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:52:57,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 7.2745098039215685) internal successors, (371), 52 states have internal predecessors, (371), 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-23 06:52:57,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:57,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:57,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:57,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:57,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:52:57,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:52:57,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:52:57,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-23 06:52:57,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:57,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:59,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:52:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:52:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:52:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:52:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:52:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 06:52:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:52:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:52:59,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-23 06:53:00,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 06:53:00,069 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:53:00,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:53:00,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1840732794, now seen corresponding path program 1 times [2022-11-23 06:53:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:53:00,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907655329] [2022-11-23 06:53:00,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:53:00,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:53:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:53:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:53:04,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:53:04,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907655329] [2022-11-23 06:53:04,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907655329] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:53:04,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784283565] [2022-11-23 06:53:04,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:53:04,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:53:04,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:53:04,542 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:53:04,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 06:53:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:53:04,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-23 06:53:04,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:53:04,848 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:53:04,848 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-23 06:53:04,922 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:53:04,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:53:05,187 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-23 06:53:05,277 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-23 06:53:05,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-23 06:53:06,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-23 06:53:06,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:53:06,609 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 06:53:06,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-23 06:53:06,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:53:06,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:53:06,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-23 06:53:07,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-23 06:53:07,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:53:07,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 25 treesize of output 25 [2022-11-23 06:53:07,824 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-23 06:53:07,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-23 06:53:07,883 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 06:53:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:53:07,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:53:08,323 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_408 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-11-23 06:53:08,399 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_408 Int) (v_ArrVal_404 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_404 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-23 06:53:08,548 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_408 Int) (v_ArrVal_404 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_404))))) is different from false [2022-11-23 06:53:08,654 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_408 Int) (v_ArrVal_404 Int) (v_ArrVal_402 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_402) .cse2 v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_404) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_402 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-23 06:53:09,773 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_400 Int) (v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_408 Int) (v_ArrVal_404 Int) (v_ArrVal_402 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_400)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse4 v_ArrVal_402) .cse1 v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_404) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse3 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_402)))))) is different from false [2022-11-23 06:53:21,147 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_400 Int) (v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_408 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int)) (v_ArrVal_404 Int) (v_ArrVal_402 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_399))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_400)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_402) .cse1 v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_402) (< (+ (select .cse3 .cse1) 1) v_ArrVal_404) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) .cse4) 2147483647))))))) is different from false [2022-11-23 06:53:21,848 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| Int) (v_ArrVal_400 Int) (v_ArrVal_396 Int) (v_ArrVal_406 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_408 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_398 (Array Int Int)) (v_ArrVal_404 Int) (v_ArrVal_402 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_396)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_398) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_399))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| 4)) v_ArrVal_400)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_402) .cse1 v_ArrVal_404)) |c_~#stored_elements~0.base| v_ArrVal_406) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_~#queue~0.offset|) v_ArrVal_408) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (not (<= v_ArrVal_396 0)) (< (+ (select .cse4 .cse3) 1) v_ArrVal_402) (< (+ (select .cse4 .cse1) 1) v_ArrVal_404))))))) is different from false [2022-11-23 06:53:21,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:53:21,878 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 2 case distinctions, treesize of input 270 treesize of output 185 [2022-11-23 06:53:21,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:53:21,899 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 644 treesize of output 640 [2022-11-23 06:53:21,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 524 treesize of output 500 [2022-11-23 06:53:21,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 386 treesize of output 354 [2022-11-23 06:53:22,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 289 [2022-11-23 06:53:22,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:53:22,101 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 17 treesize of output 9 [2022-11-23 06:53:23,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:53:23,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 109 [2022-11-23 06:53:23,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:53:23,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-11-23 06:53:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-23 06:53:24,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784283565] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:53:24,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:53:24,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 29] total 82 [2022-11-23 06:53:24,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985843512] [2022-11-23 06:53:24,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:53:24,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-23 06:53:24,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:53:24,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-23 06:53:24,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=5061, Unknown=56, NotChecked=1078, Total=6806 [2022-11-23 06:53:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:53:24,259 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:53:24,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 4.548780487804878) internal successors, (373), 83 states have internal predecessors, (373), 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-23 06:53:24,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:53:24,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:53:24,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:53:24,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:53:24,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:53:24,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:53:24,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:53:24,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-23 06:53:24,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:53:24,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:53:24,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:53:47,221 WARN L233 SmtUtils]: Spent 10.42s on a formula simplification. DAG size of input: 180 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:54:02,494 WARN L233 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 198 DAG size of output: 176 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:54:11,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:54:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:54:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:54:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 06:54:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 06:54:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-23 06:54:23,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 06:54:23,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 06:54:23,677 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:54:23,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:23,678 INFO L85 PathProgramCache]: Analyzing trace with hash -431098475, now seen corresponding path program 1 times [2022-11-23 06:54:23,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:23,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348216432] [2022-11-23 06:54:23,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:23,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:54:23,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:23,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348216432] [2022-11-23 06:54:23,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348216432] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:54:23,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22892974] [2022-11-23 06:54:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:23,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:23,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:23,830 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:54:23,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 06:54:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:23,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 06:54:23,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:54:24,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:54:24,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 06:54:24,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22892974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:54:24,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 06:54:24,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-23 06:54:24,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716718895] [2022-11-23 06:54:24,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:54:24,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 06:54:24,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:24,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 06:54:24,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-23 06:54:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:24,100 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:24,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 38.0) internal successors, (152), 5 states have internal predecessors, (152), 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-23 06:54:24,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:24,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:24,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:54:24,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:24,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:54:24,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:24,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:24,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-23 06:54:24,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:24,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-23 06:54:24,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-23 06:54:24,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:24,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:24,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:24,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:54:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:54:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 06:54:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 06:54:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-23 06:54:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:54:24,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 06:54:24,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 06:54:24,374 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:54:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash -479150187, now seen corresponding path program 1 times [2022-11-23 06:54:24,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:24,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402128955] [2022-11-23 06:54:24,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:24,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:54:24,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:24,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402128955] [2022-11-23 06:54:24,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402128955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:54:24,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:54:24,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 06:54:24,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076027638] [2022-11-23 06:54:24,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:54:24,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 06:54:24,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:24,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 06:54:24,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 06:54:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:24,462 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:24,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 51.0) internal successors, (153), 4 states have internal predecessors, (153), 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-23 06:54:24,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:24,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:24,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:54:24,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:24,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:54:24,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:24,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:24,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-23 06:54:24,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:24,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-23 06:54:24,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-23 06:54:24,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:54:24,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:54:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:54:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 06:54:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:54:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-23 06:54:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:54:36,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:54:36,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 06:54:36,428 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:54:36,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:36,428 INFO L85 PathProgramCache]: Analyzing trace with hash 613601222, now seen corresponding path program 1 times [2022-11-23 06:54:36,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:36,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873584295] [2022-11-23 06:54:36,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:36,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 97 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 06:54:38,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:38,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873584295] [2022-11-23 06:54:38,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873584295] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:54:38,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708349386] [2022-11-23 06:54:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:38,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:38,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:38,500 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:54:38,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 06:54:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:38,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-23 06:54:38,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:54:39,860 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-23 06:54:39,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:54:39,991 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-23 06:54:40,353 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-23 06:54:40,354 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-23 06:54:40,439 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-23 06:54:40,458 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-23 06:54:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 97 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 06:54:40,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:54:40,930 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_611 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| Int) (v_ArrVal_612 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_611) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| 4)) v_ArrVal_612) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_36| (select .cse0 .cse1)))))) is different from false [2022-11-23 06:54:40,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:40,985 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-23 06:54:40,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:40,997 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-23 06:54:41,008 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-23 06:54:41,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-23 06:54:41,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:41,078 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-23 06:54:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 91 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 6 not checked. [2022-11-23 06:54:41,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708349386] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:54:41,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:54:41,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 13] total 41 [2022-11-23 06:54:41,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119289203] [2022-11-23 06:54:41,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:54:41,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-23 06:54:41,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:41,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-23 06:54:41,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1386, Unknown=1, NotChecked=76, Total=1640 [2022-11-23 06:54:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:41,659 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:41,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 12.463414634146341) internal successors, (511), 41 states have internal predecessors, (511), 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-23 06:54:41,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:41,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:41,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:54:41,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:41,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:54:41,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:41,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:41,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-23 06:54:41,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:41,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:54:41,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-11-23 06:54:41,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:54:41,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:54:41,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:54:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:54:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 06:54:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:54:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-23 06:54:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:54:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:54:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:54:43,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-23 06:54:43,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 06:54:43,673 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:54:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1439309226, now seen corresponding path program 1 times [2022-11-23 06:54:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:43,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454129915] [2022-11-23 06:54:43,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:43,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 53 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 06:54:45,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:45,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454129915] [2022-11-23 06:54:45,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454129915] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:54:45,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034053500] [2022-11-23 06:54:45,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:45,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:45,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:45,246 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:54:45,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 06:54:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:45,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-23 06:54:45,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:54:45,628 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:54:45,629 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-23 06:54:45,702 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:54:45,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:54:45,980 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-23 06:54:46,081 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-23 06:54:46,615 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-23 06:54:46,864 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-23 06:54:47,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:54:47,369 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-23 06:54:47,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-23 06:54:47,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:54:47,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 06:54:47,827 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-23 06:54:47,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:54:47,964 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-23 06:54:48,235 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-23 06:54:48,235 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-23 06:54:48,342 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-23 06:54:48,363 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-23 06:54:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 59 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:54:48,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:54:48,829 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| 4)) v_ArrVal_710) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| (select .cse0 .cse1)))))) is different from false [2022-11-23 06:54:48,907 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| 4)) v_ArrVal_710) .cse1)))))) is different from false [2022-11-23 06:54:48,946 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| 4)) v_ArrVal_710) .cse1) 800))))) is different from false [2022-11-23 06:54:48,963 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| 4)) v_ArrVal_710) .cse1) 800))))) is different from false [2022-11-23 06:54:49,040 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| Int) (v_ArrVal_706 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_706) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| 4)) v_ArrVal_710) .cse1)))))) is different from false [2022-11-23 06:54:49,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 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_703)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_706) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| 4)) v_ArrVal_710) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| (select .cse0 .cse1)))))) is different from false [2022-11-23 06:54:49,162 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| Int) (v_ArrVal_706 Int) (v_ArrVal_703 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 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_52| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_703))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_706) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| 4)) v_ArrVal_710) .cse3) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| (select .cse2 .cse3))))))))) is different from false [2022-11-23 06:54:49,218 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| Int) (v_ArrVal_706 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| Int) (v_ArrVal_703 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_703))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_706) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| 4)) v_ArrVal_710) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| (select .cse2 .cse3))))))) is different from false [2022-11-23 06:54:49,605 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| Int) (v_ArrVal_706 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| Int) (v_ArrVal_703 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.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_52| 4) |c_~#queue~0.offset|) v_ArrVal_703))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_706) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| (select .cse2 .cse1))) (not (= 800 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| 4)) v_ArrVal_710) .cse1)))))))) is different from false [2022-11-23 06:54:49,832 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| Int) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_706 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| Int) (v_ArrVal_703 Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_710 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_701) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_702))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| 4) |c_~#queue~0.offset|) v_ArrVal_703))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_706) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_709) |c_~#queue~0.base|))) (or (not (= 800 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| 4)) v_ArrVal_710) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_49| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_52| (select .cse2 .cse1)))))))) is different from false [2022-11-23 06:54:50,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:50,492 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 2 case distinctions, treesize of input 265 treesize of output 180 [2022-11-23 06:54:50,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:50,518 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 1141 treesize of output 1131 [2022-11-23 06:54:50,533 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 1175 treesize of output 1151 [2022-11-23 06:54:50,552 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 1199 treesize of output 1151 [2022-11-23 06:54:50,572 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 1129 treesize of output 1065 [2022-11-23 06:54:50,614 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-23 06:54:51,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:51,287 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 123 treesize of output 115 [2022-11-23 06:54:51,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:51,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-11-23 06:54:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-23 06:54:52,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034053500] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:54:52,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:54:52,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25, 27] total 64 [2022-11-23 06:54:52,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009566253] [2022-11-23 06:54:52,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:54:52,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-23 06:54:52,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:52,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-23 06:54:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=2540, Unknown=26, NotChecked=1130, Total=4032 [2022-11-23 06:54:52,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:52,398 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:52,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 7.25) internal successors, (464), 64 states have internal predecessors, (464), 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-23 06:54:52,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:52,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:52,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:54:52,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:52,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:54:52,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:52,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:52,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-11-23 06:54:52,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:52,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:54:52,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-11-23 06:54:52,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:54:52,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:54:52,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:54:52,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:55:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:55:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:55:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:55:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:55:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:55:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 06:55:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:55:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:55:25,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-23 06:55:25,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:55:25,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:55:25,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:55:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 06:55:25,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-23 06:55:26,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:55:26,012 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:55:26,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:55:26,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1229645602, now seen corresponding path program 1 times [2022-11-23 06:55:26,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:55:26,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936159337] [2022-11-23 06:55:26,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:55:26,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:55:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:55:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 30 proven. 57 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 06:55:27,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:55:27,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936159337] [2022-11-23 06:55:27,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936159337] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:55:27,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754877757] [2022-11-23 06:55:27,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:55:27,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:55:27,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:55:27,225 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:55:27,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 06:55:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:55:27,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-23 06:55:27,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:55:27,568 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:55:27,568 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-23 06:55:27,623 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:55:27,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:55:27,851 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-23 06:55:27,918 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-23 06:55:28,363 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-23 06:55:28,562 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-23 06:55:28,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:55:28,993 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-23 06:55:28,993 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-23 06:55:29,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:29,103 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-23 06:55:29,410 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-23 06:55:29,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:29,522 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-23 06:55:29,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:55:29,887 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-23 06:55:29,887 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-23 06:55:29,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:29,987 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-23 06:55:30,276 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-23 06:55:30,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:30,412 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-23 06:55:30,718 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-23 06:55:30,718 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-23 06:55:30,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 06:55:30,833 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-23 06:55:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:55:30,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:55:31,573 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_815 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse0 .cse1)))))) is different from false [2022-11-23 06:55:31,612 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_815 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse1) 2147483650)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse0 .cse1)))))) is different from false [2022-11-23 06:55:31,629 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_815 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse1)))))) is different from false [2022-11-23 06:55:31,706 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_815 Int) (v_ArrVal_810 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_810) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse1) 2147483650)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse0 .cse1)))))) is different from false [2022-11-23 06:55:31,787 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_808 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_815 Int) (v_ArrVal_810 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_808)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_810) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse1)))))) is different from false [2022-11-23 06:55:31,816 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| (select .cse0 .cse1))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_808 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_815 Int) (v_ArrVal_810 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_59| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_808))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_810) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse2 .cse3))) (< 0 (+ 2147483650 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse3))))))))) is different from false [2022-11-23 06:55:31,871 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int) (v_ArrVal_808 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_815 Int) (v_ArrVal_810 Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4)) v_ArrVal_808))) (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_810) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| (select .cse2 .cse3))))))) is different from false [2022-11-23 06:55:32,266 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int) (v_ArrVal_808 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_815 Int) (v_ArrVal_810 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_807))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_808))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_810) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| (select .cse2 .cse1)))))))) is different from false [2022-11-23 06:55:33,178 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int) (v_ArrVal_808 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_815 Int) (v_ArrVal_810 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_804) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_807))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_808))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_810) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| (select .cse2 .cse1))) (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse1) 2147483650))))))) is different from false [2022-11-23 06:55:33,328 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int) (v_ArrVal_808 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_815 Int) (v_ArrVal_801 Int) (v_ArrVal_810 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_801)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_804) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_807))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_808))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_810) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| (select .cse2 .cse1)))))))) is different from false [2022-11-23 06:55:33,376 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int) (v_ArrVal_808 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_815 Int) (v_ArrVal_801 Int) (v_ArrVal_810 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_801))) (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_804) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_807))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_808))) (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_810) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| (select .cse2 .cse1)))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| (select .cse7 .cse6)))))) is different from false [2022-11-23 06:55:33,451 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int) (v_ArrVal_808 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_815 Int) (v_ArrVal_801 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| Int) (v_ArrVal_810 Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse2 (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 .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| 4)) v_ArrVal_801))) (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_804) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_807))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_808))) (store (store .cse6 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_810) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| (select .cse4 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse1))))))))) is different from false [2022-11-23 06:55:34,147 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int) (v_ArrVal_808 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_807 (Array Int Int)) (v_ArrVal_804 Int) (v_ArrVal_815 Int) (v_ArrVal_801 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| Int) (v_ArrVal_810 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_800))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| 4)) v_ArrVal_801))) (store (store .cse8 .cse6 v_ArrVal_804) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_807))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_808))) (store (store .cse5 .cse6 v_ArrVal_810) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| (select .cse3 .cse1)))))))))) is different from false [2022-11-23 06:55:34,519 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| Int) (v_ArrVal_808 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| Int) (v_ArrVal_804 Int) (v_ArrVal_815 Int) (v_ArrVal_801 Int) (v_ArrVal_810 Int) (v_ArrVal_799 (Array Int Int)) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_799) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_800))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| 4)) v_ArrVal_801))) (store (store .cse8 .cse6 v_ArrVal_804) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_807))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| 4) |c_~#queue~0.offset|) v_ArrVal_808))) (store (store .cse5 .cse6 v_ArrVal_810) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_62| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| (select .cse2 .cse1))) (< 0 (+ (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_56| 4) |c_~#queue~0.offset|) v_ArrVal_815) .cse1) 2147483650)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_59| (select .cse3 .cse1)))))))))) is different from false [2022-11-23 06:55:35,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:35,489 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 2 case distinctions, treesize of input 871 treesize of output 561 [2022-11-23 06:55:35,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:35,534 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 1614 treesize of output 1604 [2022-11-23 06:55:35,554 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 1452 treesize of output 1388 [2022-11-23 06:55:35,585 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 1198 treesize of output 1182 [2022-11-23 06:55:35,605 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 1647 treesize of output 1615 [2022-11-23 06:55:35,626 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 1621 treesize of output 1573 [2022-11-23 06:55:35,663 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-23 06:55:40,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:40,925 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 615 treesize of output 571 [2022-11-23 06:55:41,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:41,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 136 [2022-11-23 06:55:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 62 not checked. [2022-11-23 06:55:42,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754877757] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:55:42,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:55:42,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 31, 36] total 80 [2022-11-23 06:55:42,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315994541] [2022-11-23 06:55:42,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:55:42,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-23 06:55:42,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:55:42,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-23 06:55:42,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=3896, Unknown=54, NotChecked=2002, Total=6480 [2022-11-23 06:55:42,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:42,234 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:55:42,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 80 states have (on average 6.5) internal successors, (520), 81 states have internal predecessors, (520), 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-23 06:55:42,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:42,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:55:42,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:55:42,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:55:42,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:55:42,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:55:42,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:55:42,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-23 06:55:42,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:55:42,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:55:42,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-23 06:55:42,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:55:42,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:55:42,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:55:42,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-23 06:55:42,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:56:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:56:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:56:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:56:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:56:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:56:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:56:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:56:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 06:56:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:56:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:56:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-23 06:56:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:56:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:56:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:56:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-23 06:56:03,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-23 06:56:03,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 06:56:04,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:56:04,165 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-23 06:56:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:56:04,165 INFO L85 PathProgramCache]: Analyzing trace with hash -946567866, now seen corresponding path program 2 times [2022-11-23 06:56:04,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:56:04,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066292081] [2022-11-23 06:56:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:56:04,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:56:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:56:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:56:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:56:12,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066292081] [2022-11-23 06:56:12,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066292081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:56:12,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205608567] [2022-11-23 06:56:12,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 06:56:12,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:56:12,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:56:12,990 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:56:12,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00a9550f-378d-4910-a677-bfee98a0711f/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 06:56:13,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 06:56:13,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 06:56:13,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 130 conjunts are in the unsatisfiable core [2022-11-23 06:56:13,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:56:13,416 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:56:13,416 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-23 06:56:13,495 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:56:13,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:56:13,813 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-23 06:56:13,921 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-23 06:56:14,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-23 06:56:14,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-23 06:56:15,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:56:15,514 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 06:56:15,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-23 06:56:15,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:56:15,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:56:15,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-23 06:56:16,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-23 06:56:16,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:56:16,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-23 06:56:17,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:56:17,127 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-23 06:56:17,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-23 06:56:17,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:56:17,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:56:17,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-23 06:56:18,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-23 06:56:18,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:56:18,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-23 06:56:18,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:56:18,829 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-23 06:56:18,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2022-11-23 06:56:19,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:56:19,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:56:19,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-23 06:56:19,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-23 06:56:20,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:56:20,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-23 06:56:20,479 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-23 06:56:20,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2022-11-23 06:56:20,539 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 06:56:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:56:20,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:56:21,238 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_939 Int) (v_ArrVal_938 (Array Int Int))) (< (select (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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204)))) v_ArrVal_939)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-11-23 06:56:21,686 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (select .cse1 .cse2))) (or (forall ((v_ArrVal_939 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int)) (or (not (<= v_ArrVal_935 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_935) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_939)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))) (= .cse3 800)))) is different from false [2022-11-23 06:56:21,911 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse4))) (or (= .cse0 800) (forall ((v_ArrVal_939 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int)) (let ((.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_935) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_939)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_935))))))) is different from false [2022-11-23 06:56:21,946 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_939 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_933 Int)) (let ((.cse0 (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_933)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (select .cse0 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_935) (= .cse2 800) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_935) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 (+ |c_~#queue~0.offset| 3204)) 4)) v_ArrVal_939)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-23 06:56:21,969 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_939 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_933 Int)) (let ((.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_933)))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (select .cse0 .cse4))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_935) (= .cse2 800) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_935) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_939)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-23 06:56:22,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_939 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_933 Int)) (let ((.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse1 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse5 .cse4) 4)) v_ArrVal_933)))) (let ((.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse0 (select .cse1 .cse4))) (or (= 800 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_935) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse1 .cse2 v_ArrVal_935) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) v_ArrVal_939)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-23 06:56:33,015 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_933 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse3 (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) v_ArrVal_933)))) (let ((.cse5 (select .cse3 .cse1)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_935) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_939)) .cse4) 2147483647) (= 800 .cse5) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935)))))) is different from false [2022-11-23 06:56:33,277 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_933 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse0 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_933)))) (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_935) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_935) .cse3 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_939)) .cse1) 2147483647) (= 800 .cse5)))))) is different from false [2022-11-23 06:56:35,881 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (select .cse7 .cse8))) (or (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_933 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_927) .cse8 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse3 (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) v_ArrVal_933)))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_935) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_939)) .cse4) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935) (not (<= v_ArrVal_927 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (= .cse5 800)))))) (= .cse9 800)))) is different from false [2022-11-23 06:56:36,275 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (select .cse6 .cse9))) (or (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_933 Int)) (let ((.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_927) .cse9 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse3 (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_933)))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_935) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_939)) .cse4) 2147483647) (< (+ 1 (select .cse6 .cse7)) v_ArrVal_927) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935) (= .cse5 800))))))) (= .cse10 800)))) is different from false [2022-11-23 06:56:36,351 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_933 Int)) (let ((.cse6 (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_925)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (select .cse6 .cse10))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_927) .cse10 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse3 (let ((.cse9 (select .cse2 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse5 (select .cse3 .cse1)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_935) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse4) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_927) (= .cse5 800) (= 800 .cse8) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935)))))))) is different from false [2022-11-23 06:56:36,408 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse0 .cse1))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_933 Int)) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_925))) (let ((.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (select .cse2 .cse1))) (let ((.cse9 (+ |c_~#queue~0.offset| 3204)) (.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_927) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse5 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* 4 (select .cse11 .cse9))) v_ArrVal_933)))) (let ((.cse7 (select .cse5 .cse9)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_927) (= .cse4 800) (< (+ (select .cse5 .cse6) 1) v_ArrVal_935) (= .cse7 800) (< (select (let ((.cse8 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_935) .cse9 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse6) 2147483647))))))))))) is different from false [2022-11-23 06:56:36,512 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int) (v_ArrVal_933 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse8 (store .cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4)) v_ArrVal_925)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse10 (select .cse8 .cse7))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse8 .cse9 v_ArrVal_927) .cse7 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse4 (let ((.cse11 (select .cse3 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse0 (select .cse4 .cse2)) (.cse5 (+ 3208 |c_~#queue~0.offset|))) (or (= 800 .cse0) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_935) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_939)) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse6 .cse7))) (< (+ (select .cse8 .cse9) 1) v_ArrVal_927) (< (+ (select .cse4 .cse5) 1) v_ArrVal_935) (= .cse10 800))))))))) is different from false [2022-11-23 06:56:51,638 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_923 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int) (v_ArrVal_933 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse6 .cse1))) (let ((.cse2 (store (store .cse10 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_927) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse3 (let ((.cse9 (select .cse2 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_933)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_935) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse4) 2147483647) (< (+ (select .cse6 .cse4) 1) v_ArrVal_927) (not (<= v_ArrVal_923 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse7 .cse1))) (= 800 .cse5) (= .cse8 800) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935)))))))))) is different from false [2022-11-23 06:56:51,804 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_923 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int) (v_ArrVal_933 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse6 .cse1))) (let ((.cse2 (store (store .cse10 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_927) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse3 (let ((.cse9 (select .cse2 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_933)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_923) (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_935) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse4) 2147483647) (< (+ (select .cse6 .cse4) 1) v_ArrVal_927) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse7 .cse1))) (= 800 .cse5) (= .cse8 800) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935)))))))))) is different from false [2022-11-23 06:56:51,869 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_923 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int) (v_ArrVal_933 Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse6 .cse1))) (let ((.cse2 (store (store .cse12 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_927) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse3 (let ((.cse11 (select .cse2 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) v_ArrVal_933)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_935) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse4) 2147483647) (< (+ (select .cse6 .cse4) 1) v_ArrVal_927) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse7 .cse1))) (= 800 .cse5) (= .cse8 800) (< (+ (select .cse9 .cse10) 1) v_ArrVal_923) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935))))))))))) is different from false [2022-11-23 06:56:52,204 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_923 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int) (v_ArrVal_933 Int) (v_ArrVal_921 Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_921) .cse10 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse1 .cse5))) (let ((.cse7 (store (store .cse12 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_927) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse3 (let ((.cse11 (select .cse7 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse5) 4)) v_ArrVal_933)))) (let ((.cse8 (select .cse3 .cse5))) (or (= 800 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_927) (not (<= v_ArrVal_921 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse4 .cse5))) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_935) .cse5 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse2) 2147483647) (< (+ (select .cse9 .cse10) 1) v_ArrVal_923) (= .cse8 800))))))))))) is different from false [2022-11-23 06:56:52,424 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_923 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int) (v_ArrVal_933 Int) (v_ArrVal_921 Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_921) .cse10 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse1 .cse5))) (let ((.cse7 (store (store .cse12 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_927) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse3 (let ((.cse11 (select .cse7 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse5) 4)) v_ArrVal_933)))) (let ((.cse8 (select .cse3 .cse5))) (or (= 800 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_927) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_921) (< (+ (select .cse3 .cse2) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse4 .cse5))) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_935) .cse5 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse2) 2147483647) (< (+ (select .cse9 .cse10) 1) v_ArrVal_923) (= .cse8 800))))))))))) is different from false [2022-11-23 06:56:52,504 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_938 (Array Int Int)) (v_ArrVal_935 Int) (v_ArrVal_923 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int) (v_ArrVal_933 Int) (v_ArrVal_921 Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse11 v_ArrVal_921) .cse10 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse4 (select .cse13 |c_~#queue~0.base|))) (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse1 .cse5))) (let ((.cse7 (store (store .cse13 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_927) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse3 (let ((.cse12 (select .cse7 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse5) 4)) v_ArrVal_933)))) (let ((.cse8 (select .cse3 .cse5))) (or (= 800 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_927) (< (+ (select .cse3 .cse2) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse4 .cse5))) (< (select (let ((.cse6 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_935) .cse5 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse2) 2147483647) (< (+ (select .cse9 .cse10) 1) v_ArrVal_923) (< (+ 1 (select .cse9 .cse11)) v_ArrVal_921) (= .cse8 800))))))))))) is different from false [2022-11-23 06:56:52,661 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_918 Int) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_935 Int) (v_ArrVal_923 Int) (v_ArrVal_933 Int) (v_ArrVal_921 Int) (v_ArrVal_931 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_938 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int)) (let ((.cse0 (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_918)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse7 v_ArrVal_921) .cse1 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse2 (select .cse13 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse11 (select .cse4 .cse3))) (let ((.cse9 (store (store .cse13 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_927) .cse3 (+ 1 .cse11))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse10 (let ((.cse12 (select .cse9 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* 4 (select .cse12 .cse3))) v_ArrVal_933)))) (let ((.cse6 (select .cse10 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_923) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse2 .cse3))) (< (+ 1 (select .cse4 .cse5)) v_ArrVal_927) (= 800 .cse6) (< (+ (select .cse0 .cse7) 1) v_ArrVal_921) (< (select (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_935) .cse3 (+ 1 .cse6))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse5) 2147483647) (< (+ (select .cse10 .cse5) 1) v_ArrVal_935) (= 800 .cse11))))))))))) is different from false [2022-11-23 06:56:52,799 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| Int)) (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_918 Int) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_935 Int) (v_ArrVal_923 Int) (v_ArrVal_933 Int) (v_ArrVal_921 Int) (v_ArrVal_931 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_938 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int)) (let ((.cse6 (store .cse14 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_918)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_921) .cse10 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse8 (select .cse13 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse11 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse13 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_927) .cse1 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse3 (let ((.cse12 (select .cse2 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_935) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse4) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_921) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse8 .cse1))) (< (+ (select .cse9 .cse4) 1) v_ArrVal_927) (< (+ (select .cse6 .cse10) 1) v_ArrVal_923) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935) (= 800 .cse11) (= 800 .cse5))))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| (select .cse14 .cse10)))))) is different from false [2022-11-23 06:56:52,988 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_918 Int) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_935 Int) (v_ArrVal_923 Int) (v_ArrVal_933 Int) (v_ArrVal_921 Int) (v_ArrVal_931 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_938 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse10 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| 4)) v_ArrVal_918)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse3 .cse8 v_ArrVal_921) .cse4 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse0 (select .cse14 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse9 (select .cse7 .cse1))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_927) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse5 (let ((.cse13 (select .cse12 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse0 .cse1))) (= .cse2 800) (< (+ (select .cse3 .cse4) 1) v_ArrVal_923) (< (+ (select .cse5 .cse6) 1) v_ArrVal_935) (< (+ (select .cse7 .cse6) 1) v_ArrVal_927) (< (+ (select .cse3 .cse8) 1) v_ArrVal_921) (= .cse9 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| (select .cse10 .cse4))) (< (select (let ((.cse11 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_935) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_939)) .cse6) 2147483647)))))))))))) is different from false [2022-11-23 06:57:19,377 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_918 Int) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_935 Int) (v_ArrVal_923 Int) (v_ArrVal_933 Int) (v_ArrVal_921 Int) (v_ArrVal_931 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_938 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917))) (let ((.cse8 (select .cse13 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| 4) |c_~#queue~0.offset|) v_ArrVal_918)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_921) .cse6 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse5 (select .cse12 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925))) (let ((.cse4 (select .cse7 .cse6))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_927) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse2 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse3 (select .cse2 .cse6))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_921) (< (+ (select .cse2 .cse1) 1) v_ArrVal_935) (= 800 .cse3) (= 800 .cse4) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse5 .cse6))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_927) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| (select .cse8 .cse6))) (< (+ (select .cse0 .cse6) 1) v_ArrVal_923) (< (select (let ((.cse9 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_935) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse6) 4)) v_ArrVal_939)) .cse1) 2147483647))))))))))))) is different from false [2022-11-23 06:57:20,365 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_918 Int) (v_ArrVal_939 Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_935 Int) (v_ArrVal_923 Int) (v_ArrVal_933 Int) (v_ArrVal_921 Int) (v_ArrVal_931 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_917 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_938 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| Int)) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_917))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| 4) |c_~#queue~0.offset|) v_ArrVal_918)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_921) .cse5 v_ArrVal_923)) |c_~#stored_elements~0.base| v_ArrVal_924))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| 4) |c_~#queue~0.offset|) v_ArrVal_925))) (let ((.cse2 (select .cse10 .cse5))) (let ((.cse6 (store (store .cse12 |c_~#queue~0.base| (store (store .cse10 .cse1 v_ArrVal_927) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_931))) (let ((.cse0 (let ((.cse11 (select .cse6 |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse5)) |c_~#queue~0.offset|) v_ArrVal_933)))) (let ((.cse3 (select .cse0 .cse5))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_935) (= 800 .cse2) (= 800 .cse3) (< (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_935) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_938) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse5) 4)) v_ArrVal_939)) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_75| (select .cse7 .cse5))) (< (+ (select .cse8 .cse5) 1) v_ArrVal_923) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_72| (select .cse9 .cse5))) (< (+ (select .cse10 .cse1) 1) v_ArrVal_927) (< (+ (select .cse8 .cse1) 1) v_ArrVal_921))))))))))))) is different from false [2022-11-23 06:57:23,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:57:23,623 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 2 case distinctions, treesize of input 3901 treesize of output 2526 [2022-11-23 06:57:23,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:57:23,690 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 6072 treesize of output 6036 [2022-11-23 06:57:23,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2666 treesize of output 2654 [2022-11-23 06:57:23,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 5073 treesize of output 5049 [2022-11-23 06:57:23,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2871 treesize of output 2679 [2022-11-23 06:57:23,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4599 treesize of output 4279 [2022-11-23 06:57:24,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4851 treesize of output 4659 [2022-11-23 06:57:24,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:57:24,261 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 17 treesize of output 9 [2022-11-23 06:57:28,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:57:28,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1835 treesize of output 1851 [2022-11-23 06:57:36,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:57:36,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 85 [2022-11-23 06:57:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 54 refuted. 28 times theorem prover too weak. 0 trivial. 92 not checked. [2022-11-23 06:57:36,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205608567] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:57:36,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:57:36,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 55] total 146 [2022-11-23 06:57:36,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641483553] [2022-11-23 06:57:36,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:57:36,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2022-11-23 06:57:36,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:57:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2022-11-23 06:57:36,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2020, Invalid=12877, Unknown=205, NotChecked=6360, Total=21462 [2022-11-23 06:57:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:57:36,956 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:57:36,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 147 states, 146 states have (on average 4.239726027397261) internal successors, (619), 147 states have internal predecessors, (619), 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-23 06:57:36,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:57:36,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:57:36,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-23 06:57:36,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:57:36,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:57:36,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:57:36,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:57:36,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-23 06:57:36,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:57:36,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:57:36,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-23 06:57:36,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-23 06:57:36,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-23 06:57:36,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:57:36,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-23 06:57:36,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-23 06:57:36,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:58:35,535 WARN L233 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 448 DAG size of output: 206 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:58:55,423 WARN L233 SmtUtils]: Spent 9.71s on a formula simplification. DAG size of input: 397 DAG size of output: 215 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:59:21,700 WARN L233 SmtUtils]: Spent 10.87s on a formula simplification. DAG size of input: 435 DAG size of output: 285 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:59:35,454 WARN L233 SmtUtils]: Spent 9.33s on a formula simplification. DAG size of input: 465 DAG size of output: 343 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:59:54,448 WARN L233 SmtUtils]: Spent 9.16s on a formula simplification. DAG size of input: 396 DAG size of output: 243 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 06:59:58,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:00:01,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:00:03,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:00:05,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:00:14,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:00:29,736 WARN L233 SmtUtils]: Spent 7.69s on a formula simplification. DAG size of input: 223 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 07:00:46,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:00:48,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:00:49,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:00:51,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:01:08,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:01:11,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:01:13,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:01:16,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:01:18,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:01:20,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:01:22,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:01:59,437 WARN L233 SmtUtils]: Spent 17.47s on a formula simplification. DAG size of input: 273 DAG size of output: 193 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 07:02:01,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:03,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:05,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:07,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:10,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:13,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:16,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:18,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:21,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:02:47,778 WARN L233 SmtUtils]: Spent 9.13s on a formula simplification. DAG size of input: 287 DAG size of output: 202 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 07:03:23,895 WARN L233 SmtUtils]: Spent 18.36s on a formula simplification. DAG size of input: 326 DAG size of output: 237 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 07:03:26,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:03:50,786 WARN L233 SmtUtils]: Spent 14.06s on a formula simplification. DAG size of input: 328 DAG size of output: 212 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 07:03:52,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:03:55,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:03:57,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:03:59,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:01,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:03,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:05,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:07,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:22,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:24,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:45,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:47,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:55,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:57,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:04:58,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:05:40,057 WARN L233 SmtUtils]: Spent 37.02s on a formula simplification. DAG size of input: 131 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 07:05:42,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:05:44,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:05:46,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:05:48,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:05:50,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:06:00,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 07:06:13,146 WARN L233 SmtUtils]: Spent 11.94s on a formula simplification. DAG size of input: 125 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)